About the Execution of ITS-Tools for FunctionPointer-PT-c004
| 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 ? 4 ? ? ? inf inf ? 4 4 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007400125.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-c004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007400125
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K 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-c004-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748831211536
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-c004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 02:26:54] [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 02:26:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 02:26:55] [INFO ] Load time of PNML (sax parser for PT used): 854 ms
[2025-06-02 02:26:55] [INFO ] Transformed 2826 places.
[2025-06-02 02:26:55] [INFO ] Transformed 8960 transitions.
[2025-06-02 02:26:55] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 1122 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Deduced a syphon composed of 1198 places in 62 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c004-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 02:26:55] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2025-06-02 02:26:55] [INFO ] Computed 4 invariants in 181 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 4, +inf, +inf, +inf, +inf, +inf, +inf, 4, 4]
RANDOM walk for 10000 steps (2 resets) in 638 ms. (15 steps per ms)
BEST_FIRST walk for 140014 steps (29 resets) in 476 ms. (293 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 6, 1, 1, 3, 2, 1, 5, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, 4, +inf, +inf, +inf, +inf, +inf, +inf, 4, 4]
[2025-06-02 02:26:56] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
[2025-06-02 02:26:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 02:26:57] [INFO ] [Real]Absence check using 3 positive place invariants in 43 ms returned sat
[2025-06-02 02:26:57] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-02 02:26:59] [INFO ] [Real]Absence check using state equation in 1928 ms returned sat
[2025-06-02 02:27:00] [INFO ] State equation strengthened by 479 read => feed constraints.
[2025-06-02 02:27:00] [INFO ] [Real]Added 479 Read/Feed constraints in 395 ms returned sat
[2025-06-02 02:27:00] [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 02:27:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 38 ms returned sat
[2025-06-02 02:27:01] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 02:27:03] [INFO ] [Nat]Absence check using state equation in 1728 ms returned sat
[2025-06-02 02:27:03] [INFO ] [Nat]Added 479 Read/Feed constraints in 329 ms returned sat
[2025-06-02 02:27:05] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 1915 ms.
[2025-06-02 02:27:05] [INFO ] Added : 0 causal constraints over 0 iterations in 1927 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 02:27:06] [INFO ] [Real]Absence check using 3 positive place invariants in 20 ms returned sat
[2025-06-02 02:27:06] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 02:27:07] [INFO ] [Real]Absence check using state equation in 1436 ms returned sat
[2025-06-02 02:27:07] [INFO ] [Real]Added 479 Read/Feed constraints in 210 ms returned sat
[2025-06-02 02:27:07] [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 02:27:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 47 ms returned sat
[2025-06-02 02:27:08] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 02:27:10] [INFO ] [Nat]Absence check using state equation in 1767 ms returned sat
[2025-06-02 02:27:10] [INFO ] [Nat]Added 479 Read/Feed constraints in 335 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:27:14] [INFO ] Deduced a trap composed of 133 places in 3885 ms of which 312 ms to minimize.
[2025-06-02 02:27:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
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 02:27:14] [INFO ] [Real]Absence check using 3 positive place invariants in 20 ms returned sat
[2025-06-02 02:27:14] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 02:27:16] [INFO ] [Real]Absence check using state equation in 1301 ms returned sat
[2025-06-02 02:27:16] [INFO ] [Real]Added 479 Read/Feed constraints in 230 ms returned sat
[2025-06-02 02:27:16] [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 02:27:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 21 ms returned sat
[2025-06-02 02:27:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 02:27:18] [INFO ] [Nat]Absence check using state equation in 1435 ms returned sat
[2025-06-02 02:27:18] [INFO ] [Nat]Added 479 Read/Feed constraints in 301 ms returned sat
[2025-06-02 02:27:20] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 1553 ms.
[2025-06-02 02:27:21] [INFO ] Added : 3 causal constraints over 1 iterations in 2422 ms. Result :sat
Minimization took 393 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 02:27:22] [INFO ] [Real]Absence check using 3 positive place invariants in 33 ms returned sat
[2025-06-02 02:27:22] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 02:27:23] [INFO ] [Real]Absence check using state equation in 1474 ms returned sat
[2025-06-02 02:27:23] [INFO ] [Real]Added 479 Read/Feed constraints in 242 ms returned sat
[2025-06-02 02:27:24] [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 02:27:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 21 ms returned sat
[2025-06-02 02:27:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 02:27:25] [INFO ] [Nat]Absence check using state equation in 1479 ms returned sat
[2025-06-02 02:27:26] [INFO ] [Nat]Added 479 Read/Feed constraints in 170 ms returned sat
[2025-06-02 02:27:27] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 950 ms.
[2025-06-02 02:27:27] [INFO ] Added : 1 causal constraints over 1 iterations in 1594 ms. Result :sat
Minimization took 623 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 02:27:28] [INFO ] [Real]Absence check using 3 positive place invariants in 21 ms returned sat
[2025-06-02 02:27:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 11 ms returned sat
[2025-06-02 02:27:29] [INFO ] [Real]Absence check using state equation in 1256 ms returned sat
[2025-06-02 02:27:30] [INFO ] [Real]Added 479 Read/Feed constraints in 197 ms returned sat
[2025-06-02 02:27:30] [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 02:27:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 25 ms returned sat
[2025-06-02 02:27:30] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 02:27:32] [INFO ] [Nat]Absence check using state equation in 1544 ms returned sat
[2025-06-02 02:27:32] [INFO ] [Nat]Added 479 Read/Feed constraints in 189 ms returned sat
[2025-06-02 02:27:33] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 1052 ms.
[2025-06-02 02:27:34] [INFO ] Added : 2 causal constraints over 1 iterations in 1949 ms. Result :sat
Minimization took 611 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 02:27:35] [INFO ] [Real]Absence check using 3 positive place invariants in 33 ms returned sat
[2025-06-02 02:27:35] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 02:27:37] [INFO ] [Real]Absence check using state equation in 1481 ms returned sat
[2025-06-02 02:27:37] [INFO ] [Real]Added 479 Read/Feed constraints in 209 ms returned sat
[2025-06-02 02:27:37] [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 02:27:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 35 ms returned sat
[2025-06-02 02:27:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 02:27:39] [INFO ] [Nat]Absence check using state equation in 1668 ms returned sat
[2025-06-02 02:27:40] [INFO ] [Nat]Added 479 Read/Feed constraints in 198 ms returned sat
[2025-06-02 02:27:41] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 1194 ms.
[2025-06-02 02:27:41] [INFO ] Added : 0 causal constraints over 0 iterations in 1612 ms. Result :sat
Minimization took 598 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 02:27:43] [INFO ] [Real]Absence check using 3 positive place invariants in 31 ms returned sat
[2025-06-02 02:27:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 02:27:44] [INFO ] [Real]Absence check using state equation in 1602 ms returned sat
[2025-06-02 02:27:45] [INFO ] [Real]Added 479 Read/Feed constraints in 260 ms returned sat
[2025-06-02 02:27:45] [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 02:27:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 34 ms returned sat
[2025-06-02 02:27:45] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 11 ms returned sat
[2025-06-02 02:27:47] [INFO ] [Nat]Absence check using state equation in 1588 ms returned sat
[2025-06-02 02:27:47] [INFO ] [Nat]Added 479 Read/Feed constraints in 390 ms returned sat
[2025-06-02 02:27:48] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 1006 ms.
[2025-06-02 02:27:49] [INFO ] Added : 2 causal constraints over 1 iterations in 1857 ms. Result :sat
Minimization took 498 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 02:27:50] [INFO ] [Real]Absence check using 3 positive place invariants in 32 ms returned sat
[2025-06-02 02:27:50] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 02:27:52] [INFO ] [Real]Absence check using state equation in 1870 ms returned sat
[2025-06-02 02:27:52] [INFO ] [Real]Added 479 Read/Feed constraints in 204 ms returned sat
[2025-06-02 02:27:53] [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 02:27:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 34 ms returned sat
[2025-06-02 02:27:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 02:27:55] [INFO ] [Nat]Absence check using state equation in 1717 ms returned sat
[2025-06-02 02:27:55] [INFO ] [Nat]Added 479 Read/Feed constraints in 264 ms returned sat
[2025-06-02 02:27:56] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 1042 ms.
[2025-06-02 02:27:57] [INFO ] Added : 2 causal constraints over 1 iterations in 1886 ms. Result :sat
Minimization took 469 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 02:27:58] [INFO ] [Real]Absence check using 3 positive place invariants in 33 ms returned sat
[2025-06-02 02:27:58] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 02:28:00] [INFO ] [Real]Absence check using state equation in 1571 ms returned sat
[2025-06-02 02:28:00] [INFO ] [Real]Added 479 Read/Feed constraints in 208 ms returned sat
[2025-06-02 02:28:00] [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 02:28:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 21 ms returned sat
[2025-06-02 02:28:00] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 02:28:02] [INFO ] [Nat]Absence check using state equation in 1447 ms returned sat
[2025-06-02 02:28:02] [INFO ] [Nat]Added 479 Read/Feed constraints in 201 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:28:05] [INFO ] Deduced a trap composed of 133 places in 3170 ms of which 322 ms to minimize.
[2025-06-02 02:28:05] [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 8
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.verifyPossible(DeadlockTester.java:871)
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 02:28:06] [INFO ] [Real]Absence check using 3 positive place invariants in 21 ms returned sat
[2025-06-02 02:28:06] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 02:28:07] [INFO ] [Real]Absence check using state equation in 1567 ms returned sat
[2025-06-02 02:28:08] [INFO ] [Real]Added 479 Read/Feed constraints in 261 ms returned sat
[2025-06-02 02:28:08] [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 02:28:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 25 ms returned sat
[2025-06-02 02:28:08] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 02:28:10] [INFO ] [Nat]Absence check using state equation in 1594 ms returned sat
[2025-06-02 02:28:10] [INFO ] [Nat]Added 479 Read/Feed constraints in 286 ms returned sat
[2025-06-02 02:28:11] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 1035 ms.
[2025-06-02 02:28:12] [INFO ] Added : 2 causal constraints over 1 iterations in 1876 ms. Result :sat
Minimization took 611 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 02:28:13] [INFO ] [Real]Absence check using 3 positive place invariants in 20 ms returned sat
[2025-06-02 02:28:13] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 02:28:15] [INFO ] [Real]Absence check using state equation in 1536 ms returned sat
[2025-06-02 02:28:15] [INFO ] [Real]Added 479 Read/Feed constraints in 225 ms returned sat
[2025-06-02 02:28:15] [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 02:28:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 23 ms returned sat
[2025-06-02 02:28:16] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 02:28:17] [INFO ] [Nat]Absence check using state equation in 1415 ms returned sat
[2025-06-02 02:28:17] [INFO ] [Nat]Added 479 Read/Feed constraints in 204 ms returned sat
[2025-06-02 02:28:18] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 798 ms.
[2025-06-02 02:28:19] [INFO ] Added : 2 causal constraints over 1 iterations in 1735 ms. Result :sat
Minimization took 587 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 02:28:20] [INFO ] [Real]Absence check using 3 positive place invariants in 20 ms returned sat
[2025-06-02 02:28:20] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 02:28:21] [INFO ] [Real]Absence check using state equation in 1511 ms returned sat
[2025-06-02 02:28:22] [INFO ] [Real]Added 479 Read/Feed constraints in 408 ms returned sat
[2025-06-02 02:28:22] [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 02:28:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 33 ms returned sat
[2025-06-02 02:28:23] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 02:28:24] [INFO ] [Nat]Absence check using state equation in 1451 ms returned sat
[2025-06-02 02:28:24] [INFO ] [Nat]Added 479 Read/Feed constraints in 197 ms returned sat
[2025-06-02 02:28:25] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 736 ms.
[2025-06-02 02:28:26] [INFO ] Added : 2 causal constraints over 1 iterations in 1417 ms. Result :sat
Minimization took 624 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 02:28:27] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2025-06-02 02:28:27] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 9 ms returned sat
[2025-06-02 02:28:28] [INFO ] [Real]Absence check using state equation in 1195 ms returned sat
[2025-06-02 02:28:28] [INFO ] [Real]Added 479 Read/Feed constraints in 294 ms returned sat
[2025-06-02 02:28:29] [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 02:28:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 38 ms returned sat
[2025-06-02 02:28:29] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 02:28:31] [INFO ] [Nat]Absence check using state equation in 1578 ms returned sat
[2025-06-02 02:28:31] [INFO ] [Nat]Added 479 Read/Feed constraints in 165 ms returned sat
[2025-06-02 02:28:32] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 944 ms.
[2025-06-02 02:28:32] [INFO ] Added : 0 causal constraints over 0 iterations in 1378 ms. Result :sat
Minimization took 646 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 02:28:33] [INFO ] [Real]Absence check using 3 positive place invariants in 33 ms returned sat
[2025-06-02 02:28:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-02 02:28:35] [INFO ] [Real]Absence check using state equation in 1502 ms returned sat
[2025-06-02 02:28:35] [INFO ] [Real]Added 479 Read/Feed constraints in 324 ms returned sat
[2025-06-02 02:28: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 02:28:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 36 ms returned sat
[2025-06-02 02:28:36] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 02:28:38] [INFO ] [Nat]Absence check using state equation in 1554 ms returned sat
[2025-06-02 02:28:38] [INFO ] [Nat]Added 479 Read/Feed constraints in 275 ms returned sat
[2025-06-02 02:28:39] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 995 ms.
[2025-06-02 02:28:40] [INFO ] Added : 2 causal constraints over 1 iterations in 1756 ms. Result :sat
Minimization took 609 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 6, 1, 1, 3, 2, 1, 5, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, 4, +inf, +inf, +inf, +inf, +inf, +inf, 4, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 6, 1, 1, 3, 2, 1, 5, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, 4, +inf, +inf, +inf, +inf, +inf, +inf, 4, 4]
Support contains 14 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.29 ms
Discarding 206 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 1422 transition count 5583
Discarding 298 places :
Symmetric choice reduction at 1 with 298 rule applications. Total rules 678 place count 1124 transition count 3333
Iterating global reduction 1 with 298 rules applied. Total rules applied 976 place count 1124 transition count 3333
Ensure Unique test removed 380 transitions
Reduce isomorphic transitions removed 380 transitions.
Iterating post reduction 1 with 380 rules applied. Total rules applied 1356 place count 1124 transition count 2953
Discarding 154 places :
Symmetric choice reduction at 2 with 154 rule applications. Total rules 1510 place count 970 transition count 2645
Iterating global reduction 2 with 154 rules applied. Total rules applied 1664 place count 970 transition count 2645
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 1740 place count 970 transition count 2569
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1753 place count 957 transition count 2543
Iterating global reduction 3 with 13 rules applied. Total rules applied 1766 place count 957 transition count 2543
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1779 place count 944 transition count 2517
Iterating global reduction 3 with 13 rules applied. Total rules applied 1792 place count 944 transition count 2517
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1805 place count 931 transition count 2491
Iterating global reduction 3 with 13 rules applied. Total rules applied 1818 place count 931 transition count 2491
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1831 place count 918 transition count 2465
Iterating global reduction 3 with 13 rules applied. Total rules applied 1844 place count 918 transition count 2465
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1857 place count 905 transition count 2439
Iterating global reduction 3 with 13 rules applied. Total rules applied 1870 place count 905 transition count 2439
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1883 place count 892 transition count 2413
Iterating global reduction 3 with 13 rules applied. Total rules applied 1896 place count 892 transition count 2413
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1909 place count 879 transition count 2387
Iterating global reduction 3 with 13 rules applied. Total rules applied 1922 place count 879 transition count 2387
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 1972 place count 829 transition count 2201
Iterating global reduction 3 with 50 rules applied. Total rules applied 2022 place count 829 transition count 2201
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2077 place count 774 transition count 1981
Iterating global reduction 3 with 55 rules applied. Total rules applied 2132 place count 774 transition count 1981
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2187 place count 719 transition count 1843
Iterating global reduction 3 with 55 rules applied. Total rules applied 2242 place count 719 transition count 1843
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2297 place count 664 transition count 1733
Iterating global reduction 3 with 55 rules applied. Total rules applied 2352 place count 664 transition count 1733
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2406 place count 610 transition count 1625
Iterating global reduction 3 with 54 rules applied. Total rules applied 2460 place count 610 transition count 1625
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2514 place count 556 transition count 1517
Iterating global reduction 3 with 54 rules applied. Total rules applied 2568 place count 556 transition count 1517
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2621 place count 503 transition count 1411
Iterating global reduction 3 with 53 rules applied. Total rules applied 2674 place count 503 transition count 1411
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 2688 place count 489 transition count 1383
Iterating global reduction 3 with 14 rules applied. Total rules applied 2702 place count 489 transition count 1383
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 2720 place count 489 transition count 1365
Applied a total of 2720 rules in 1748 ms. Remains 489 /1628 variables (removed 1139) and now considering 1365/5962 (removed 4597) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1766 ms. Remains : 489/1628 places, 1365/5962 transitions.
[2025-06-02 02:28:42] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {217=1, 365=1, 702=1, 790=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {234=1, 382=1, 719=1, 787=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 14) seen :[0, 0, 2, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 1, 2, 6, 1, 1, 3, 2, 1, 5, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, 4, +inf, +inf, +inf, +inf, +inf, +inf, 4, 4]
[2025-06-02 02:28:43] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
// Phase 1: matrix 799 rows 489 cols
[2025-06-02 02:28:43] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 2, 6, 1, 1, 3, 2, 1, 5, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, 4, +inf, +inf, +inf, +inf, +inf, +inf, 4, 4]
RANDOM walk for 1000000 steps (2 resets) in 4689 ms. (213 steps per ms)
BEST_FIRST walk for 14000013 steps (28 resets) in 12354 ms. (1133 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 5, 179, 6, 2, 1, 4, 8, 1, 10, 3, 4, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, 4, +inf, +inf, +inf, +inf, +inf, +inf, 4, 4]
[2025-06-02 02:29:00] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:29:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:29:00] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:29:01] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2025-06-02 02:29:01] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-06-02 02:29:01] [INFO ] [Real]Added 104 Read/Feed constraints in 82 ms returned sat
[2025-06-02 02:29: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 02:29:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:29:01] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2025-06-02 02:29:02] [INFO ] [Nat]Added 104 Read/Feed constraints in 98 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:29:02] [INFO ] Deduced a trap composed of 79 places in 808 ms of which 63 ms to minimize.
[2025-06-02 02:29:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 912 ms
[2025-06-02 02:29:03] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 201 ms.
[2025-06-02 02:29:03] [INFO ] Added : 1 causal constraints over 1 iterations in 396 ms. Result :sat
Minimization took 587 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:29:04] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:29:04] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2025-06-02 02:29:04] [INFO ] [Real]Added 104 Read/Feed constraints in 73 ms returned sat
[2025-06-02 02:29:04] [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 02:29:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:29:05] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2025-06-02 02:29:05] [INFO ] [Nat]Added 104 Read/Feed constraints in 95 ms returned sat
[2025-06-02 02:29:05] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 181 ms.
[2025-06-02 02:29:05] [INFO ] Added : 2 causal constraints over 1 iterations in 361 ms. Result :sat
Minimization took 543 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:29:06] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:29:07] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2025-06-02 02:29:07] [INFO ] [Real]Added 104 Read/Feed constraints in 102 ms returned sat
[2025-06-02 02:29: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 02:29:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:29:07] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2025-06-02 02:29:07] [INFO ] [Nat]Added 104 Read/Feed constraints in 129 ms returned sat
[2025-06-02 02:29:08] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 209 ms.
[2025-06-02 02:29:08] [INFO ] Added : 3 causal constraints over 1 iterations in 467 ms. Result :sat
Minimization took 591 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:29:09] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:29:09] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2025-06-02 02:29:09] [INFO ] [Real]Added 104 Read/Feed constraints in 66 ms returned sat
[2025-06-02 02:29: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 02:29:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:29:10] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2025-06-02 02:29:10] [INFO ] [Nat]Added 104 Read/Feed constraints in 75 ms returned sat
[2025-06-02 02:29:10] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 179 ms.
[2025-06-02 02:29:10] [INFO ] Added : 1 causal constraints over 1 iterations in 373 ms. Result :sat
Minimization took 598 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:29:11] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:29:12] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2025-06-02 02:29:12] [INFO ] [Real]Added 104 Read/Feed constraints in 68 ms returned sat
[2025-06-02 02:29: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 02:29:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2025-06-02 02:29:12] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2025-06-02 02:29:13] [INFO ] [Nat]Added 104 Read/Feed constraints in 148 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:29:13] [INFO ] Deduced a trap composed of 79 places in 664 ms of which 36 ms to minimize.
[2025-06-02 02:29:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 753 ms
[2025-06-02 02:29:14] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 184 ms.
[2025-06-02 02:29:14] [INFO ] Added : 2 causal constraints over 1 iterations in 374 ms. Result :sat
Minimization took 527 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:29:14] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:29:15] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2025-06-02 02:29:15] [INFO ] [Real]Added 104 Read/Feed constraints in 76 ms returned sat
[2025-06-02 02:29:15] [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 02:29:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:29:16] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2025-06-02 02:29:16] [INFO ] [Nat]Added 104 Read/Feed constraints in 79 ms returned sat
[2025-06-02 02:29:16] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 205 ms.
[2025-06-02 02:29:16] [INFO ] Added : 0 causal constraints over 0 iterations in 329 ms. Result :sat
Minimization took 549 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:29:17] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-02 02:29:17] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2025-06-02 02:29:17] [INFO ] [Real]Added 104 Read/Feed constraints in 80 ms returned sat
[2025-06-02 02:29: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 02:29:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:29:18] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2025-06-02 02:29:18] [INFO ] [Nat]Added 104 Read/Feed constraints in 85 ms returned sat
[2025-06-02 02:29:18] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 180 ms.
[2025-06-02 02:29:18] [INFO ] Added : 2 causal constraints over 1 iterations in 361 ms. Result :sat
Minimization took 508 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:29:19] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:29:19] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2025-06-02 02:29:19] [INFO ] [Real]Added 104 Read/Feed constraints in 66 ms returned sat
[2025-06-02 02:29: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 02:29:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:29:20] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2025-06-02 02:29:20] [INFO ] [Nat]Added 104 Read/Feed constraints in 85 ms returned sat
[2025-06-02 02:29:20] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 181 ms.
[2025-06-02 02:29:21] [INFO ] Added : 2 causal constraints over 1 iterations in 351 ms. Result :sat
Minimization took 553 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:29:21] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:29:22] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2025-06-02 02:29:22] [INFO ] [Real]Added 104 Read/Feed constraints in 48 ms returned sat
[2025-06-02 02:29: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 02:29:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:29:22] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2025-06-02 02:29:22] [INFO ] [Nat]Added 104 Read/Feed constraints in 73 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:29:23] [INFO ] Deduced a trap composed of 79 places in 746 ms of which 56 ms to minimize.
[2025-06-02 02:29:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 887 ms
[2025-06-02 02:29:23] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 186 ms.
[2025-06-02 02:29:24] [INFO ] Added : 2 causal constraints over 1 iterations in 369 ms. Result :sat
Minimization took 681 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:29:24] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:29:25] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2025-06-02 02:29:25] [INFO ] [Real]Added 104 Read/Feed constraints in 92 ms returned sat
[2025-06-02 02:29:25] [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 02:29:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:29:26] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2025-06-02 02:29:26] [INFO ] [Nat]Added 104 Read/Feed constraints in 107 ms returned sat
[2025-06-02 02:29:26] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 139 ms.
[2025-06-02 02:29:26] [INFO ] Added : 2 causal constraints over 1 iterations in 296 ms. Result :sat
Minimization took 564 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:29:27] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:29:27] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2025-06-02 02:29:27] [INFO ] [Real]Added 104 Read/Feed constraints in 75 ms returned sat
[2025-06-02 02:29: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 02:29:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:29:28] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2025-06-02 02:29:28] [INFO ] [Nat]Added 104 Read/Feed constraints in 111 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:29:29] [INFO ] Deduced a trap composed of 79 places in 748 ms of which 36 ms to minimize.
[2025-06-02 02:29:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 834 ms
[2025-06-02 02:29:29] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 123 ms.
[2025-06-02 02:29:29] [INFO ] Added : 2 causal constraints over 1 iterations in 245 ms. Result :sat
Minimization took 369 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:29:30] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 02:29:30] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2025-06-02 02:29:30] [INFO ] [Real]Added 104 Read/Feed constraints in 55 ms returned sat
[2025-06-02 02:29: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 02:29:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:29:31] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2025-06-02 02:29:31] [INFO ] [Nat]Added 104 Read/Feed constraints in 57 ms returned sat
[2025-06-02 02:29:31] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 162 ms.
[2025-06-02 02:29:31] [INFO ] Added : 2 causal constraints over 1 iterations in 308 ms. Result :sat
Minimization took 482 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:29:32] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:29:32] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2025-06-02 02:29:32] [INFO ] [Real]Added 104 Read/Feed constraints in 67 ms returned sat
[2025-06-02 02:29: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 02:29:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:29:33] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2025-06-02 02:29:33] [INFO ] [Nat]Added 104 Read/Feed constraints in 58 ms returned sat
[2025-06-02 02:29:33] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 171 ms.
[2025-06-02 02:29:33] [INFO ] Added : 0 causal constraints over 0 iterations in 279 ms. Result :sat
Minimization took 569 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:29:34] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:29:35] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2025-06-02 02:29:35] [INFO ] [Real]Added 104 Read/Feed constraints in 61 ms returned sat
[2025-06-02 02:29:35] [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 02:29:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:29:35] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2025-06-02 02:29:35] [INFO ] [Nat]Added 104 Read/Feed constraints in 137 ms returned sat
[2025-06-02 02:29:36] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 199 ms.
[2025-06-02 02:29:36] [INFO ] Added : 2 causal constraints over 1 iterations in 409 ms. Result :sat
Minimization took 855 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 5, 179, 6, 2, 1, 4, 8, 1, 10, 3, 4, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, 4, +inf, +inf, +inf, +inf, +inf, +inf, 4, 4]
FORMULA FunctionPointer-PT-c004-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-c004-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 5, 179, 6, 2, 4, 8, 1, 10, 3, 4, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
Support contains 12 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 1365/1365 transitions.
Applied a total of 0 rules in 120 ms. Remains 489 /489 variables (removed 0) and now considering 1365/1365 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 489/489 places, 1365/1365 transitions.
[2025-06-02 02:29:37] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {217=1, 365=1, 702=1, 790=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {234=1, 382=1, 719=1, 787=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 12) seen :[0, 0, 1, 0, 2, 0, 0, 0, 3, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 5, 179, 6, 2, 4, 8, 1, 10, 3, 4, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
[2025-06-02 02:29:38] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:29:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 5, 179, 6, 2, 4, 8, 1, 10, 3, 4, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
RANDOM walk for 1000000 steps (2 resets) in 5122 ms. (195 steps per ms)
BEST_FIRST walk for 12000012 steps (24 resets) in 11297 ms. (1062 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 5, 181, 6, 4, 371, 8, 1, 10, 5, 148, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
[2025-06-02 02:29:54] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:29:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:29:55] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:29:55] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2025-06-02 02:29:55] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-06-02 02:29:55] [INFO ] [Real]Added 104 Read/Feed constraints in 80 ms returned sat
[2025-06-02 02:29: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 02:29:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-02 02:29:55] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2025-06-02 02:29:56] [INFO ] [Nat]Added 104 Read/Feed constraints in 68 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:29:56] [INFO ] Deduced a trap composed of 79 places in 489 ms of which 39 ms to minimize.
[2025-06-02 02:29:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 564 ms
[2025-06-02 02:29:56] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 133 ms.
[2025-06-02 02:29:56] [INFO ] Added : 1 causal constraints over 1 iterations in 274 ms. Result :sat
Minimization took 537 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:29:57] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:29:57] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2025-06-02 02:29:58] [INFO ] [Real]Added 104 Read/Feed constraints in 71 ms returned sat
[2025-06-02 02:29: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 02:29:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:29:58] [INFO ] [Nat]Absence check using state equation in 437 ms returned sat
[2025-06-02 02:29:58] [INFO ] [Nat]Added 104 Read/Feed constraints in 95 ms returned sat
[2025-06-02 02:29:59] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 193 ms.
[2025-06-02 02:29:59] [INFO ] Added : 2 causal constraints over 1 iterations in 386 ms. Result :sat
Minimization took 565 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:30:00] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:30:00] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2025-06-02 02:30:00] [INFO ] [Real]Added 104 Read/Feed constraints in 137 ms returned sat
[2025-06-02 02:30: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 02:30:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:30:01] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2025-06-02 02:30:01] [INFO ] [Nat]Added 104 Read/Feed constraints in 104 ms returned sat
[2025-06-02 02:30:01] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 194 ms.
[2025-06-02 02:30:01] [INFO ] Added : 3 causal constraints over 1 iterations in 450 ms. Result :sat
Minimization took 572 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:30:02] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:30:03] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2025-06-02 02:30:03] [INFO ] [Real]Added 104 Read/Feed constraints in 46 ms returned sat
[2025-06-02 02:30: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 02:30:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:30:03] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2025-06-02 02:30:03] [INFO ] [Nat]Added 104 Read/Feed constraints in 72 ms returned sat
[2025-06-02 02:30:04] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 147 ms.
[2025-06-02 02:30:04] [INFO ] Added : 1 causal constraints over 1 iterations in 335 ms. Result :sat
Minimization took 545 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:30:04] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:30:05] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2025-06-02 02:30:05] [INFO ] [Real]Added 104 Read/Feed constraints in 71 ms returned sat
[2025-06-02 02:30: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 02:30:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:30:06] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2025-06-02 02:30:06] [INFO ] [Nat]Added 104 Read/Feed constraints in 130 ms returned sat
[2025-06-02 02:30:06] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 199 ms.
[2025-06-02 02:30:06] [INFO ] Added : 2 causal constraints over 1 iterations in 394 ms. Result :sat
Minimization took 548 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:30:07] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:30:08] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2025-06-02 02:30:08] [INFO ] [Real]Added 104 Read/Feed constraints in 67 ms returned sat
[2025-06-02 02:30: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 02:30:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:30:08] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2025-06-02 02:30:08] [INFO ] [Nat]Added 104 Read/Feed constraints in 61 ms returned sat
[2025-06-02 02:30:08] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 120 ms.
[2025-06-02 02:30:08] [INFO ] Added : 2 causal constraints over 1 iterations in 244 ms. Result :sat
Minimization took 407 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:30:09] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:30:09] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2025-06-02 02:30:09] [INFO ] [Real]Added 104 Read/Feed constraints in 68 ms returned sat
[2025-06-02 02:30: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 02:30:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:30:10] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2025-06-02 02:30:10] [INFO ] [Nat]Added 104 Read/Feed constraints in 85 ms returned sat
[2025-06-02 02:30:10] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 143 ms.
[2025-06-02 02:30:10] [INFO ] Added : 2 causal constraints over 1 iterations in 291 ms. Result :sat
Minimization took 509 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:30:11] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:30:12] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2025-06-02 02:30:12] [INFO ] [Real]Added 104 Read/Feed constraints in 66 ms returned sat
[2025-06-02 02:30: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 02:30:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:30:12] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2025-06-02 02:30:12] [INFO ] [Nat]Added 104 Read/Feed constraints in 71 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:30:13] [INFO ] Deduced a trap composed of 79 places in 788 ms of which 57 ms to minimize.
[2025-06-02 02:30:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 940 ms
[2025-06-02 02:30:14] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 221 ms.
[2025-06-02 02:30:14] [INFO ] Added : 2 causal constraints over 1 iterations in 429 ms. Result :sat
Minimization took 650 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:30:15] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:30:15] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2025-06-02 02:30:15] [INFO ] [Real]Added 104 Read/Feed constraints in 93 ms returned sat
[2025-06-02 02:30:15] [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 02:30:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:30:16] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2025-06-02 02:30:16] [INFO ] [Nat]Added 104 Read/Feed constraints in 118 ms returned sat
[2025-06-02 02:30:16] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 214 ms.
[2025-06-02 02:30:16] [INFO ] Added : 2 causal constraints over 1 iterations in 408 ms. Result :sat
Minimization took 528 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:30:17] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:30:17] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2025-06-02 02:30:18] [INFO ] [Real]Added 104 Read/Feed constraints in 44 ms returned sat
[2025-06-02 02:30: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 02:30:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:30:18] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2025-06-02 02:30:18] [INFO ] [Nat]Added 104 Read/Feed constraints in 62 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:30:19] [INFO ] Deduced a trap composed of 79 places in 751 ms of which 56 ms to minimize.
[2025-06-02 02:30:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 835 ms
[2025-06-02 02:30:19] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 187 ms.
[2025-06-02 02:30:19] [INFO ] Added : 2 causal constraints over 1 iterations in 362 ms. Result :sat
Minimization took 506 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:30:20] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-02 02:30:20] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2025-06-02 02:30:20] [INFO ] [Real]Added 104 Read/Feed constraints in 85 ms returned sat
[2025-06-02 02: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 02:30:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:30:21] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2025-06-02 02:30:21] [INFO ] [Nat]Added 104 Read/Feed constraints in 50 ms returned sat
[2025-06-02 02:30:21] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 128 ms.
[2025-06-02 02:30:21] [INFO ] Added : 2 causal constraints over 1 iterations in 249 ms. Result :sat
Minimization took 519 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:30:22] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:30:23] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2025-06-02 02:30:23] [INFO ] [Real]Added 104 Read/Feed constraints in 77 ms returned sat
[2025-06-02 02:30:23] [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 02:30:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:30:23] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2025-06-02 02:30:23] [INFO ] [Nat]Added 104 Read/Feed constraints in 135 ms returned sat
[2025-06-02 02:30:24] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 198 ms.
[2025-06-02 02:30:24] [INFO ] Added : 2 causal constraints over 1 iterations in 411 ms. Result :sat
Minimization took 769 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 5, 181, 6, 4, 371, 8, 1, 10, 5, 148, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 5, 181, 6, 4, 371, 8, 1, 10, 5, 148, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
Support contains 12 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 1365/1365 transitions.
Applied a total of 0 rules in 77 ms. Remains 489 /489 variables (removed 0) and now considering 1365/1365 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 489/489 places, 1365/1365 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 1365/1365 transitions.
Applied a total of 0 rules in 73 ms. Remains 489 /489 variables (removed 0) and now considering 1365/1365 (removed 0) transitions.
[2025-06-02 02:30:25] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:30:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:30:26] [INFO ] Implicit Places using invariants in 1144 ms returned []
[2025-06-02 02:30:26] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:30:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:30:27] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-06-02 02:30:29] [INFO ] Implicit Places using invariants and state equation in 3429 ms returned []
Implicit Place search using SMT with State Equation took 4576 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:30:30] [INFO ] Redundant transitions in 224 ms returned []
Running 1363 sub problems to find dead transitions.
[2025-06-02 02:30:30] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:30:30] [INFO ] Invariant cache hit.
[2025-06-02 02:30:30] [INFO ] State equation strengthened by 104 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:30:59] [INFO ] Deduced a trap composed of 131 places in 341 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 489/1288 variables, and 4 constraints, problems are : Problem set: 0 solved, 1363 unsolved in 30090 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/489 constraints, ReadFeed: 0/104 constraints, PredecessorRefiner: 1363/1363 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1363 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/1288 variables, and 4 constraints, problems are : Problem set: 0 solved, 1363 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/489 constraints, ReadFeed: 0/104 constraints, PredecessorRefiner: 0/1363 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63406ms problems are : Problem set: 0 solved, 1363 unsolved
Search for dead transitions found 0 dead transitions in 63493ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68412 ms. Remains : 489/489 places, 1365/1365 transitions.
[2025-06-02 02:31:33] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {217=1, 365=1, 702=1, 790=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 3 ms.
This minimized invariant on transitions {234=1, 382=1, 719=1, 787=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 12) seen :[0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 5, 181, 6, 4, 371, 8, 1, 10, 5, 148, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
[2025-06-02 02:31:34] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:31:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 5, 181, 6, 4, 371, 8, 1, 10, 5, 148, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
RANDOM walk for 1000000 steps (2 resets) in 4616 ms. (216 steps per ms)
BEST_FIRST walk for 12000012 steps (24 resets) in 10844 ms. (1106 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5, 258, 562, 4, 508, 309, 1, 937, 5, 148, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
[2025-06-02 02:31:50] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:31:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:31:50] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:31:50] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2025-06-02 02:31:50] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-06-02 02:31:50] [INFO ] [Real]Added 104 Read/Feed constraints in 73 ms returned sat
[2025-06-02 02:31: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 02:31:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:31:51] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2025-06-02 02:31:51] [INFO ] [Nat]Added 104 Read/Feed constraints in 101 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:31:52] [INFO ] Deduced a trap composed of 79 places in 821 ms of which 52 ms to minimize.
[2025-06-02 02:31:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 915 ms
[2025-06-02 02:31:52] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 165 ms.
[2025-06-02 02:31:52] [INFO ] Added : 1 causal constraints over 1 iterations in 316 ms. Result :sat
Minimization took 456 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:31:53] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-02 02:31:53] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2025-06-02 02:31:53] [INFO ] [Real]Added 104 Read/Feed constraints in 49 ms returned sat
[2025-06-02 02:31: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 02:31:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-02 02:31:54] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2025-06-02 02:31:54] [INFO ] [Nat]Added 104 Read/Feed constraints in 70 ms returned sat
[2025-06-02 02:31:54] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 142 ms.
[2025-06-02 02:31:54] [INFO ] Added : 2 causal constraints over 1 iterations in 280 ms. Result :sat
Minimization took 396 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:31:55] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:31:55] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2025-06-02 02:31:55] [INFO ] [Real]Added 104 Read/Feed constraints in 124 ms returned sat
[2025-06-02 02:31: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 02:31:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:31:56] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2025-06-02 02:31:56] [INFO ] [Nat]Added 104 Read/Feed constraints in 102 ms returned sat
[2025-06-02 02:31:56] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 151 ms.
[2025-06-02 02:31:56] [INFO ] Added : 3 causal constraints over 1 iterations in 323 ms. Result :sat
Minimization took 436 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:31:57] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:31:57] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2025-06-02 02:31:57] [INFO ] [Real]Added 104 Read/Feed constraints in 97 ms returned sat
[2025-06-02 02:31: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 02:31:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-02 02:31:58] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2025-06-02 02:31:58] [INFO ] [Nat]Added 104 Read/Feed constraints in 46 ms returned sat
[2025-06-02 02:31:58] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 115 ms.
[2025-06-02 02:31:58] [INFO ] Added : 1 causal constraints over 1 iterations in 236 ms. Result :sat
Minimization took 384 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:31:59] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:31:59] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2025-06-02 02:31:59] [INFO ] [Real]Added 104 Read/Feed constraints in 53 ms returned sat
[2025-06-02 02:31: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 02:31:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:32:00] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2025-06-02 02:32:00] [INFO ] [Nat]Added 104 Read/Feed constraints in 89 ms returned sat
[2025-06-02 02:32:00] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 132 ms.
[2025-06-02 02:32:00] [INFO ] Added : 2 causal constraints over 1 iterations in 271 ms. Result :sat
Minimization took 448 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:32:01] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-02 02:32:01] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2025-06-02 02:32:01] [INFO ] [Real]Added 104 Read/Feed constraints in 88 ms returned sat
[2025-06-02 02:32: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 02:32:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:32:02] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2025-06-02 02:32:02] [INFO ] [Nat]Added 104 Read/Feed constraints in 69 ms returned sat
[2025-06-02 02:32:02] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 172 ms.
[2025-06-02 02:32:02] [INFO ] Added : 2 causal constraints over 1 iterations in 342 ms. Result :sat
Minimization took 533 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:32:03] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2025-06-02 02:32:03] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2025-06-02 02:32:03] [INFO ] [Real]Added 104 Read/Feed constraints in 113 ms returned sat
[2025-06-02 02:32: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 02:32:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:32:04] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2025-06-02 02:32:04] [INFO ] [Nat]Added 104 Read/Feed constraints in 84 ms returned sat
[2025-06-02 02:32:04] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 177 ms.
[2025-06-02 02:32:05] [INFO ] Added : 2 causal constraints over 1 iterations in 355 ms. Result :sat
Minimization took 519 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:32:05] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:32:06] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2025-06-02 02:32:06] [INFO ] [Real]Added 104 Read/Feed constraints in 44 ms returned sat
[2025-06-02 02:32: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 02:32:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:32:06] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2025-06-02 02:32:06] [INFO ] [Nat]Added 104 Read/Feed constraints in 74 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:32:07] [INFO ] Deduced a trap composed of 79 places in 661 ms of which 35 ms to minimize.
[2025-06-02 02:32:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 816 ms
[2025-06-02 02:32:07] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 136 ms.
[2025-06-02 02:32:08] [INFO ] Added : 2 causal constraints over 1 iterations in 306 ms. Result :sat
Minimization took 629 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:32:08] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:32:09] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2025-06-02 02:32:09] [INFO ] [Real]Added 104 Read/Feed constraints in 88 ms returned sat
[2025-06-02 02: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 02:32:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:32:10] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2025-06-02 02:32:10] [INFO ] [Nat]Added 104 Read/Feed constraints in 123 ms returned sat
[2025-06-02 02:32:10] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 206 ms.
[2025-06-02 02:32:10] [INFO ] Added : 2 causal constraints over 1 iterations in 394 ms. Result :sat
Minimization took 613 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:32:11] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2025-06-02 02:32:11] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2025-06-02 02:32:12] [INFO ] [Real]Added 104 Read/Feed constraints in 69 ms returned sat
[2025-06-02 02:32: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 02:32:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:32:12] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2025-06-02 02:32:12] [INFO ] [Nat]Added 104 Read/Feed constraints in 93 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:32:13] [INFO ] Deduced a trap composed of 79 places in 657 ms of which 49 ms to minimize.
[2025-06-02 02:32:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 747 ms
[2025-06-02 02:32:13] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 213 ms.
[2025-06-02 02:32:13] [INFO ] Added : 2 causal constraints over 1 iterations in 392 ms. Result :sat
Minimization took 541 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:32:14] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:32:15] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2025-06-02 02:32:15] [INFO ] [Real]Added 104 Read/Feed constraints in 71 ms returned sat
[2025-06-02 02:32:15] [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 02:32:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:32:15] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2025-06-02 02:32:15] [INFO ] [Nat]Added 104 Read/Feed constraints in 78 ms returned sat
[2025-06-02 02:32:16] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 226 ms.
[2025-06-02 02:32:16] [INFO ] Added : 2 causal constraints over 1 iterations in 418 ms. Result :sat
Minimization took 525 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:32:17] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:32:17] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2025-06-02 02:32:17] [INFO ] [Real]Added 104 Read/Feed constraints in 69 ms returned sat
[2025-06-02 02:32: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 02:32:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:32:18] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2025-06-02 02:32:18] [INFO ] [Nat]Added 104 Read/Feed constraints in 110 ms returned sat
[2025-06-02 02:32:18] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 212 ms.
[2025-06-02 02:32:18] [INFO ] Added : 2 causal constraints over 1 iterations in 410 ms. Result :sat
Minimization took 775 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5, 258, 562, 4, 508, 309, 1, 937, 5, 148, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5, 258, 562, 4, 508, 309, 1, 937, 5, 148, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
Support contains 12 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 1365/1365 transitions.
Applied a total of 0 rules in 119 ms. Remains 489 /489 variables (removed 0) and now considering 1365/1365 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 489/489 places, 1365/1365 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 1365/1365 transitions.
Applied a total of 0 rules in 65 ms. Remains 489 /489 variables (removed 0) and now considering 1365/1365 (removed 0) transitions.
[2025-06-02 02:32:19] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:32:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:32:20] [INFO ] Implicit Places using invariants in 764 ms returned []
[2025-06-02 02:32:20] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:32:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:32:21] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-06-02 02:32:23] [INFO ] Implicit Places using invariants and state equation in 2909 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 02:32:23] [INFO ] Redundant transitions in 98 ms returned []
Running 1363 sub problems to find dead transitions.
[2025-06-02 02:32:23] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:32:23] [INFO ] Invariant cache hit.
[2025-06-02 02:32:23] [INFO ] State equation strengthened by 104 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:32:50] [INFO ] Deduced a trap composed of 131 places in 511 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 489/1288 variables, and 4 constraints, problems are : Problem set: 0 solved, 1363 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/489 constraints, ReadFeed: 0/104 constraints, PredecessorRefiner: 1363/1363 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1363 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/1288 variables, and 4 constraints, problems are : Problem set: 0 solved, 1363 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/489 constraints, ReadFeed: 0/104 constraints, PredecessorRefiner: 0/1363 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62342ms problems are : Problem set: 0 solved, 1363 unsolved
Search for dead transitions found 0 dead transitions in 62348ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66229 ms. Remains : 489/489 places, 1365/1365 transitions.
[2025-06-02 02:33:26] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {217=1, 365=1, 702=1, 790=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {234=1, 382=1, 719=1, 787=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 12) seen :[0, 0, 3, 0, 2, 0, 0, 0, 0, 2, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[5, 5, 258, 562, 4, 508, 309, 1, 937, 5, 148, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
[2025-06-02 02:33:27] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:33:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 5, 258, 562, 4, 508, 309, 1, 937, 5, 148, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
RANDOM walk for 1000000 steps (2 resets) in 4569 ms. (218 steps per ms)
FORMULA FunctionPointer-PT-c004-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 11000011 steps (22 resets) in 9776 ms. (1125 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9, 5, 258, 562, 4, 508, 309, 3, 937, 5, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 02:33:41] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:33:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:33:41] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:33:41] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2025-06-02 02:33:42] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-06-02 02:33:42] [INFO ] [Real]Added 104 Read/Feed constraints in 68 ms returned sat
[2025-06-02 02:33:42] [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 02:33:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:33:42] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2025-06-02 02:33:42] [INFO ] [Nat]Added 104 Read/Feed constraints in 80 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:33:43] [INFO ] Deduced a trap composed of 79 places in 835 ms of which 89 ms to minimize.
[2025-06-02 02:33:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 991 ms
[2025-06-02 02:33:43] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 194 ms.
[2025-06-02 02:33:44] [INFO ] Added : 1 causal constraints over 1 iterations in 321 ms. Result :sat
Minimization took 412 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:33:44] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:33:45] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2025-06-02 02:33:45] [INFO ] [Real]Added 104 Read/Feed constraints in 67 ms returned sat
[2025-06-02 02:33: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 02:33:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:33:45] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2025-06-02 02:33:45] [INFO ] [Nat]Added 104 Read/Feed constraints in 69 ms returned sat
[2025-06-02 02:33:46] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 182 ms.
[2025-06-02 02:33:46] [INFO ] Added : 2 causal constraints over 1 iterations in 335 ms. Result :sat
Minimization took 467 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:33:46] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:33:47] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2025-06-02 02:33:47] [INFO ] [Real]Added 104 Read/Feed constraints in 156 ms returned sat
[2025-06-02 02:33: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 02:33:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:33:48] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2025-06-02 02:33:48] [INFO ] [Nat]Added 104 Read/Feed constraints in 132 ms returned sat
[2025-06-02 02:33:48] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 203 ms.
[2025-06-02 02:33:48] [INFO ] Added : 3 causal constraints over 1 iterations in 433 ms. Result :sat
Minimization took 575 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:33:49] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:33:50] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2025-06-02 02:33:50] [INFO ] [Real]Added 104 Read/Feed constraints in 158 ms returned sat
[2025-06-02 02:33: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 02:33:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:33:51] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2025-06-02 02:33:51] [INFO ] [Nat]Added 104 Read/Feed constraints in 66 ms returned sat
[2025-06-02 02:33:51] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 188 ms.
[2025-06-02 02:33:51] [INFO ] Added : 1 causal constraints over 1 iterations in 347 ms. Result :sat
Minimization took 607 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:33:52] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:33:52] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2025-06-02 02:33:52] [INFO ] [Real]Added 104 Read/Feed constraints in 73 ms returned sat
[2025-06-02 02:33: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 02:33:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:33:53] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2025-06-02 02:33:53] [INFO ] [Nat]Added 104 Read/Feed constraints in 116 ms returned sat
[2025-06-02 02:33:53] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 190 ms.
[2025-06-02 02:33:54] [INFO ] Added : 2 causal constraints over 1 iterations in 380 ms. Result :sat
Minimization took 577 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:33:54] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:33:55] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2025-06-02 02:33:55] [INFO ] [Real]Added 104 Read/Feed constraints in 108 ms returned sat
[2025-06-02 02: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 02:33:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:33:56] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2025-06-02 02:33:56] [INFO ] [Nat]Added 104 Read/Feed constraints in 83 ms returned sat
[2025-06-02 02:33:56] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 205 ms.
[2025-06-02 02:33:56] [INFO ] Added : 2 causal constraints over 1 iterations in 403 ms. Result :sat
Minimization took 574 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:33:57] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:33:58] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2025-06-02 02:33:58] [INFO ] [Real]Added 104 Read/Feed constraints in 107 ms returned sat
[2025-06-02 02:33: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 02:33:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:33:58] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2025-06-02 02:33:58] [INFO ] [Nat]Added 104 Read/Feed constraints in 92 ms returned sat
[2025-06-02 02:33:59] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 194 ms.
[2025-06-02 02:33:59] [INFO ] Added : 2 causal constraints over 1 iterations in 388 ms. Result :sat
Minimization took 593 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:34:00] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:34:00] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2025-06-02 02:34:00] [INFO ] [Real]Added 104 Read/Feed constraints in 42 ms returned sat
[2025-06-02 02:34: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 02:34:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:34:01] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2025-06-02 02:34:01] [INFO ] [Nat]Added 104 Read/Feed constraints in 88 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:34:01] [INFO ] Deduced a trap composed of 79 places in 791 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:34:02] [INFO ] Deduced a trap composed of 79 places in 742 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:34:03] [INFO ] Deduced a trap composed of 131 places in 632 ms of which 19 ms to minimize.
[2025-06-02 02:34:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2336 ms
[2025-06-02 02:34:03] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 211 ms.
[2025-06-02 02:34:03] [INFO ] Added : 2 causal constraints over 1 iterations in 404 ms. Result :sat
Minimization took 652 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:34:04] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:34:05] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2025-06-02 02:34:05] [INFO ] [Real]Added 104 Read/Feed constraints in 90 ms returned sat
[2025-06-02 02: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 02:34:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:34:05] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2025-06-02 02:34:06] [INFO ] [Nat]Added 104 Read/Feed constraints in 114 ms returned sat
[2025-06-02 02:34:06] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 186 ms.
[2025-06-02 02:34:06] [INFO ] Added : 2 causal constraints over 1 iterations in 362 ms. Result :sat
Minimization took 567 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:34:07] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:34:07] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2025-06-02 02:34:07] [INFO ] [Real]Added 104 Read/Feed constraints in 74 ms returned sat
[2025-06-02 02:34: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 02:34:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:34:08] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2025-06-02 02:34:08] [INFO ] [Nat]Added 104 Read/Feed constraints in 70 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:34:09] [INFO ] Deduced a trap composed of 79 places in 719 ms of which 36 ms to minimize.
[2025-06-02 02:34:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 795 ms
[2025-06-02 02:34:09] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 190 ms.
[2025-06-02 02:34:09] [INFO ] Added : 2 causal constraints over 1 iterations in 341 ms. Result :sat
Minimization took 378 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:34:09] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:34:10] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2025-06-02 02:34:10] [INFO ] [Real]Added 104 Read/Feed constraints in 57 ms returned sat
[2025-06-02 02:34:10] [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 02:34:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:34:10] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2025-06-02 02:34:11] [INFO ] [Nat]Added 104 Read/Feed constraints in 56 ms returned sat
[2025-06-02 02:34:11] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 185 ms.
[2025-06-02 02:34:11] [INFO ] Added : 2 causal constraints over 1 iterations in 335 ms. Result :sat
Minimization took 433 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9, 5, 258, 562, 4, 508, 309, 3, 937, 5, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9, 5, 258, 562, 4, 508, 309, 3, 937, 5, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 11 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 1365/1365 transitions.
Applied a total of 0 rules in 112 ms. Remains 489 /489 variables (removed 0) and now considering 1365/1365 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 489/489 places, 1365/1365 transitions.
[2025-06-02 02:34:12] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {217=1, 365=1, 702=1, 790=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {234=1, 382=1, 719=1, 787=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 11) seen :[0, 3, 4, 0, 0, 0, 6, 0, 0, 2, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[9, 5, 258, 562, 4, 508, 309, 3, 937, 5, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 02:34:12] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:34:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[9, 5, 258, 562, 4, 508, 309, 3, 937, 5, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 4695 ms. (212 steps per ms)
BEST_FIRST walk for 11000010 steps (22 resets) in 9823 ms. (1119 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9, 5, 258, 562, 4, 508, 309, 3, 937, 446, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 02:34:27] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:34:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:34:27] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:34:27] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2025-06-02 02:34:27] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-06-02 02:34:27] [INFO ] [Real]Added 104 Read/Feed constraints in 47 ms returned sat
[2025-06-02 02:34:27] [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 02:34:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:34:28] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2025-06-02 02:34:28] [INFO ] [Nat]Added 104 Read/Feed constraints in 53 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:34:29] [INFO ] Deduced a trap composed of 79 places in 608 ms of which 67 ms to minimize.
[2025-06-02 02:34:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 725 ms
[2025-06-02 02:34:29] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 148 ms.
[2025-06-02 02:34:29] [INFO ] Added : 1 causal constraints over 1 iterations in 284 ms. Result :sat
Minimization took 539 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:34:30] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:34:30] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2025-06-02 02:34:30] [INFO ] [Real]Added 104 Read/Feed constraints in 39 ms returned sat
[2025-06-02 02:34: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 02:34:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:34:31] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2025-06-02 02:34:31] [INFO ] [Nat]Added 104 Read/Feed constraints in 101 ms returned sat
[2025-06-02 02:34:31] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 179 ms.
[2025-06-02 02:34:31] [INFO ] Added : 2 causal constraints over 1 iterations in 372 ms. Result :sat
Minimization took 591 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:34:32] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2025-06-02 02:34:32] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2025-06-02 02:34:33] [INFO ] [Real]Added 104 Read/Feed constraints in 166 ms returned sat
[2025-06-02 02:34: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 02:34:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:34:33] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2025-06-02 02:34:33] [INFO ] [Nat]Added 104 Read/Feed constraints in 82 ms returned sat
[2025-06-02 02:34:33] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 118 ms.
[2025-06-02 02:34:34] [INFO ] Added : 3 causal constraints over 1 iterations in 260 ms. Result :sat
Minimization took 402 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:34:34] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:34:34] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2025-06-02 02:34:35] [INFO ] [Real]Added 104 Read/Feed constraints in 83 ms returned sat
[2025-06-02 02:34:35] [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 02:34:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:34:35] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2025-06-02 02:34:35] [INFO ] [Nat]Added 104 Read/Feed constraints in 84 ms returned sat
[2025-06-02 02:34:35] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 200 ms.
[2025-06-02 02:34:36] [INFO ] Added : 1 causal constraints over 1 iterations in 421 ms. Result :sat
Minimization took 542 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:34:36] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:34:37] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2025-06-02 02:34:37] [INFO ] [Real]Added 104 Read/Feed constraints in 72 ms returned sat
[2025-06-02 02:34: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 02:34:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:34:38] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2025-06-02 02:34:38] [INFO ] [Nat]Added 104 Read/Feed constraints in 123 ms returned sat
[2025-06-02 02:34:38] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 198 ms.
[2025-06-02 02:34:38] [INFO ] Added : 2 causal constraints over 1 iterations in 395 ms. Result :sat
Minimization took 548 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:34:39] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:34:39] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2025-06-02 02:34:40] [INFO ] [Real]Added 104 Read/Feed constraints in 94 ms returned sat
[2025-06-02 02:34:40] [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 02:34:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:34:40] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2025-06-02 02:34:40] [INFO ] [Nat]Added 104 Read/Feed constraints in 71 ms returned sat
[2025-06-02 02:34:40] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 169 ms.
[2025-06-02 02:34:41] [INFO ] Added : 2 causal constraints over 1 iterations in 353 ms. Result :sat
Minimization took 547 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:34:41] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:34:42] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2025-06-02 02:34:42] [INFO ] [Real]Added 104 Read/Feed constraints in 113 ms returned sat
[2025-06-02 02:34:42] [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 02:34:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:34:43] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2025-06-02 02:34:43] [INFO ] [Nat]Added 104 Read/Feed constraints in 98 ms returned sat
[2025-06-02 02:34:43] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 201 ms.
[2025-06-02 02:34:43] [INFO ] Added : 2 causal constraints over 1 iterations in 397 ms. Result :sat
Minimization took 556 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:34:44] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:34:45] [INFO ] [Real]Absence check using state equation in 767 ms returned sat
[2025-06-02 02:34:45] [INFO ] [Real]Added 104 Read/Feed constraints in 61 ms returned sat
[2025-06-02 02:34: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 02:34:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:34:45] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2025-06-02 02:34:46] [INFO ] [Nat]Added 104 Read/Feed constraints in 123 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:34:46] [INFO ] Deduced a trap composed of 79 places in 740 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:34:47] [INFO ] Deduced a trap composed of 79 places in 709 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:34:48] [INFO ] Deduced a trap composed of 131 places in 396 ms of which 15 ms to minimize.
[2025-06-02 02:34:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2055 ms
[2025-06-02 02:34:48] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 135 ms.
[2025-06-02 02:34:48] [INFO ] Added : 2 causal constraints over 1 iterations in 270 ms. Result :sat
Minimization took 605 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:34:49] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:34:49] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2025-06-02 02:34:49] [INFO ] [Real]Added 104 Read/Feed constraints in 68 ms returned sat
[2025-06-02 02:34: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 02:34:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:34:50] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2025-06-02 02:34:50] [INFO ] [Nat]Added 104 Read/Feed constraints in 83 ms returned sat
[2025-06-02 02:34:50] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 155 ms.
[2025-06-02 02:34:50] [INFO ] Added : 2 causal constraints over 1 iterations in 291 ms. Result :sat
Minimization took 445 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:34:51] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:34:51] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2025-06-02 02:34:51] [INFO ] [Real]Added 104 Read/Feed constraints in 64 ms returned sat
[2025-06-02 02:34: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 02:34:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:34:52] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2025-06-02 02:34:52] [INFO ] [Nat]Added 104 Read/Feed constraints in 105 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:34:53] [INFO ] Deduced a trap composed of 79 places in 817 ms of which 95 ms to minimize.
[2025-06-02 02:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 935 ms
[2025-06-02 02:34:53] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 198 ms.
[2025-06-02 02:34:53] [INFO ] Added : 2 causal constraints over 1 iterations in 394 ms. Result :sat
Minimization took 582 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:34:54] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:34:54] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2025-06-02 02:34:55] [INFO ] [Real]Added 104 Read/Feed constraints in 76 ms returned sat
[2025-06-02 02:34: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 02:34:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:34:55] [INFO ] [Nat]Absence check using state equation in 471 ms returned sat
[2025-06-02 02:34:55] [INFO ] [Nat]Added 104 Read/Feed constraints in 81 ms returned sat
[2025-06-02 02:34:56] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 198 ms.
[2025-06-02 02:34:56] [INFO ] Added : 2 causal constraints over 1 iterations in 388 ms. Result :sat
Minimization took 558 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9, 5, 258, 562, 4, 508, 309, 3, 937, 446, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9, 5, 258, 562, 4, 508, 309, 3, 937, 446, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 11 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 1365/1365 transitions.
Applied a total of 0 rules in 111 ms. Remains 489 /489 variables (removed 0) and now considering 1365/1365 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 489/489 places, 1365/1365 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 1365/1365 transitions.
Applied a total of 0 rules in 109 ms. Remains 489 /489 variables (removed 0) and now considering 1365/1365 (removed 0) transitions.
[2025-06-02 02:34:57] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:34:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:34:58] [INFO ] Implicit Places using invariants in 1064 ms returned []
[2025-06-02 02:34:58] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:34:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:34:58] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-06-02 02:35:00] [INFO ] Implicit Places using invariants and state equation in 2519 ms returned []
Implicit Place search using SMT with State Equation took 3585 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:35:00] [INFO ] Redundant transitions in 51 ms returned []
Running 1363 sub problems to find dead transitions.
[2025-06-02 02:35:00] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:35:00] [INFO ] Invariant cache hit.
[2025-06-02 02:35:00] [INFO ] State equation strengthened by 104 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:35:27] [INFO ] Deduced a trap composed of 131 places in 504 ms of which 16 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 489/1288 variables, and 4 constraints, problems are : Problem set: 0 solved, 1363 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/489 constraints, ReadFeed: 0/104 constraints, PredecessorRefiner: 1363/1363 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1363 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/1288 variables, and 4 constraints, problems are : Problem set: 0 solved, 1363 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/489 constraints, ReadFeed: 0/104 constraints, PredecessorRefiner: 0/1363 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62195ms problems are : Problem set: 0 solved, 1363 unsolved
Search for dead transitions found 0 dead transitions in 62199ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65969 ms. Remains : 489/489 places, 1365/1365 transitions.
[2025-06-02 02:36:02] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {217=1, 365=1, 702=1, 790=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {234=1, 382=1, 719=1, 787=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :[0, 0, 5, 4, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[9, 5, 258, 562, 4, 508, 309, 3, 937, 446, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 02:36:04] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:36:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[9, 5, 258, 562, 4, 508, 309, 3, 937, 446, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 4667 ms. (214 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 9847 ms. (1116 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[642, 5, 258, 562, 4, 508, 309, 3, 937, 446, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 02:36:18] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:36:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:36:18] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:36:18] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2025-06-02 02:36:18] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-06-02 02:36:19] [INFO ] [Real]Added 104 Read/Feed constraints in 95 ms returned sat
[2025-06-02 02:36: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 02:36:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:36:19] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2025-06-02 02:36:19] [INFO ] [Nat]Added 104 Read/Feed constraints in 83 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:36:20] [INFO ] Deduced a trap composed of 79 places in 787 ms of which 96 ms to minimize.
[2025-06-02 02:36:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 938 ms
[2025-06-02 02:36:20] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 180 ms.
[2025-06-02 02:36:20] [INFO ] Added : 1 causal constraints over 1 iterations in 343 ms. Result :sat
Minimization took 539 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:36:21] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:36:22] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2025-06-02 02:36:22] [INFO ] [Real]Added 104 Read/Feed constraints in 61 ms returned sat
[2025-06-02 02:36: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 02:36:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:36:22] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2025-06-02 02:36:22] [INFO ] [Nat]Added 104 Read/Feed constraints in 82 ms returned sat
[2025-06-02 02:36:23] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 125 ms.
[2025-06-02 02:36:23] [INFO ] Added : 2 causal constraints over 1 iterations in 231 ms. Result :sat
Minimization took 363 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:36:23] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:36:24] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2025-06-02 02:36:24] [INFO ] [Real]Added 104 Read/Feed constraints in 165 ms returned sat
[2025-06-02 02:36: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 02:36:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:36:25] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2025-06-02 02:36:25] [INFO ] [Nat]Added 104 Read/Feed constraints in 123 ms returned sat
[2025-06-02 02:36:25] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 181 ms.
[2025-06-02 02:36:25] [INFO ] Added : 3 causal constraints over 1 iterations in 397 ms. Result :sat
Minimization took 519 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:36:26] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:36:26] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2025-06-02 02:36:26] [INFO ] [Real]Added 104 Read/Feed constraints in 147 ms returned sat
[2025-06-02 02:36:27] [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 02:36:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:36:27] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2025-06-02 02:36:27] [INFO ] [Nat]Added 104 Read/Feed constraints in 72 ms returned sat
[2025-06-02 02:36:27] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 178 ms.
[2025-06-02 02:36:28] [INFO ] Added : 1 causal constraints over 1 iterations in 358 ms. Result :sat
Minimization took 550 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:36:28] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:36:29] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2025-06-02 02:36:29] [INFO ] [Real]Added 104 Read/Feed constraints in 80 ms returned sat
[2025-06-02 02:36:29] [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 02:36:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:36:30] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2025-06-02 02:36:30] [INFO ] [Nat]Added 104 Read/Feed constraints in 124 ms returned sat
[2025-06-02 02:36:30] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 212 ms.
[2025-06-02 02:36:30] [INFO ] Added : 2 causal constraints over 1 iterations in 395 ms. Result :sat
Minimization took 537 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:36:31] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:36:31] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2025-06-02 02:36:32] [INFO ] [Real]Added 104 Read/Feed constraints in 107 ms returned sat
[2025-06-02 02:36: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 02:36:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:36:32] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2025-06-02 02:36:32] [INFO ] [Nat]Added 104 Read/Feed constraints in 97 ms returned sat
[2025-06-02 02:36:33] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 201 ms.
[2025-06-02 02:36:33] [INFO ] Added : 2 causal constraints over 1 iterations in 381 ms. Result :sat
Minimization took 527 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:36:33] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:36:34] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2025-06-02 02:36:34] [INFO ] [Real]Added 104 Read/Feed constraints in 112 ms returned sat
[2025-06-02 02:36:34] [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 02:36:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:36:35] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2025-06-02 02:36:35] [INFO ] [Nat]Added 104 Read/Feed constraints in 96 ms returned sat
[2025-06-02 02:36:35] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 199 ms.
[2025-06-02 02:36:35] [INFO ] Added : 2 causal constraints over 1 iterations in 378 ms. Result :sat
Minimization took 531 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:36:36] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:36:37] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2025-06-02 02:36:37] [INFO ] [Real]Added 104 Read/Feed constraints in 59 ms returned sat
[2025-06-02 02:36: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 02:36:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:36:37] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2025-06-02 02:36:37] [INFO ] [Nat]Added 104 Read/Feed constraints in 131 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:36:38] [INFO ] Deduced a trap composed of 79 places in 769 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:36:39] [INFO ] Deduced a trap composed of 79 places in 698 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:36:40] [INFO ] Deduced a trap composed of 131 places in 537 ms of which 12 ms to minimize.
[2025-06-02 02:36:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2166 ms
[2025-06-02 02:36:40] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 182 ms.
[2025-06-02 02:36:40] [INFO ] Added : 2 causal constraints over 1 iterations in 325 ms. Result :sat
Minimization took 568 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:36:41] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:36:41] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2025-06-02 02:36:41] [INFO ] [Real]Added 104 Read/Feed constraints in 94 ms returned sat
[2025-06-02 02:36: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 02:36:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:36:42] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2025-06-02 02:36:42] [INFO ] [Nat]Added 104 Read/Feed constraints in 90 ms returned sat
[2025-06-02 02:36:42] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 116 ms.
[2025-06-02 02:36:42] [INFO ] Added : 2 causal constraints over 1 iterations in 221 ms. Result :sat
Minimization took 371 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:36:43] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:36:43] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2025-06-02 02:36:43] [INFO ] [Real]Added 104 Read/Feed constraints in 88 ms returned sat
[2025-06-02 02:36: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 02:36:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:36:44] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2025-06-02 02:36:44] [INFO ] [Nat]Added 104 Read/Feed constraints in 62 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:36:45] [INFO ] Deduced a trap composed of 79 places in 791 ms of which 103 ms to minimize.
[2025-06-02 02:36:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 870 ms
[2025-06-02 02:36:45] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 196 ms.
[2025-06-02 02:36:45] [INFO ] Added : 2 causal constraints over 1 iterations in 378 ms. Result :sat
Minimization took 531 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:36:46] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:36:47] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2025-06-02 02:36:47] [INFO ] [Real]Added 104 Read/Feed constraints in 83 ms returned sat
[2025-06-02 02:36: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 02:36:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:36:47] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2025-06-02 02:36:47] [INFO ] [Nat]Added 104 Read/Feed constraints in 63 ms returned sat
[2025-06-02 02:36:48] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 186 ms.
[2025-06-02 02:36:48] [INFO ] Added : 2 causal constraints over 1 iterations in 333 ms. Result :sat
Minimization took 530 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[642, 5, 258, 562, 4, 508, 309, 3, 937, 446, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[642, 5, 258, 562, 4, 508, 309, 3, 937, 446, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 11 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 1365/1365 transitions.
Applied a total of 0 rules in 117 ms. Remains 489 /489 variables (removed 0) and now considering 1365/1365 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 489/489 places, 1365/1365 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 1365/1365 transitions.
Applied a total of 0 rules in 123 ms. Remains 489 /489 variables (removed 0) and now considering 1365/1365 (removed 0) transitions.
[2025-06-02 02:36:49] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:36:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:36:50] [INFO ] Implicit Places using invariants in 1069 ms returned []
[2025-06-02 02:36:50] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:36:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:36:50] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-06-02 02:36:53] [INFO ] Implicit Places using invariants and state equation in 3250 ms returned []
Implicit Place search using SMT with State Equation took 4321 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:36:53] [INFO ] Redundant transitions in 40 ms returned []
Running 1363 sub problems to find dead transitions.
[2025-06-02 02:36:53] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:36:53] [INFO ] Invariant cache hit.
[2025-06-02 02:36:53] [INFO ] State equation strengthened by 104 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:37:20] [INFO ] Deduced a trap composed of 131 places in 446 ms of which 14 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 489/1288 variables, and 4 constraints, problems are : Problem set: 0 solved, 1363 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/489 constraints, ReadFeed: 0/104 constraints, PredecessorRefiner: 1363/1363 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1363 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 1)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 489/1288 variables, and 4 constraints, problems are : Problem set: 0 solved, 1363 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/489 constraints, ReadFeed: 0/104 constraints, PredecessorRefiner: 0/1363 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62443ms problems are : Problem set: 0 solved, 1363 unsolved
Search for dead transitions found 0 dead transitions in 62448ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66943 ms. Remains : 489/489 places, 1365/1365 transitions.
[2025-06-02 02:37:55] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {217=1, 365=1, 702=1, 790=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {234=1, 382=1, 719=1, 787=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 11) seen :[0, 0, 3, 0, 0, 0, 0, 0, 2147483647, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[642, 5, 258, 562, 4, 508, 309, 3, +inf, 446, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 02:37:56] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:37:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[642, 5, 258, 562, 4, 508, 309, 3, +inf, 446, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000003 steps (2 resets) in 5503 ms. (181 steps per ms)
FORMULA FunctionPointer-PT-c004-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 10000009 steps (20 resets) in 9142 ms. (1093 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[642, 5, 258, 562, 4, 508, 309, 3, 446, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 02:38:11] [INFO ] Flow matrix only has 799 transitions (discarded 566 similar events)
[2025-06-02 02:38:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:38:11] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 02:38:11] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2025-06-02 02:38:11] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-06-02 02:38:12] [INFO ] [Real]Added 104 Read/Feed constraints in 94 ms returned sat
[2025-06-02 02:38: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 02:38:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:38:12] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2025-06-02 02:38:12] [INFO ] [Nat]Added 104 Read/Feed constraints in 62 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:38:13] [INFO ] Deduced a trap composed of 79 places in 607 ms of which 70 ms to minimize.
[2025-06-02 02:38:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 725 ms
[2025-06-02 02:38:13] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 143 ms.
[2025-06-02 02:38:13] [INFO ] Added : 1 causal constraints over 1 iterations in 289 ms. Result :sat
Minimization took 468 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:38:14] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-02 02:38:14] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2025-06-02 02:38:14] [INFO ] [Real]Added 104 Read/Feed constraints in 65 ms returned sat
[2025-06-02 02:38: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 02:38:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:38:15] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2025-06-02 02:38:15] [INFO ] [Nat]Added 104 Read/Feed constraints in 96 ms returned sat
[2025-06-02 02:38:15] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 195 ms.
[2025-06-02 02:38:15] [INFO ] Added : 2 causal constraints over 1 iterations in 381 ms. Result :sat
Minimization took 549 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:38:16] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:38:17] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2025-06-02 02:38:17] [INFO ] [Real]Added 104 Read/Feed constraints in 130 ms returned sat
[2025-06-02 02:38: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 02:38:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-02 02:38:17] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2025-06-02 02:38:17] [INFO ] [Nat]Added 104 Read/Feed constraints in 113 ms returned sat
[2025-06-02 02:38:18] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 186 ms.
[2025-06-02 02:38:18] [INFO ] Added : 3 causal constraints over 1 iterations in 368 ms. Result :sat
Minimization took 535 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:38:19] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:38:19] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2025-06-02 02:38:19] [INFO ] [Real]Added 104 Read/Feed constraints in 134 ms returned sat
[2025-06-02 02:38: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 02:38:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:38:20] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2025-06-02 02:38:20] [INFO ] [Nat]Added 104 Read/Feed constraints in 70 ms returned sat
[2025-06-02 02:38:20] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 214 ms.
[2025-06-02 02:38:20] [INFO ] Added : 1 causal constraints over 1 iterations in 392 ms. Result :sat
Minimization took 539 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:38:21] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:38:21] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2025-06-02 02:38:21] [INFO ] [Real]Added 104 Read/Feed constraints in 41 ms returned sat
[2025-06-02 02:38:21] [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 02:38:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:38:22] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2025-06-02 02:38:22] [INFO ] [Nat]Added 104 Read/Feed constraints in 78 ms returned sat
[2025-06-02 02:38:22] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 180 ms.
[2025-06-02 02:38:22] [INFO ] Added : 2 causal constraints over 1 iterations in 348 ms. Result :sat
Minimization took 528 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:38:23] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:38:23] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2025-06-02 02:38:24] [INFO ] [Real]Added 104 Read/Feed constraints in 63 ms returned sat
[2025-06-02 02:38: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 02:38:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:38:24] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2025-06-02 02:38:24] [INFO ] [Nat]Added 104 Read/Feed constraints in 50 ms returned sat
[2025-06-02 02:38:24] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 127 ms.
[2025-06-02 02:38:24] [INFO ] Added : 2 causal constraints over 1 iterations in 235 ms. Result :sat
Minimization took 393 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:38:25] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-02 02:38:25] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2025-06-02 02:38:25] [INFO ] [Real]Added 104 Read/Feed constraints in 90 ms returned sat
[2025-06-02 02:38:25] [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 02:38:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-02 02:38:26] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2025-06-02 02:38:26] [INFO ] [Nat]Added 104 Read/Feed constraints in 71 ms returned sat
[2025-06-02 02:38:26] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 142 ms.
[2025-06-02 02:38:26] [INFO ] Added : 2 causal constraints over 1 iterations in 272 ms. Result :sat
Minimization took 451 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:38:27] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:38:27] [INFO ] [Real]Absence check using state equation in 430 ms returned sat
[2025-06-02 02:38:27] [INFO ] [Real]Added 104 Read/Feed constraints in 67 ms returned sat
[2025-06-02 02:38: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 02:38:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:38:28] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2025-06-02 02:38:28] [INFO ] [Nat]Added 104 Read/Feed constraints in 126 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:38:29] [INFO ] Deduced a trap composed of 79 places in 728 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:38:30] [INFO ] Deduced a trap composed of 79 places in 644 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:38:30] [INFO ] Deduced a trap composed of 131 places in 577 ms of which 18 ms to minimize.
[2025-06-02 02:38:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2136 ms
[2025-06-02 02:38:31] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 195 ms.
[2025-06-02 02:38:31] [INFO ] Added : 2 causal constraints over 1 iterations in 379 ms. Result :sat
Minimization took 613 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:38:32] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:38:32] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2025-06-02 02:38:32] [INFO ] [Real]Added 104 Read/Feed constraints in 51 ms returned sat
[2025-06-02 02:38: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 02:38:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 02:38:33] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2025-06-02 02:38:33] [INFO ] [Nat]Added 104 Read/Feed constraints in 72 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:38:33] [INFO ] Deduced a trap composed of 79 places in 624 ms of which 76 ms to minimize.
[2025-06-02 02:38:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 703 ms
[2025-06-02 02:38:33] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 158 ms.
[2025-06-02 02:38:34] [INFO ] Added : 2 causal constraints over 1 iterations in 327 ms. Result :sat
Minimization took 568 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:38:34] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2025-06-02 02:38:35] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2025-06-02 02:38:35] [INFO ] [Real]Added 104 Read/Feed constraints in 83 ms returned sat
[2025-06-02 02:38:35] [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 02:38:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:38:36] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2025-06-02 02:38:36] [INFO ] [Nat]Added 104 Read/Feed constraints in 70 ms returned sat
[2025-06-02 02:38:36] [INFO ] Computed and/alt/rep : 97/102/90 causal constraints (skipped 707 transitions) in 235 ms.
[2025-06-02 02:38:36] [INFO ] Added : 2 causal constraints over 1 iterations in 415 ms. Result :sat
Minimization took 557 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[642, 5, 258, 562, 4, 508, 309, 3, 446, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[642, 5, 258, 562, 4, 508, 309, 3, 446, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 10 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 1365/1365 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 488 transition count 1363
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 488 transition count 1363
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 487 transition count 1361
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 487 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 486 transition count 1359
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 486 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 485 transition count 1357
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 485 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 484 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 484 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 483 transition count 1353
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 483 transition count 1353
Applied a total of 12 rules in 257 ms. Remains 483 /489 variables (removed 6) and now considering 1353/1365 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 483/489 places, 1353/1365 transitions.
[2025-06-02 02:38:37] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {247=1, 391=1, 599=1, 773=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {239=1, 383=1, 591=1, 775=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 10) seen :[2, 0, 6, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[642, 5, 258, 562, 4, 508, 309, 3, 446, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 02:38:38] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
// Phase 1: matrix 789 rows 483 cols
[2025-06-02 02:38:38] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[642, 5, 258, 562, 4, 508, 309, 3, 446, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 4371 ms. (228 steps per ms)
BEST_FIRST walk for 10000010 steps (20 resets) in 8661 ms. (1154 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[642, 185, 258, 562, 4, 508, 351, 3, 446, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 02:38:51] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
[2025-06-02 02:38:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:38:51] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:38:51] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2025-06-02 02:38:51] [INFO ] State equation strengthened by 101 read => feed constraints.
[2025-06-02 02:38:51] [INFO ] [Real]Added 101 Read/Feed constraints in 72 ms returned sat
[2025-06-02 02:38: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 02:38:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 19 ms returned sat
[2025-06-02 02:38:52] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2025-06-02 02:38:52] [INFO ] [Nat]Added 101 Read/Feed constraints in 87 ms returned sat
[2025-06-02 02:38:52] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 151 ms.
[2025-06-02 02:38:52] [INFO ] Added : 1 causal constraints over 1 iterations in 291 ms. Result :sat
Minimization took 433 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:38:53] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-02 02:38:53] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2025-06-02 02:38:53] [INFO ] [Real]Added 101 Read/Feed constraints in 70 ms returned sat
[2025-06-02 02:38: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 02:38:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:38:54] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2025-06-02 02:38:54] [INFO ] [Nat]Added 101 Read/Feed constraints in 74 ms returned sat
[2025-06-02 02:38:54] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 153 ms.
[2025-06-02 02:38:54] [INFO ] Added : 2 causal constraints over 1 iterations in 287 ms. Result :sat
Minimization took 529 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:38:55] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:38:56] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2025-06-02 02:38:56] [INFO ] [Real]Added 101 Read/Feed constraints in 90 ms returned sat
[2025-06-02 02:38: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 02:38:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:38:56] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2025-06-02 02:38:56] [INFO ] [Nat]Added 101 Read/Feed constraints in 78 ms returned sat
[2025-06-02 02:38:57] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 182 ms.
[2025-06-02 02:38:57] [INFO ] Added : 3 causal constraints over 1 iterations in 337 ms. Result :sat
Minimization took 501 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:38:57] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:38:58] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2025-06-02 02:38:58] [INFO ] [Real]Added 101 Read/Feed constraints in 65 ms returned sat
[2025-06-02 02:38: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 02:38:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:38:59] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2025-06-02 02:38:59] [INFO ] [Nat]Added 101 Read/Feed constraints in 41 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:38:59] [INFO ] Deduced a trap composed of 78 places in 536 ms of which 41 ms to minimize.
[2025-06-02 02:38:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 596 ms
[2025-06-02 02:38:59] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 126 ms.
[2025-06-02 02:38:59] [INFO ] Added : 1 causal constraints over 1 iterations in 241 ms. Result :sat
Minimization took 498 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:39:00] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:39:01] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2025-06-02 02:39:01] [INFO ] [Real]Added 101 Read/Feed constraints in 107 ms returned sat
[2025-06-02 02:39: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 02:39:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:39:01] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2025-06-02 02:39:01] [INFO ] [Nat]Added 101 Read/Feed constraints in 69 ms returned sat
[2025-06-02 02:39:02] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 190 ms.
[2025-06-02 02:39:02] [INFO ] Added : 2 causal constraints over 1 iterations in 358 ms. Result :sat
Minimization took 438 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:39:02] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:39:03] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2025-06-02 02:39:03] [INFO ] [Real]Added 101 Read/Feed constraints in 79 ms returned sat
[2025-06-02 02:39: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 02:39:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:39:03] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2025-06-02 02:39:03] [INFO ] [Nat]Added 101 Read/Feed constraints in 60 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:39:04] [INFO ] Deduced a trap composed of 78 places in 764 ms of which 70 ms to minimize.
[2025-06-02 02:39:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 848 ms
[2025-06-02 02:39:04] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 193 ms.
[2025-06-02 02:39:05] [INFO ] Added : 2 causal constraints over 1 iterations in 380 ms. Result :sat
Minimization took 525 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:39:05] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:39:06] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2025-06-02 02:39:06] [INFO ] [Real]Added 101 Read/Feed constraints in 102 ms returned sat
[2025-06-02 02:39: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 02:39:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:39:06] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2025-06-02 02:39:06] [INFO ] [Nat]Added 101 Read/Feed constraints in 80 ms returned sat
[2025-06-02 02:39:07] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 193 ms.
[2025-06-02 02:39:07] [INFO ] Added : 2 causal constraints over 1 iterations in 372 ms. Result :sat
Minimization took 578 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:39:08] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:39:08] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2025-06-02 02:39:08] [INFO ] [Real]Added 101 Read/Feed constraints in 45 ms returned sat
[2025-06-02 02:39: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 02:39:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 02:39:08] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2025-06-02 02:39:08] [INFO ] [Nat]Added 101 Read/Feed constraints in 91 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:39:09] [INFO ] Deduced a trap composed of 78 places in 653 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:39:10] [INFO ] Deduced a trap composed of 78 places in 676 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:39:10] [INFO ] Deduced a trap composed of 131 places in 549 ms of which 12 ms to minimize.
[2025-06-02 02:39:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2080 ms
[2025-06-02 02:39:11] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 236 ms.
[2025-06-02 02:39:11] [INFO ] Added : 2 causal constraints over 1 iterations in 407 ms. Result :sat
Minimization took 603 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:39:12] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:39:12] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2025-06-02 02:39:12] [INFO ] [Real]Added 101 Read/Feed constraints in 36 ms returned sat
[2025-06-02 02:39: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 02:39:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:39:12] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2025-06-02 02:39:12] [INFO ] [Nat]Added 101 Read/Feed constraints in 37 ms returned sat
[2025-06-02 02:39:13] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 116 ms.
[2025-06-02 02:39:13] [INFO ] Added : 2 causal constraints over 1 iterations in 220 ms. Result :sat
Minimization took 384 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:39:13] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:39:14] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2025-06-02 02:39:14] [INFO ] [Real]Added 101 Read/Feed constraints in 80 ms returned sat
[2025-06-02 02:39: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 02:39:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-02 02:39:14] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2025-06-02 02:39:14] [INFO ] [Nat]Added 101 Read/Feed constraints in 72 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:39:15] [INFO ] Deduced a trap composed of 78 places in 634 ms of which 35 ms to minimize.
[2025-06-02 02:39:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 703 ms
[2025-06-02 02:39:15] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 128 ms.
[2025-06-02 02:39:15] [INFO ] Added : 2 causal constraints over 1 iterations in 239 ms. Result :sat
Minimization took 417 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[642, 185, 258, 562, 4, 508, 351, 3, 446, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[642, 185, 258, 562, 4, 508, 351, 3, 446, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 10 out of 483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 1353/1353 transitions.
Applied a total of 0 rules in 80 ms. Remains 483 /483 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 483/483 places, 1353/1353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 1353/1353 transitions.
Applied a total of 0 rules in 63 ms. Remains 483 /483 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2025-06-02 02:39:27] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
[2025-06-02 02:39:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:39:28] [INFO ] Implicit Places using invariants in 737 ms returned []
[2025-06-02 02:39:28] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
[2025-06-02 02:39:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:39:28] [INFO ] State equation strengthened by 101 read => feed constraints.
[2025-06-02 02:39:31] [INFO ] Implicit Places using invariants and state equation in 3003 ms returned []
Implicit Place search using SMT with State Equation took 3747 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:39:31] [INFO ] Redundant transitions in 38 ms returned []
Running 1351 sub problems to find dead transitions.
[2025-06-02 02:39:31] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
[2025-06-02 02:39:31] [INFO ] Invariant cache hit.
[2025-06-02 02:39:31] [INFO ] State equation strengthened by 101 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:39:58] [INFO ] Deduced a trap composed of 131 places in 500 ms of which 14 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 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 1.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 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 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1272 variables, and 4 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/483 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 1)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1272 variables, and 4 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/483 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62308ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 62312ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66169 ms. Remains : 483/483 places, 1353/1353 transitions.
[2025-06-02 02:40:33] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {247=1, 391=1, 599=1, 773=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {239=1, 383=1, 591=1, 775=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 10) seen :[0, 0, 3, 3, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[642, 185, 258, 562, 4, 508, 351, 3, 446, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 02:40:34] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
[2025-06-02 02:40:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[642, 185, 258, 562, 4, 508, 351, 3, 446, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 4514 ms. (221 steps per ms)
BEST_FIRST walk for 10000009 steps (20 resets) in 10023 ms. (997 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[642, 185, 258, 562, 4, 508, 351, 3, 476, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 02:40:49] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
[2025-06-02 02:40:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:40:49] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:40:49] [INFO ] [Real]Absence check using state equation in 399 ms returned sat
[2025-06-02 02:40:49] [INFO ] State equation strengthened by 101 read => feed constraints.
[2025-06-02 02:40:49] [INFO ] [Real]Added 101 Read/Feed constraints in 121 ms returned sat
[2025-06-02 02:40: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 02:40:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:40:50] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2025-06-02 02:40:50] [INFO ] [Nat]Added 101 Read/Feed constraints in 65 ms returned sat
[2025-06-02 02:40:50] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 136 ms.
[2025-06-02 02:40:50] [INFO ] Added : 1 causal constraints over 1 iterations in 252 ms. Result :sat
Minimization took 385 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:40:51] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:40:51] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2025-06-02 02:40:51] [INFO ] [Real]Added 101 Read/Feed constraints in 72 ms returned sat
[2025-06-02 02:40: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 02:40:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:40:51] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2025-06-02 02:40:52] [INFO ] [Nat]Added 101 Read/Feed constraints in 51 ms returned sat
[2025-06-02 02:40:52] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 135 ms.
[2025-06-02 02:40:52] [INFO ] Added : 2 causal constraints over 1 iterations in 253 ms. Result :sat
Minimization took 393 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:40:52] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:40:53] [INFO ] [Real]Absence check using state equation in 399 ms returned sat
[2025-06-02 02:40:53] [INFO ] [Real]Added 101 Read/Feed constraints in 75 ms returned sat
[2025-06-02 02:40: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 02:40:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:40:53] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2025-06-02 02:40:53] [INFO ] [Nat]Added 101 Read/Feed constraints in 54 ms returned sat
[2025-06-02 02:40:54] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 154 ms.
[2025-06-02 02:40:54] [INFO ] Added : 3 causal constraints over 1 iterations in 264 ms. Result :sat
Minimization took 373 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:40:54] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:40:55] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2025-06-02 02:40:55] [INFO ] [Real]Added 101 Read/Feed constraints in 58 ms returned sat
[2025-06-02 02:40: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 02:40:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:40:55] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2025-06-02 02:40:55] [INFO ] [Nat]Added 101 Read/Feed constraints in 73 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:40:56] [INFO ] Deduced a trap composed of 78 places in 763 ms of which 37 ms to minimize.
[2025-06-02 02:40:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 855 ms
[2025-06-02 02:40:56] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 217 ms.
[2025-06-02 02:40:57] [INFO ] Added : 1 causal constraints over 1 iterations in 391 ms. Result :sat
Minimization took 552 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:40:57] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:40:58] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2025-06-02 02:40:58] [INFO ] [Real]Added 101 Read/Feed constraints in 119 ms returned sat
[2025-06-02 02:40: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 02:40:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:40:59] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2025-06-02 02:40:59] [INFO ] [Nat]Added 101 Read/Feed constraints in 73 ms returned sat
[2025-06-02 02:40:59] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 221 ms.
[2025-06-02 02:40:59] [INFO ] Added : 2 causal constraints over 1 iterations in 394 ms. Result :sat
Minimization took 562 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:41:00] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:41:00] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2025-06-02 02:41:00] [INFO ] [Real]Added 101 Read/Feed constraints in 115 ms returned sat
[2025-06-02 02:41: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 02:41:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:41:01] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2025-06-02 02:41:01] [INFO ] [Nat]Added 101 Read/Feed constraints in 56 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:41:02] [INFO ] Deduced a trap composed of 78 places in 663 ms of which 61 ms to minimize.
[2025-06-02 02:41:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 747 ms
[2025-06-02 02:41:02] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 210 ms.
[2025-06-02 02:41:02] [INFO ] Added : 2 causal constraints over 1 iterations in 364 ms. Result :sat
Minimization took 469 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:41:03] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:41:03] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2025-06-02 02:41:04] [INFO ] [Real]Added 101 Read/Feed constraints in 110 ms returned sat
[2025-06-02 02:41:04] [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 02:41:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:41:04] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2025-06-02 02:41:04] [INFO ] [Nat]Added 101 Read/Feed constraints in 78 ms returned sat
[2025-06-02 02:41:05] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 220 ms.
[2025-06-02 02:41:05] [INFO ] Added : 2 causal constraints over 1 iterations in 412 ms. Result :sat
Minimization took 599 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:41:06] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:41:06] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2025-06-02 02:41:06] [INFO ] [Real]Added 101 Read/Feed constraints in 51 ms returned sat
[2025-06-02 02:41: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 02:41:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:41:07] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2025-06-02 02:41:07] [INFO ] [Nat]Added 101 Read/Feed constraints in 142 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:41:08] [INFO ] Deduced a trap composed of 78 places in 732 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:41:08] [INFO ] Deduced a trap composed of 78 places in 771 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:41:09] [INFO ] Deduced a trap composed of 131 places in 621 ms of which 12 ms to minimize.
[2025-06-02 02:41:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2297 ms
[2025-06-02 02:41:09] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 137 ms.
[2025-06-02 02:41:09] [INFO ] Added : 2 causal constraints over 1 iterations in 253 ms. Result :sat
Minimization took 593 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:41:10] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:41:11] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2025-06-02 02:41:11] [INFO ] [Real]Added 101 Read/Feed constraints in 47 ms returned sat
[2025-06-02 02:41: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 02:41:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:41:11] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2025-06-02 02:41:11] [INFO ] [Nat]Added 101 Read/Feed constraints in 53 ms returned sat
[2025-06-02 02:41:11] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 208 ms.
[2025-06-02 02:41:12] [INFO ] Added : 2 causal constraints over 1 iterations in 360 ms. Result :sat
Minimization took 398 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:41:12] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:41:12] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2025-06-02 02:41:13] [INFO ] [Real]Added 101 Read/Feed constraints in 82 ms returned sat
[2025-06-02 02:41: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 02:41:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:41:13] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2025-06-02 02:41:13] [INFO ] [Nat]Added 101 Read/Feed constraints in 75 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:41:14] [INFO ] Deduced a trap composed of 78 places in 722 ms of which 36 ms to minimize.
[2025-06-02 02:41:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 814 ms
[2025-06-02 02:41:14] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 227 ms.
[2025-06-02 02:41:15] [INFO ] Added : 2 causal constraints over 1 iterations in 402 ms. Result :sat
Minimization took 614 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[642, 185, 258, 562, 4, 508, 351, 3, 476, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[642, 185, 258, 562, 4, 508, 351, 3, 476, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 10 out of 483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 1353/1353 transitions.
Applied a total of 0 rules in 67 ms. Remains 483 /483 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 483/483 places, 1353/1353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 1353/1353 transitions.
Applied a total of 0 rules in 65 ms. Remains 483 /483 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2025-06-02 02:41:28] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
[2025-06-02 02:41:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:41:29] [INFO ] Implicit Places using invariants in 1040 ms returned []
[2025-06-02 02:41:29] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
[2025-06-02 02:41:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:41:30] [INFO ] State equation strengthened by 101 read => feed constraints.
[2025-06-02 02:41:32] [INFO ] Implicit Places using invariants and state equation in 3208 ms returned []
Implicit Place search using SMT with State Equation took 4252 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:41:32] [INFO ] Redundant transitions in 61 ms returned []
Running 1351 sub problems to find dead transitions.
[2025-06-02 02:41:32] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
[2025-06-02 02:41:32] [INFO ] Invariant cache hit.
[2025-06-02 02:41:32] [INFO ] State equation strengthened by 101 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:42:01] [INFO ] Deduced a trap composed of 131 places in 518 ms of which 15 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 483/1272 variables, and 4 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/483 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1272 variables, and 4 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/483 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63605ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 63611ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68003 ms. Remains : 483/483 places, 1353/1353 transitions.
[2025-06-02 02:42:36] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {247=1, 391=1, 599=1, 773=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {239=1, 383=1, 591=1, 775=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 10) seen :[0, 0, 3, 3, 3, 0, 0, 0, 3, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[642, 185, 258, 562, 4, 508, 351, 3, 476, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 02:42:37] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
[2025-06-02 02:42:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[642, 185, 258, 562, 4, 508, 351, 3, 476, 148] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 5099 ms. (196 steps per ms)
BEST_FIRST walk for 10000009 steps (20 resets) in 11321 ms. (883 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[642, 185, 258, 562, 4, 508, 351, 3, 476, 208] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 02:42:53] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
[2025-06-02 02:42:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:42:53] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:42:54] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2025-06-02 02:42:54] [INFO ] State equation strengthened by 101 read => feed constraints.
[2025-06-02 02:42:54] [INFO ] [Real]Added 101 Read/Feed constraints in 135 ms returned sat
[2025-06-02 02:42: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 02:42:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:42:54] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2025-06-02 02:42:55] [INFO ] [Nat]Added 101 Read/Feed constraints in 113 ms returned sat
[2025-06-02 02:42:55] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 206 ms.
[2025-06-02 02:42:55] [INFO ] Added : 1 causal constraints over 1 iterations in 392 ms. Result :sat
Minimization took 572 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:42:56] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:42:56] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2025-06-02 02:42:56] [INFO ] [Real]Added 101 Read/Feed constraints in 84 ms returned sat
[2025-06-02 02:42: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 02:42:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:42:57] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2025-06-02 02:42:57] [INFO ] [Nat]Added 101 Read/Feed constraints in 64 ms returned sat
[2025-06-02 02:42:57] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 193 ms.
[2025-06-02 02:42:57] [INFO ] Added : 2 causal constraints over 1 iterations in 346 ms. Result :sat
Minimization took 566 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:42:58] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:42:59] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2025-06-02 02:42:59] [INFO ] [Real]Added 101 Read/Feed constraints in 82 ms returned sat
[2025-06-02 02:42: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 02:42:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:42:59] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2025-06-02 02:42:59] [INFO ] [Nat]Added 101 Read/Feed constraints in 93 ms returned sat
[2025-06-02 02:43:00] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 203 ms.
[2025-06-02 02:43:00] [INFO ] Added : 3 causal constraints over 1 iterations in 374 ms. Result :sat
Minimization took 566 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:43:01] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:43:01] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2025-06-02 02:43:01] [INFO ] [Real]Added 101 Read/Feed constraints in 63 ms returned sat
[2025-06-02 02:43: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 02:43:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:43:02] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2025-06-02 02:43:02] [INFO ] [Nat]Added 101 Read/Feed constraints in 81 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:43:03] [INFO ] Deduced a trap composed of 78 places in 715 ms of which 37 ms to minimize.
[2025-06-02 02:43:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 800 ms
[2025-06-02 02:43:03] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 147 ms.
[2025-06-02 02:43:03] [INFO ] Added : 1 causal constraints over 1 iterations in 304 ms. Result :sat
Minimization took 560 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:43:04] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:43:04] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2025-06-02 02:43:04] [INFO ] [Real]Added 101 Read/Feed constraints in 104 ms returned sat
[2025-06-02 02:43:04] [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 02:43:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:43:05] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2025-06-02 02:43:05] [INFO ] [Nat]Added 101 Read/Feed constraints in 55 ms returned sat
[2025-06-02 02:43:05] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 209 ms.
[2025-06-02 02:43:05] [INFO ] Added : 2 causal constraints over 1 iterations in 350 ms. Result :sat
Minimization took 573 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:43:06] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:43:06] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2025-06-02 02:43:06] [INFO ] [Real]Added 101 Read/Feed constraints in 82 ms returned sat
[2025-06-02 02:43: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 02:43:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:43:07] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2025-06-02 02:43:07] [INFO ] [Nat]Added 101 Read/Feed constraints in 80 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:43:08] [INFO ] Deduced a trap composed of 78 places in 767 ms of which 62 ms to minimize.
[2025-06-02 02:43:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 855 ms
[2025-06-02 02:43:08] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 194 ms.
[2025-06-02 02:43:08] [INFO ] Added : 2 causal constraints over 1 iterations in 363 ms. Result :sat
Minimization took 578 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:43:09] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:43:09] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2025-06-02 02:43:09] [INFO ] [Real]Added 101 Read/Feed constraints in 73 ms returned sat
[2025-06-02 02:43:10] [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 02:43:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2025-06-02 02:43:10] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2025-06-02 02:43:10] [INFO ] [Nat]Added 101 Read/Feed constraints in 86 ms returned sat
[2025-06-02 02:43:10] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 191 ms.
[2025-06-02 02:43:11] [INFO ] Added : 2 causal constraints over 1 iterations in 366 ms. Result :sat
Minimization took 593 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:43:11] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:43:12] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2025-06-02 02:43:12] [INFO ] [Real]Added 101 Read/Feed constraints in 75 ms returned sat
[2025-06-02 02:43: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 02:43:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:43:13] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2025-06-02 02:43:13] [INFO ] [Nat]Added 101 Read/Feed constraints in 155 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:43:14] [INFO ] Deduced a trap composed of 78 places in 745 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:43:14] [INFO ] Deduced a trap composed of 78 places in 787 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:43:15] [INFO ] Deduced a trap composed of 131 places in 582 ms of which 11 ms to minimize.
[2025-06-02 02:43:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2276 ms
[2025-06-02 02:43:15] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 186 ms.
[2025-06-02 02:43:15] [INFO ] Added : 2 causal constraints over 1 iterations in 322 ms. Result :sat
Minimization took 611 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:43:16] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:43:17] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2025-06-02 02:43:17] [INFO ] [Real]Added 101 Read/Feed constraints in 66 ms returned sat
[2025-06-02 02:43: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 02:43:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:43:17] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2025-06-02 02:43:17] [INFO ] [Nat]Added 101 Read/Feed constraints in 47 ms returned sat
[2025-06-02 02:43:18] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 185 ms.
[2025-06-02 02:43:18] [INFO ] Added : 2 causal constraints over 1 iterations in 346 ms. Result :sat
Minimization took 561 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:43:19] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:43:19] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2025-06-02 02:43:19] [INFO ] [Real]Added 101 Read/Feed constraints in 53 ms returned sat
[2025-06-02 02:43: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 02:43:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:43:20] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2025-06-02 02:43:20] [INFO ] [Nat]Added 101 Read/Feed constraints in 91 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:43:20] [INFO ] Deduced a trap composed of 78 places in 786 ms of which 61 ms to minimize.
[2025-06-02 02:43:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 878 ms
[2025-06-02 02:43:21] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 200 ms.
[2025-06-02 02:43:21] [INFO ] Added : 2 causal constraints over 1 iterations in 384 ms. Result :sat
Minimization took 625 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[642, 185, 258, 562, 4, 508, 351, 3, 476, 208] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[642, 185, 258, 562, 4, 508, 351, 3, 476, 208] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 10 out of 483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 1353/1353 transitions.
Applied a total of 0 rules in 69 ms. Remains 483 /483 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 483/483 places, 1353/1353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 1353/1353 transitions.
Applied a total of 0 rules in 65 ms. Remains 483 /483 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2025-06-02 02:43:35] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
[2025-06-02 02:43:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:43:36] [INFO ] Implicit Places using invariants in 728 ms returned []
[2025-06-02 02:43:36] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
[2025-06-02 02:43:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:43:36] [INFO ] State equation strengthened by 101 read => feed constraints.
[2025-06-02 02:43:39] [INFO ] Implicit Places using invariants and state equation in 3049 ms returned []
Implicit Place search using SMT with State Equation took 3778 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:43:39] [INFO ] Redundant transitions in 37 ms returned []
Running 1351 sub problems to find dead transitions.
[2025-06-02 02:43:39] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
[2025-06-02 02:43:39] [INFO ] Invariant cache hit.
[2025-06-02 02:43:39] [INFO ] State equation strengthened by 101 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:44:04] [INFO ] Deduced a trap composed of 131 places in 445 ms of which 14 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 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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1272 variables, and 4 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/483 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1272 variables, and 4 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/483 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63471ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 63475ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67366 ms. Remains : 483/483 places, 1353/1353 transitions.
[2025-06-02 02:44:42] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {247=1, 391=1, 599=1, 773=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {239=1, 383=1, 591=1, 775=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 10) seen :[2, 0, 0, 0, 0, 2, 0, 0, 2147483647, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[642, 185, 258, 562, 4, 508, 351, 3, +inf, 208] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 02:44:43] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
[2025-06-02 02:44:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[642, 185, 258, 562, 4, 508, 351, 3, +inf, 208] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000006 steps (2 resets) in 4656 ms. (214 steps per ms)
FORMULA FunctionPointer-PT-c004-UpperBounds-12 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 9000007 steps (18 resets) in 8825 ms. (1019 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[642, 190, 258, 562, 11, 508, 351, 3, 208] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 02:44:57] [INFO ] Flow matrix only has 789 transitions (discarded 564 similar events)
[2025-06-02 02:44:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:44:57] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:44:57] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2025-06-02 02:44:57] [INFO ] State equation strengthened by 101 read => feed constraints.
[2025-06-02 02:44:57] [INFO ] [Real]Added 101 Read/Feed constraints in 118 ms returned sat
[2025-06-02 02:44: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 02:44:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:44:58] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2025-06-02 02:44:58] [INFO ] [Nat]Added 101 Read/Feed constraints in 115 ms returned sat
[2025-06-02 02:44:58] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 219 ms.
[2025-06-02 02:44:58] [INFO ] Added : 1 causal constraints over 1 iterations in 404 ms. Result :sat
Minimization took 594 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:44:59] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:45:00] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2025-06-02 02:45:00] [INFO ] [Real]Added 101 Read/Feed constraints in 78 ms returned sat
[2025-06-02 02:45: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 02:45:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:45:00] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2025-06-02 02:45:00] [INFO ] [Nat]Added 101 Read/Feed constraints in 81 ms returned sat
[2025-06-02 02:45:01] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 214 ms.
[2025-06-02 02:45:01] [INFO ] Added : 2 causal constraints over 1 iterations in 381 ms. Result :sat
Minimization took 586 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:45:02] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:45:02] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2025-06-02 02:45:02] [INFO ] [Real]Added 101 Read/Feed constraints in 53 ms returned sat
[2025-06-02 02:45:02] [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 02:45:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:45:03] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2025-06-02 02:45:03] [INFO ] [Nat]Added 101 Read/Feed constraints in 86 ms returned sat
[2025-06-02 02:45:03] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 211 ms.
[2025-06-02 02:45:03] [INFO ] Added : 3 causal constraints over 1 iterations in 400 ms. Result :sat
Minimization took 569 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:45:04] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:45:05] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2025-06-02 02:45:05] [INFO ] [Real]Added 101 Read/Feed constraints in 68 ms returned sat
[2025-06-02 02:45: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 02:45:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:45:05] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2025-06-02 02:45:05] [INFO ] [Nat]Added 101 Read/Feed constraints in 74 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:45:06] [INFO ] Deduced a trap composed of 78 places in 784 ms of which 57 ms to minimize.
[2025-06-02 02:45:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 879 ms
[2025-06-02 02:45:06] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 192 ms.
[2025-06-02 02:45:07] [INFO ] Added : 1 causal constraints over 1 iterations in 389 ms. Result :sat
Minimization took 558 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:45:07] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:45:08] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2025-06-02 02:45:08] [INFO ] [Real]Added 101 Read/Feed constraints in 140 ms returned sat
[2025-06-02 02:45: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 02:45:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:45:09] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2025-06-02 02:45:09] [INFO ] [Nat]Added 101 Read/Feed constraints in 60 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:45:09] [INFO ] Deduced a trap composed of 78 places in 766 ms of which 62 ms to minimize.
[2025-06-02 02:45:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 850 ms
[2025-06-02 02:45:10] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 210 ms.
[2025-06-02 02:45:10] [INFO ] Added : 2 causal constraints over 1 iterations in 380 ms. Result :sat
Minimization took 624 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:45:11] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:45:11] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2025-06-02 02:45:11] [INFO ] [Real]Added 101 Read/Feed constraints in 128 ms returned sat
[2025-06-02 02:45: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 02:45:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:45:12] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2025-06-02 02:45:12] [INFO ] [Nat]Added 101 Read/Feed constraints in 88 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:45:13] [INFO ] Deduced a trap composed of 78 places in 782 ms of which 62 ms to minimize.
[2025-06-02 02:45:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 876 ms
[2025-06-02 02:45:13] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 220 ms.
[2025-06-02 02:45:13] [INFO ] Added : 2 causal constraints over 1 iterations in 399 ms. Result :sat
Minimization took 580 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:45:14] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:45:14] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2025-06-02 02:45:15] [INFO ] [Real]Added 101 Read/Feed constraints in 66 ms returned sat
[2025-06-02 02:45:15] [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 02:45:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:45:15] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2025-06-02 02:45:15] [INFO ] [Nat]Added 101 Read/Feed constraints in 85 ms returned sat
[2025-06-02 02:45:16] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 221 ms.
[2025-06-02 02:45:16] [INFO ] Added : 2 causal constraints over 1 iterations in 400 ms. Result :sat
Minimization took 585 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:45:17] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:45:17] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2025-06-02 02:45:17] [INFO ] [Real]Added 101 Read/Feed constraints in 77 ms returned sat
[2025-06-02 02: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 02:45:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:45:18] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2025-06-02 02:45:18] [INFO ] [Nat]Added 101 Read/Feed constraints in 134 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:45:18] [INFO ] Deduced a trap composed of 78 places in 615 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:45:19] [INFO ] Deduced a trap composed of 78 places in 801 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:45:20] [INFO ] Deduced a trap composed of 131 places in 597 ms of which 17 ms to minimize.
[2025-06-02 02:45:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2189 ms
[2025-06-02 02:45:20] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 217 ms.
[2025-06-02 02:45:20] [INFO ] Added : 2 causal constraints over 1 iterations in 400 ms. Result :sat
Minimization took 462 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:45:21] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:45:21] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2025-06-02 02:45:22] [INFO ] [Real]Added 101 Read/Feed constraints in 76 ms returned sat
[2025-06-02 02:45: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 02:45:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:45:22] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2025-06-02 02:45:22] [INFO ] [Nat]Added 101 Read/Feed constraints in 80 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:45:23] [INFO ] Deduced a trap composed of 78 places in 779 ms of which 62 ms to minimize.
[2025-06-02 02:45:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 872 ms
[2025-06-02 02:45:23] [INFO ] Computed and/alt/rep : 95/100/88 causal constraints (skipped 699 transitions) in 219 ms.
[2025-06-02 02:45:24] [INFO ] Added : 2 causal constraints over 1 iterations in 404 ms. Result :sat
Minimization took 608 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[642, 190, 258, 562, 11, 508, 351, 3, 208] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[642, 190, 258, 562, 11, 508, 351, 3, 208] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 483/483 places, 1353/1353 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 482 transition count 1349
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 482 transition count 1349
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 481 transition count 1347
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 481 transition count 1347
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 480 transition count 1345
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 480 transition count 1345
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 479 transition count 1343
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 479 transition count 1343
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 478 transition count 1341
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 478 transition count 1341
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 477 transition count 1339
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 477 transition count 1339
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 476 transition count 1337
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 476 transition count 1337
Applied a total of 14 rules in 209 ms. Remains 476 /483 variables (removed 7) and now considering 1337/1353 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 476/483 places, 1337/1353 transitions.
[2025-06-02 02:45:35] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {209=1, 347=1, 554=1, 764=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 390=1, 597=1, 756=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 9) seen :[0, 0, 2, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[642, 190, 258, 562, 11, 508, 351, 3, 208] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 02:45:35] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
// Phase 1: matrix 777 rows 476 cols
[2025-06-02 02:45:35] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[642, 190, 258, 562, 11, 508, 351, 3, 208] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 4705 ms. (212 steps per ms)
BEST_FIRST walk for 9000008 steps (18 resets) in 8443 ms. (1065 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[642, 190, 258, 565, 11, 508, 351, 3, 208] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 02:45:49] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
[2025-06-02 02:45:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:45:49] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:45:49] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2025-06-02 02:45:49] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-02 02:45:49] [INFO ] [Real]Added 98 Read/Feed constraints in 136 ms returned sat
[2025-06-02 02:45: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 02:45:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:45:50] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2025-06-02 02:45:50] [INFO ] [Nat]Added 98 Read/Feed constraints in 94 ms returned sat
[2025-06-02 02:45:50] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 142 ms.
[2025-06-02 02:45:50] [INFO ] Added : 1 causal constraints over 1 iterations in 280 ms. Result :sat
Minimization took 403 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:45:51] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:45:51] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2025-06-02 02:45:51] [INFO ] [Real]Added 98 Read/Feed constraints in 69 ms returned sat
[2025-06-02 02:45: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 02:45:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:45:52] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2025-06-02 02:45:52] [INFO ] [Nat]Added 98 Read/Feed constraints in 73 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:45:53] [INFO ] Deduced a trap composed of 77 places in 714 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:45:54] [INFO ] Deduced a trap composed of 77 places in 680 ms of which 74 ms to minimize.
[2025-06-02 02:45:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1526 ms
[2025-06-02 02:45:54] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 167 ms.
[2025-06-02 02:45:54] [INFO ] Added : 2 causal constraints over 1 iterations in 322 ms. Result :sat
Minimization took 595 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:45:55] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:45:55] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2025-06-02 02:45:55] [INFO ] [Real]Added 98 Read/Feed constraints in 54 ms returned sat
[2025-06-02 02:45: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 02:45:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:45:56] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2025-06-02 02:45:56] [INFO ] [Nat]Added 98 Read/Feed constraints in 62 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:45:56] [INFO ] Deduced a trap composed of 77 places in 581 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:45:57] [INFO ] Deduced a trap composed of 84 places in 597 ms of which 60 ms to minimize.
[2025-06-02 02:45:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1341 ms
[2025-06-02 02:45:57] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 190 ms.
[2025-06-02 02:45:57] [INFO ] Added : 3 causal constraints over 1 iterations in 376 ms. Result :sat
Minimization took 585 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:45:58] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:45:58] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2025-06-02 02:45:58] [INFO ] [Real]Added 98 Read/Feed constraints in 54 ms returned sat
[2025-06-02 02:45: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 02:45:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:45:59] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2025-06-02 02:45:59] [INFO ] [Nat]Added 98 Read/Feed constraints in 77 ms returned sat
[2025-06-02 02:45:59] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 182 ms.
[2025-06-02 02:45:59] [INFO ] Added : 1 causal constraints over 1 iterations in 351 ms. Result :sat
Minimization took 433 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:46:00] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:46:00] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2025-06-02 02:46:00] [INFO ] [Real]Added 98 Read/Feed constraints in 71 ms returned sat
[2025-06-02 02:46: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 02:46:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:46:01] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2025-06-02 02:46:01] [INFO ] [Nat]Added 98 Read/Feed constraints in 59 ms returned sat
[2025-06-02 02:46:01] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 181 ms.
[2025-06-02 02:46:01] [INFO ] Added : 2 causal constraints over 1 iterations in 319 ms. Result :sat
Minimization took 431 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:46:02] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:46:02] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2025-06-02 02:46:03] [INFO ] [Real]Added 98 Read/Feed constraints in 105 ms returned sat
[2025-06-02 02:46: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 02:46:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:46:03] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2025-06-02 02:46:03] [INFO ] [Nat]Added 98 Read/Feed constraints in 145 ms returned sat
[2025-06-02 02:46:04] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 198 ms.
[2025-06-02 02:46:04] [INFO ] Added : 2 causal constraints over 1 iterations in 374 ms. Result :sat
Minimization took 572 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:46:05] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:46:05] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2025-06-02 02:46:05] [INFO ] [Real]Added 98 Read/Feed constraints in 83 ms returned sat
[2025-06-02 02:46: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 02:46:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:46:06] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2025-06-02 02:46:06] [INFO ] [Nat]Added 98 Read/Feed constraints in 71 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:46:07] [INFO ] Deduced a trap composed of 77 places in 757 ms of which 59 ms to minimize.
[2025-06-02 02:46:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 869 ms
[2025-06-02 02:46:07] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 192 ms.
[2025-06-02 02:46:07] [INFO ] Added : 2 causal constraints over 1 iterations in 367 ms. Result :sat
Minimization took 628 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:46:08] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 02:46:08] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2025-06-02 02:46:08] [INFO ] [Real]Added 98 Read/Feed constraints in 63 ms returned sat
[2025-06-02 02:46: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 02:46:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:46:09] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2025-06-02 02:46:09] [INFO ] [Nat]Added 98 Read/Feed constraints in 152 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:46:10] [INFO ] Deduced a trap composed of 77 places in 744 ms of which 86 ms to minimize.
[2025-06-02 02:46:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 833 ms
[2025-06-02 02:46:10] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 197 ms.
[2025-06-02 02:46:10] [INFO ] Added : 2 causal constraints over 1 iterations in 376 ms. Result :sat
Minimization took 641 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:46:11] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:46:12] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2025-06-02 02:46:12] [INFO ] [Real]Added 98 Read/Feed constraints in 104 ms returned sat
[2025-06-02 02:46: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 02:46:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:46:12] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2025-06-02 02:46:12] [INFO ] [Nat]Added 98 Read/Feed constraints in 106 ms returned sat
[2025-06-02 02:46:13] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 117 ms.
[2025-06-02 02:46:13] [INFO ] Added : 2 causal constraints over 1 iterations in 254 ms. Result :sat
Minimization took 442 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[642, 190, 258, 565, 11, 508, 351, 3, 208] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[642, 190, 258, 565, 11, 508, 351, 3, 208] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 1337/1337 transitions.
Applied a total of 0 rules in 106 ms. Remains 476 /476 variables (removed 0) and now considering 1337/1337 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 476/476 places, 1337/1337 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 1337/1337 transitions.
Applied a total of 0 rules in 72 ms. Remains 476 /476 variables (removed 0) and now considering 1337/1337 (removed 0) transitions.
[2025-06-02 02:46:23] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
[2025-06-02 02:46:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:46:24] [INFO ] Implicit Places using invariants in 706 ms returned []
[2025-06-02 02:46:24] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
[2025-06-02 02:46:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:46:24] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-02 02:46:27] [INFO ] Implicit Places using invariants and state equation in 3106 ms returned []
Implicit Place search using SMT with State Equation took 3819 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:46:27] [INFO ] Redundant transitions in 60 ms returned []
Running 1335 sub problems to find dead transitions.
[2025-06-02 02:46:27] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
[2025-06-02 02:46:27] [INFO ] Invariant cache hit.
[2025-06-02 02:46:27] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:46:54] [INFO ] Deduced a trap composed of 131 places in 495 ms of which 16 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 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 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/1253 variables, and 4 constraints, problems are : Problem set: 0 solved, 1335 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/476 constraints, ReadFeed: 0/98 constraints, PredecessorRefiner: 1335/1335 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1335 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 1)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 1)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/1253 variables, and 4 constraints, problems are : Problem set: 0 solved, 1335 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/476 constraints, ReadFeed: 0/98 constraints, PredecessorRefiner: 0/1335 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63195ms problems are : Problem set: 0 solved, 1335 unsolved
Search for dead transitions found 0 dead transitions in 63200ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67163 ms. Remains : 476/476 places, 1337/1337 transitions.
[2025-06-02 02:47:30] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {209=1, 347=1, 554=1, 764=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 390=1, 597=1, 756=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 9) seen :[2, 0, 3, 3, 2, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[642, 190, 258, 565, 11, 508, 351, 3, 208] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 02:47:31] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
[2025-06-02 02:47:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[642, 190, 258, 565, 11, 508, 351, 3, 208] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000001 steps (2 resets) in 4201 ms. (237 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 8780 ms. (1024 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[642, 190, 258, 565, 11, 508, 351, 3, 208] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 02:47:44] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
[2025-06-02 02:47:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:47:44] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 02:47:44] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2025-06-02 02:47:44] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-02 02:47:44] [INFO ] [Real]Added 98 Read/Feed constraints in 80 ms returned sat
[2025-06-02 02:47: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 02:47:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:47:45] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2025-06-02 02:47:45] [INFO ] [Nat]Added 98 Read/Feed constraints in 92 ms returned sat
[2025-06-02 02:47:45] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 151 ms.
[2025-06-02 02:47:45] [INFO ] Added : 1 causal constraints over 1 iterations in 297 ms. Result :sat
Minimization took 580 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:47:46] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 02:47:46] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2025-06-02 02:47:46] [INFO ] [Real]Added 98 Read/Feed constraints in 60 ms returned sat
[2025-06-02 02:47: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 02:47:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:47:47] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2025-06-02 02:47:47] [INFO ] [Nat]Added 98 Read/Feed constraints in 71 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:47:47] [INFO ] Deduced a trap composed of 77 places in 522 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:47:48] [INFO ] Deduced a trap composed of 77 places in 514 ms of which 52 ms to minimize.
[2025-06-02 02:47:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1144 ms
[2025-06-02 02:47:48] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 190 ms.
[2025-06-02 02:47:48] [INFO ] Added : 2 causal constraints over 1 iterations in 379 ms. Result :sat
Minimization took 590 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:47:49] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:47:49] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2025-06-02 02:47:50] [INFO ] [Real]Added 98 Read/Feed constraints in 58 ms returned sat
[2025-06-02 02:47: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 02:47:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 02:47:50] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2025-06-02 02:47:50] [INFO ] [Nat]Added 98 Read/Feed constraints in 72 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:47:51] [INFO ] Deduced a trap composed of 77 places in 591 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:47:51] [INFO ] Deduced a trap composed of 84 places in 584 ms of which 61 ms to minimize.
[2025-06-02 02:47:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1315 ms
[2025-06-02 02:47:52] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 199 ms.
[2025-06-02 02:47:52] [INFO ] Added : 3 causal constraints over 1 iterations in 380 ms. Result :sat
Minimization took 564 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:47:53] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:47:53] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2025-06-02 02:47:53] [INFO ] [Real]Added 98 Read/Feed constraints in 47 ms returned sat
[2025-06-02 02:47: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 02:47:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:47:53] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2025-06-02 02:47:54] [INFO ] [Nat]Added 98 Read/Feed constraints in 84 ms returned sat
[2025-06-02 02:47:54] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 186 ms.
[2025-06-02 02:47:54] [INFO ] Added : 1 causal constraints over 1 iterations in 328 ms. Result :sat
Minimization took 527 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:47:55] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:47:55] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2025-06-02 02:47:55] [INFO ] [Real]Added 98 Read/Feed constraints in 68 ms returned sat
[2025-06-02 02:47: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 02:47:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 02:47:56] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2025-06-02 02:47:56] [INFO ] [Nat]Added 98 Read/Feed constraints in 86 ms returned sat
[2025-06-02 02:47:56] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 234 ms.
[2025-06-02 02:47:56] [INFO ] Added : 2 causal constraints over 1 iterations in 428 ms. Result :sat
Minimization took 508 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:47:57] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:47:57] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2025-06-02 02:47:57] [INFO ] [Real]Added 98 Read/Feed constraints in 108 ms returned sat
[2025-06-02 02:47: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 02:47:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:47:58] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2025-06-02 02:47:58] [INFO ] [Nat]Added 98 Read/Feed constraints in 94 ms returned sat
[2025-06-02 02:47:58] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 145 ms.
[2025-06-02 02:47:58] [INFO ] Added : 2 causal constraints over 1 iterations in 264 ms. Result :sat
Minimization took 385 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:47:59] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:47:59] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2025-06-02 02:47:59] [INFO ] [Real]Added 98 Read/Feed constraints in 57 ms returned sat
[2025-06-02 02:47: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 02:47:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:47:59] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2025-06-02 02:48:00] [INFO ] [Nat]Added 98 Read/Feed constraints in 48 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:48:00] [INFO ] Deduced a trap composed of 77 places in 509 ms of which 60 ms to minimize.
[2025-06-02 02:48:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 581 ms
[2025-06-02 02:48:00] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 133 ms.
[2025-06-02 02:48:00] [INFO ] Added : 2 causal constraints over 1 iterations in 251 ms. Result :sat
Minimization took 445 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:48:01] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:48:01] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2025-06-02 02:48:01] [INFO ] [Real]Added 98 Read/Feed constraints in 43 ms returned sat
[2025-06-02 02:48: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 02:48:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:48:02] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2025-06-02 02:48:02] [INFO ] [Nat]Added 98 Read/Feed constraints in 115 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:48:02] [INFO ] Deduced a trap composed of 77 places in 552 ms of which 53 ms to minimize.
[2025-06-02 02:48:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 634 ms
[2025-06-02 02:48:03] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 148 ms.
[2025-06-02 02:48:03] [INFO ] Added : 2 causal constraints over 1 iterations in 267 ms. Result :sat
Minimization took 454 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:48:03] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:48:04] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2025-06-02 02:48:04] [INFO ] [Real]Added 98 Read/Feed constraints in 71 ms returned sat
[2025-06-02 02:48:04] [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 02:48:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:48:04] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2025-06-02 02:48:04] [INFO ] [Nat]Added 98 Read/Feed constraints in 71 ms returned sat
[2025-06-02 02:48:05] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 140 ms.
[2025-06-02 02:48:05] [INFO ] Added : 2 causal constraints over 1 iterations in 255 ms. Result :sat
Minimization took 434 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[642, 190, 258, 565, 11, 508, 351, 3, 208] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[642, 190, 258, 565, 11, 508, 351, 3, 208] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 1337/1337 transitions.
Applied a total of 0 rules in 65 ms. Remains 476 /476 variables (removed 0) and now considering 1337/1337 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 476/476 places, 1337/1337 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 1337/1337 transitions.
Applied a total of 0 rules in 73 ms. Remains 476 /476 variables (removed 0) and now considering 1337/1337 (removed 0) transitions.
[2025-06-02 02:48:14] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
[2025-06-02 02:48:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:48:15] [INFO ] Implicit Places using invariants in 654 ms returned []
[2025-06-02 02:48:15] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
[2025-06-02 02:48:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:48:15] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-02 02:48:18] [INFO ] Implicit Places using invariants and state equation in 2565 ms returned []
Implicit Place search using SMT with State Equation took 3237 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:48:18] [INFO ] Redundant transitions in 37 ms returned []
Running 1335 sub problems to find dead transitions.
[2025-06-02 02:48:18] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
[2025-06-02 02:48:18] [INFO ] Invariant cache hit.
[2025-06-02 02:48:18] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:48:37] [INFO ] Deduced a trap composed of 131 places in 357 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/1253 variables, and 4 constraints, problems are : Problem set: 0 solved, 1335 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/476 constraints, ReadFeed: 0/98 constraints, PredecessorRefiner: 1335/1335 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1335 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1335 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 476/1253 variables, and 4 constraints, problems are : Problem set: 0 solved, 1335 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/476 constraints, ReadFeed: 0/98 constraints, PredecessorRefiner: 0/1335 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62835ms problems are : Problem set: 0 solved, 1335 unsolved
Search for dead transitions found 0 dead transitions in 62838ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66193 ms. Remains : 476/476 places, 1337/1337 transitions.
[2025-06-02 02:49:20] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {209=1, 347=1, 554=1, 764=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 390=1, 597=1, 756=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :[0, 0, 0, 0, 0, 0, 0, 1, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[642, 190, 258, 565, 11, 508, 351, 3, 208] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40001 steps (8 resets) in 1881 ms. (21 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 209 ms. (190 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 181 ms. (219 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 8/8 properties
[2025-06-02 02:49:22] [INFO ] Flatten gal took : 453 ms
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 8/8 properties
[2025-06-02 02:49:22] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
[2025-06-02 02:49:22] [INFO ] Invariant cache hit.
[2025-06-02 02:49:23] [INFO ] State equation strengthened by 98 read => feed constraints.
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, 8 unsolved
[2025-06-02 02:49:23] [INFO ] Flatten gal took : 144 ms
At refinement iteration 1 (OVERLAPS) 20/28 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-02 02:49:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9239742943349609597.gal : 90 ms
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-02 02:49:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10045895132366255368.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/ReachabilityCardinality9239742943349609597.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10045895132366255368.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
At refinement iteration 3 (OVERLAPS) 415/443 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Loading property file /tmp/ReachabilityCardinality10045895132366255368.prop.
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 15/458 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 653/1111 variables, 367/405 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1111 variables, 93/498 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :31 after 1862
At refinement iteration 11 (INCLUDED_ONLY) 0/1111 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 62/1173 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1173 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 75/1248 variables, 74/573 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1248 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :1862 after 695653
At refinement iteration 16 (INCLUDED_ONLY) 0/1248 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 4/1252 variables, 2/576 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1252 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 1/1253 variables, 1/577 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1253 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/1253 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1253/1253 variables, and 577 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4962 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 476/476 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 20/28 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 415/443 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 8/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 15/458 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 653/1111 variables, 367/413 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1111 variables, 93/506 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:49:28] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:49:28] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1111 variables, 2/508 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1111 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 62/1173 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1173 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 75/1248 variables, 74/583 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1248 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :695653 after 5.84095e+07
[2025-06-02 02:49:30] [INFO ] Deduced a trap along path composed of 3 places in 500 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:49:30] [INFO ] Deduced a trap along path composed of 3 places in 160 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:49:31] [INFO ] Deduced a trap along path composed of 3 places in 219 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:49:31] [INFO ] Deduced a trap along path composed of 3 places in 212 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:49:31] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1248 variables, 5/589 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1248 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 4/1252 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1252/1253 variables, and 591 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 475/476 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 10043ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 1337/1337 transitions.
Graph (complete) has 2296 edges and 476 vertex of which 473 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 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 473 transition count 1332
Applied a total of 6 rules in 71 ms. Remains 473 /476 variables (removed 3) and now considering 1332/1337 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 473/476 places, 1332/1337 transitions.
RANDOM walk for 40006 steps (8 resets) in 694 ms. (57 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :5.84095e+07 after 1.98742e+08
Interrupted probabilistic random walk after 156009 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 8
Probabilistic random walk after 156009 steps, saw 95681 distinct states, run finished after 3008 ms. (steps per millisecond=51 ) properties seen :0
[2025-06-02 02:49:36] [INFO ] Flow matrix only has 772 transitions (discarded 560 similar events)
// Phase 1: matrix 772 rows 473 cols
[2025-06-02 02:49:36] [INFO ] Computed 3 invariants in 3 ms
[2025-06-02 02:49:36] [INFO ] State equation strengthened by 95 read => feed constraints.
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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 20/28 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 413/441 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 15/456 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 650/1106 variables, 366/404 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1106 variables, 91/495 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1106 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 62/1168 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :1.98742e+08 after 2.81328e+08
At refinement iteration 13 (INCLUDED_ONLY) 0/1168 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 72/1240 variables, 72/568 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1240 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 4/1244 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1244 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 1/1245 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1245 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 0/1245 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 571 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1736 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 473/473 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 20/28 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 413/441 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 8/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 15/456 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 650/1106 variables, 366/412 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1106 variables, 91/503 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:49:39] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 1 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :2.81328e+08 after 2.98147e+08
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:49:39] [INFO ] Deduced a trap along path composed of 3 places in 55 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1106 variables, 2/505 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1106 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 62/1168 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1168 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 72/1240 variables, 72/578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:49:41] [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 02:49:41] [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 02:49:41] [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 02:49:41] [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 02:49:41] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1240 variables, 5/583 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1240 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 4/1244 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1244 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :2.98147e+08 after 3.06596e+08
At refinement iteration 21 (OVERLAPS) 1/1245 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:49:45] [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 02:49:45] [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 02:49:45] [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 02:49:45] [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 02:49:45] [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 02:49:45] [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 02:49:45] [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 02:49:45] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1245 variables, 8/594 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1245 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 0/1245 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 594 constraints, problems are : Problem set: 0 solved, 8 unsolved in 9002 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 473/473 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 15/15 constraints]
After SMT, in 10782ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :3.06596e+08 after 3.22977e+08
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :3.22977e+08 after 3.9783e+08
Detected timeout of ITS tools.
[2025-06-02 02:50:13] [INFO ] Flatten gal took : 110 ms
[2025-06-02 02:50:13] [INFO ] Applying decomposition
[2025-06-02 02:50:13] [INFO ] Flatten gal took : 131 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/graph15292971932290035251.txt' '-o' '/tmp/graph15292971932290035251.bin' '-w' '/tmp/graph15292971932290035251.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15292971932290035251.bin' '-l' '-1' '-v' '-w' '/tmp/graph15292971932290035251.weights' '-q' '0' '-e' '0.001'
[2025-06-02 02:50:14] [INFO ] Decomposing Gal with order
[2025-06-02 02:50:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 02:50:14] [INFO ] Removed a total of 2308 redundant transitions.
[2025-06-02 02:50:14] [INFO ] Flatten gal took : 348 ms
[2025-06-02 02:50:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 926 labels/synchronizations in 254 ms.
[2025-06-02 02:50:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8943046328387054266.gal : 47 ms
[2025-06-02 02:50:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14287923735020714548.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/ReachabilityCardinality8943046328387054266.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14287923735020714548.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/ReachabilityCardinality14287923735020714548.prop.
Parikh walk visited 0 properties in 30001 ms.
Support contains 8 out of 473 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 1332/1332 transitions.
Applied a total of 0 rules in 91 ms. Remains 473 /473 variables (removed 0) and now considering 1332/1332 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 473/473 places, 1332/1332 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 1332/1332 transitions.
Applied a total of 0 rules in 87 ms. Remains 473 /473 variables (removed 0) and now considering 1332/1332 (removed 0) transitions.
[2025-06-02 02:50:17] [INFO ] Flow matrix only has 772 transitions (discarded 560 similar events)
[2025-06-02 02:50:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:50:18] [INFO ] Implicit Places using invariants in 900 ms returned []
[2025-06-02 02:50:18] [INFO ] Flow matrix only has 772 transitions (discarded 560 similar events)
[2025-06-02 02:50:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:50:19] [INFO ] State equation strengthened by 95 read => feed constraints.
[2025-06-02 02:50:35] [INFO ] Implicit Places using invariants and state equation in 17077 ms returned []
Implicit Place search using SMT with State Equation took 17999 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:50:36] [INFO ] Redundant transitions in 254 ms returned []
Running 1330 sub problems to find dead transitions.
[2025-06-02 02:50:36] [INFO ] Flow matrix only has 772 transitions (discarded 560 similar events)
[2025-06-02 02:50:36] [INFO ] Invariant cache hit.
[2025-06-02 02:50:36] [INFO ] State equation strengthened by 95 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1330 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:50:54] [INFO ] Deduced a trap composed of 131 places in 312 ms of which 13 ms to minimize.
Detected timeout of ITS tools.
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 473/1245 variables, and 4 constraints, problems are : Problem set: 0 solved, 1330 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/473 constraints, ReadFeed: 0/95 constraints, PredecessorRefiner: 1330/1330 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1330 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1330 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 473/1245 variables, and 4 constraints, problems are : Problem set: 0 solved, 1330 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/473 constraints, ReadFeed: 0/95 constraints, PredecessorRefiner: 0/1330 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63311ms problems are : Problem set: 0 solved, 1330 unsolved
Search for dead transitions found 0 dead transitions in 63318ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81677 ms. Remains : 473/473 places, 1332/1332 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[642, 190, 258, 565, 11, 508, 351, 3, 208] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-c004-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 02:51:39] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
// Phase 1: matrix 777 rows 476 cols
[2025-06-02 02:51:39] [INFO ] Computed 3 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 46 ms. (212 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 02:51:39] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
[2025-06-02 02:51:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 02:51:39] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:51:39] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2025-06-02 02:51:39] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-02 02:51:39] [INFO ] [Real]Added 98 Read/Feed constraints in 54 ms returned sat
[2025-06-02 02:51:40] [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 02:51:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:51:40] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2025-06-02 02:51:40] [INFO ] [Nat]Added 98 Read/Feed constraints in 52 ms returned sat
[2025-06-02 02:51:40] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 138 ms.
[2025-06-02 02:51:40] [INFO ] Added : 1 causal constraints over 1 iterations in 334 ms. Result :sat
Minimization took 402 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 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 1337/1337 transitions.
Graph (complete) has 2296 edges and 476 vertex of which 473 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 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 473 transition count 1332
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 13 place count 466 transition count 1318
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 466 transition count 1318
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 459 transition count 1302
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 459 transition count 1302
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 452 transition count 1282
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 452 transition count 1282
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 446 transition count 1270
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 446 transition count 1270
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 440 transition count 1258
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 440 transition count 1258
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 434 transition count 1246
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 434 transition count 1246
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 429 transition count 1236
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 429 transition count 1236
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 424 transition count 1224
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 424 transition count 1224
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 108 place count 420 transition count 1216
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 420 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 419 transition count 1214
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 419 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 418 transition count 1212
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 418 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 417 transition count 1210
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 417 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 416 transition count 1208
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 416 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 415 transition count 1206
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 415 transition count 1206
Applied a total of 122 rules in 225 ms. Remains 415 /476 variables (removed 61) and now considering 1206/1337 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 415/476 places, 1206/1337 transitions.
[2025-06-02 02:51:41] [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 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 02:51:42] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2025-06-02 02:51:42] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3695 ms. (270 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 813 ms. (1228 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 02:51:46] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 02:51:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:51:46] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:51:47] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2025-06-02 02:51:47] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-02 02:51:47] [INFO ] [Real]Added 74 Read/Feed constraints in 61 ms returned sat
[2025-06-02 02:51: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 02:51:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 37 ms returned sat
[2025-06-02 02:51:47] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2025-06-02 02:51:47] [INFO ] [Nat]Added 74 Read/Feed constraints in 42 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:51:48] [INFO ] Deduced a trap composed of 70 places in 509 ms of which 36 ms to minimize.
[2025-06-02 02:51:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 561 ms
[2025-06-02 02:51:48] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 97 ms.
[2025-06-02 02:51:48] [INFO ] Added : 5 causal constraints over 2 iterations in 269 ms. Result :sat
Minimization took 353 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 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 54 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 54 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 54 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-02 02:51:49] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 02:51:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:51:49] [INFO ] Implicit Places using invariants in 540 ms returned []
[2025-06-02 02:51:49] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 02:51:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:51:50] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-02 02:51:52] [INFO ] Implicit Places using invariants and state equation in 2295 ms returned []
Implicit Place search using SMT with State Equation took 2883 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:51:52] [INFO ] Redundant transitions in 30 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-02 02:51:52] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 02:51:52] [INFO ] Invariant cache hit.
[2025-06-02 02:51:52] [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 02:52:07] [INFO ] Deduced a trap composed of 131 places in 317 ms of which 10 ms to minimize.
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 Real 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: 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 62316ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 62321ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65306 ms. Remains : 415/415 places, 1206/1206 transitions.
[2025-06-02 02:52:54] [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 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 02:52:55] [INFO ] Flatten gal took : 66 ms
RANDOM walk for 40003 steps (8 resets) in 276 ms. (144 steps per ms) remains 1/1 properties
[2025-06-02 02:52:55] [INFO ] Flatten gal took : 90 ms
[2025-06-02 02:52:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1124631793876002934.gal : 27 ms
[2025-06-02 02:52:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12255612228179563826.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/ReachabilityCardinality1124631793876002934.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12255612228179563826.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 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 ...329
Loading property file /tmp/ReachabilityCardinality12255612228179563826.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 1862
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1862 after 695653
Interrupted probabilistic random walk after 288814 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 1
Probabilistic random walk after 288814 steps, saw 177110 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2025-06-02 02:52:58] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2025-06-02 02:52:58] [INFO ] Invariant cache hit.
[2025-06-02 02:52:58] [INFO ] State equation strengthened by 74 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/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
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 938 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 904 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 1871ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 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 59 ms. Remains : 415/415 places, 1206/1206 transitions.
RANDOM walk for 40002 steps (8 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 24204 steps (5 resets) in 40 ms. (590 steps per ms) remains 0/1 properties
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:[0] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-01 in 80913 ms.
Starting property specific reduction for FunctionPointer-PT-c004-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 02:53:00] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
// Phase 1: matrix 777 rows 476 cols
[2025-06-02 02:53:00] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10005 steps (2 resets) in 46 ms. (212 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 02:53:00] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
[2025-06-02 02:53:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 02:53:00] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:53:00] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2025-06-02 02:53:00] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-02 02:53:00] [INFO ] [Real]Added 98 Read/Feed constraints in 60 ms returned sat
[2025-06-02 02:53:00] [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 02:53:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:53:01] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2025-06-02 02:53:01] [INFO ] [Nat]Added 98 Read/Feed constraints in 57 ms returned sat
[2025-06-02 02:53:01] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 117 ms.
[2025-06-02 02:53:01] [INFO ] Added : 2 causal constraints over 1 iterations in 244 ms. Result :sat
Minimization took 370 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 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 1337/1337 transitions.
Graph (complete) has 2296 edges and 476 vertex of which 473 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 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 473 transition count 1332
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 13 place count 466 transition count 1318
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 466 transition count 1318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 466 transition count 1316
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 459 transition count 1300
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 459 transition count 1300
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 42 place count 453 transition count 1284
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 453 transition count 1284
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 448 transition count 1274
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 448 transition count 1274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 443 transition count 1264
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 443 transition count 1264
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 438 transition count 1254
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 438 transition count 1254
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 82 place count 434 transition count 1246
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 434 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 430 transition count 1236
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 430 transition count 1236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 97 place count 427 transition count 1230
Iterating global reduction 2 with 3 rules applied. Total rules applied 100 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 426 transition count 1228
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 425 transition count 1226
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 424 transition count 1224
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 423 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 422 transition count 1220
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 422 transition count 1220
Applied a total of 110 rules in 270 ms. Remains 422 /476 variables (removed 54) and now considering 1220/1337 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 422/476 places, 1220/1337 transitions.
[2025-06-02 02:53:02] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 02:53:02] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2025-06-02 02:53:02] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 4023 ms. (248 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 972 ms. (1027 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 02:53:07] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-02 02:53:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:53:07] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:53:08] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2025-06-02 02:53:08] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 02:53:08] [INFO ] [Real]Added 75 Read/Feed constraints in 44 ms returned sat
[2025-06-02 02:53: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 02:53:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:53:08] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2025-06-02 02:53:08] [INFO ] [Nat]Added 75 Read/Feed constraints in 58 ms returned sat
[2025-06-02 02:53:08] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 120 ms.
[2025-06-02 02:53:09] [INFO ] Added : 10 causal constraints over 3 iterations in 369 ms. Result :sat
Minimization took 384 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 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 82 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 66 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2025-06-02 02:53:09] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-02 02:53:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:53:10] [INFO ] Implicit Places using invariants in 717 ms returned []
[2025-06-02 02:53:10] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-02 02:53:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:53:10] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 02:53:13] [INFO ] Implicit Places using invariants and state equation in 2755 ms returned []
Implicit Place search using SMT with State Equation took 3478 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:53:13] [INFO ] Redundant transitions in 31 ms returned []
Running 1218 sub problems to find dead transitions.
[2025-06-02 02:53:13] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-02 02:53:13] [INFO ] Invariant cache hit.
[2025-06-02 02:53:13] [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/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:53:30] [INFO ] Deduced a trap composed of 131 places in 341 ms of which 10 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/1111 variables, and 4 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/422 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 62550ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 62554ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66136 ms. Remains : 422/422 places, 1220/1220 transitions.
[2025-06-02 02:54:15] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-02 02:54:16] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-02 02:54:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3980 ms. (251 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 852 ms. (1172 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-02 02:54:21] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-02 02:54:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:54:21] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:54:21] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2025-06-02 02:54:21] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 02:54:21] [INFO ] [Real]Added 75 Read/Feed constraints in 45 ms returned sat
[2025-06-02 02:54:21] [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 02:54:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:54:21] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2025-06-02 02:54:22] [INFO ] [Nat]Added 75 Read/Feed constraints in 38 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:22] [INFO ] Deduced a trap composed of 70 places in 443 ms of which 34 ms to minimize.
[2025-06-02 02:54:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 519 ms
[2025-06-02 02:54:22] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 100 ms.
[2025-06-02 02:54:22] [INFO ] Added : 8 causal constraints over 3 iterations in 393 ms. Result :sat
Minimization took 397 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 62 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 57 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2025-06-02 02:54:23] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-02 02:54:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:54:24] [INFO ] Implicit Places using invariants in 590 ms returned []
[2025-06-02 02:54:24] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-02 02:54:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:54:24] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 02:54:26] [INFO ] Implicit Places using invariants and state equation in 2624 ms returned []
Implicit Place search using SMT with State Equation took 3231 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:54:26] [INFO ] Redundant transitions in 31 ms returned []
Running 1218 sub problems to find dead transitions.
[2025-06-02 02:54:26] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-02 02:54:26] [INFO ] Invariant cache hit.
[2025-06-02 02:54: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/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:54:42] [INFO ] Deduced a trap composed of 131 places in 306 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 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 422/1111 variables, and 4 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/422 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 62519ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 62523ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65851 ms. Remains : 422/422 places, 1220/1220 transitions.
[2025-06-02 02:55:29] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-02 02:55:29] [INFO ] Flatten gal took : 43 ms
RANDOM walk for 36839 steps (8 resets) in 269 ms. (136 steps per ms) remains 0/1 properties
[2025-06-02 02:55:29] [INFO ] Flatten gal took : 58 ms
[2025-06-02 02:55:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9806947078878694873.gal : 11 ms
[2025-06-02 02:55:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9019769075127575192.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/ReachabilityCardinality9806947078878694873.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9019769075127575192.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
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
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-02 in 149540 ms.
Starting property specific reduction for FunctionPointer-PT-c004-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 02:55:29] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
// Phase 1: matrix 777 rows 476 cols
[2025-06-02 02:55:29] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 56 ms. (175 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[+inf]
[2025-06-02 02:55:29] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
[2025-06-02 02:55:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 02:55:30] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:55:30] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2025-06-02 02:55:30] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-02 02:55:30] [INFO ] [Real]Added 98 Read/Feed constraints in 55 ms returned sat
[2025-06-02 02:55:30] [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 02:55:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:55:30] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2025-06-02 02:55:31] [INFO ] [Nat]Added 98 Read/Feed constraints in 48 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:31] [INFO ] Deduced a trap composed of 77 places in 537 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:32] [INFO ] Deduced a trap composed of 84 places in 572 ms of which 61 ms to minimize.
[2025-06-02 02:55:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1237 ms
[2025-06-02 02:55:32] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 111 ms.
[2025-06-02 02:55:32] [INFO ] Added : 3 causal constraints over 1 iterations in 228 ms. Result :sat
Minimization took 413 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[+inf]
Support contains 1 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 1337/1337 transitions.
Graph (complete) has 2296 edges and 476 vertex of which 473 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 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 473 transition count 1332
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 13 place count 466 transition count 1318
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 466 transition count 1318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 466 transition count 1316
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 459 transition count 1300
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 459 transition count 1300
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 42 place count 453 transition count 1282
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 453 transition count 1282
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 448 transition count 1272
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 448 transition count 1272
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 443 transition count 1262
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 443 transition count 1262
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 438 transition count 1252
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 438 transition count 1252
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 82 place count 434 transition count 1244
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 434 transition count 1244
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 430 transition count 1236
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 430 transition count 1236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 97 place count 427 transition count 1230
Iterating global reduction 2 with 3 rules applied. Total rules applied 100 place count 427 transition count 1230
Applied a total of 100 rules in 172 ms. Remains 427 /476 variables (removed 49) and now considering 1230/1337 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 427/476 places, 1230/1337 transitions.
[2025-06-02 02:55:33] [INFO ] Flow matrix only has 696 transitions (discarded 534 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {239=1, 336=1, 536=1, 691=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 349=1, 677=1, 695=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
[2025-06-02 02:55:33] [INFO ] Flow matrix only has 696 transitions (discarded 534 similar events)
// Phase 1: matrix 696 rows 427 cols
[2025-06-02 02:55:33] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3782 ms. (264 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 854 ms. (1169 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[+inf]
[2025-06-02 02:55:38] [INFO ] Flow matrix only has 696 transitions (discarded 534 similar events)
[2025-06-02 02:55:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:55:38] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 02:55:38] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2025-06-02 02:55:38] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-06-02 02:55:38] [INFO ] [Real]Added 76 Read/Feed constraints in 49 ms returned sat
[2025-06-02 02:55:38] [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 02:55:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:55:39] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2025-06-02 02:55:39] [INFO ] [Nat]Added 76 Read/Feed constraints in 90 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:39] [INFO ] Deduced a trap composed of 70 places in 445 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:55:40] [INFO ] Deduced a trap composed of 77 places in 485 ms of which 47 ms to minimize.
[2025-06-02 02:55:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1025 ms
[2025-06-02 02:55:40] [INFO ] Computed and/alt/rep : 341/1264/334 causal constraints (skipped 360 transitions) in 98 ms.
[2025-06-02 02:55:40] [INFO ] Added : 25 causal constraints over 6 iterations in 502 ms. Result :sat
Minimization took 514 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[+inf]
Support contains 1 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 1230/1230 transitions.
Applied a total of 0 rules in 55 ms. Remains 427 /427 variables (removed 0) and now considering 1230/1230 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 427/427 places, 1230/1230 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 1230/1230 transitions.
Applied a total of 0 rules in 57 ms. Remains 427 /427 variables (removed 0) and now considering 1230/1230 (removed 0) transitions.
[2025-06-02 02:55:41] [INFO ] Flow matrix only has 696 transitions (discarded 534 similar events)
[2025-06-02 02:55:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:55:41] [INFO ] Implicit Places using invariants in 666 ms returned []
[2025-06-02 02:55:41] [INFO ] Flow matrix only has 696 transitions (discarded 534 similar events)
[2025-06-02 02:55:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:55:42] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-06-02 02:55:44] [INFO ] Implicit Places using invariants and state equation in 2828 ms returned []
Implicit Place search using SMT with State Equation took 3496 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:55:44] [INFO ] Redundant transitions in 30 ms returned []
Running 1228 sub problems to find dead transitions.
[2025-06-02 02:55:44] [INFO ] Flow matrix only has 696 transitions (discarded 534 similar events)
[2025-06-02 02:55:44] [INFO ] Invariant cache hit.
[2025-06-02 02:55:44] [INFO ] State equation strengthened by 76 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:00] [INFO ] Deduced a trap composed of 131 places in 324 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 427/1123 variables, and 4 constraints, problems are : Problem set: 0 solved, 1228 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/427 constraints, ReadFeed: 0/76 constraints, PredecessorRefiner: 1228/1228 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1228 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1228 unsolved
At refinement iteration 3 (OVERLAPS) 696/1123 variables, 427/431 constraints. Problems are: Problem set: 0 solved, 1228 unsolved
SMT process timed out in 62449ms, After SMT, problems are : Problem set: 0 solved, 1228 unsolved
Search for dead transitions found 0 dead transitions in 62453ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66046 ms. Remains : 427/427 places, 1230/1230 transitions.
[2025-06-02 02:56:47] [INFO ] Flow matrix only has 696 transitions (discarded 534 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {239=1, 336=1, 536=1, 691=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 349=1, 677=1, 695=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
[2025-06-02 02:56:47] [INFO ] Flatten gal took : 106 ms
RANDOM walk for 40005 steps (8 resets) in 428 ms. (93 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
[2025-06-02 02:56:47] [INFO ] Flatten gal took : 66 ms
[2025-06-02 02:56:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8856578321517814700.gal : 8 ms
[2025-06-02 02:56:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11360839223517309299.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/ReachabilityCardinality8856578321517814700.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11360839223517309299.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/ReachabilityCardinality11360839223517309299.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 1842
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1842 after 663718
Interrupted probabilistic random walk after 335848 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 335848 steps, saw 205948 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2025-06-02 02:56:50] [INFO ] Flow matrix only has 696 transitions (discarded 534 similar events)
[2025-06-02 02:56:50] [INFO ] Invariant cache hit.
[2025-06-02 02:56:50] [INFO ] State equation strengthened by 76 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/355 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 7/362 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 606/968 variables, 337/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/968 variables, 74/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/968 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1030 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1030 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 74/1104 variables, 69/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1104 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/1116 variables, 6/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1116 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/1123 variables, 5/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1123 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1123 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1123/1123 variables, and 506 constraints, problems are : Problem set: 0 solved, 1 unsolved in 666 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 427/427 constraints, ReadFeed: 76/76 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/355 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/362 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 606/968 variables, 337/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/968 variables, 74/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/968 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1030 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1030 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 74/1104 variables, 69/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1104 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/1116 variables, 6/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1116 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/1123 variables, 5/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1123 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1123 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1123/1123 variables, and 507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 427/427 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1371ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 1230/1230 transitions.
Applied a total of 0 rules in 56 ms. Remains 427 /427 variables (removed 0) and now considering 1230/1230 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 427/427 places, 1230/1230 transitions.
RANDOM walk for 34317 steps (7 resets) in 189 ms. (180 steps per ms) remains 0/1 properties
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:[7] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-03 in 82532 ms.
Starting property specific reduction for FunctionPointer-PT-c004-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 02:56:52] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
// Phase 1: matrix 777 rows 476 cols
[2025-06-02 02:56:52] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10002 steps (2 resets) in 48 ms. (204 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:[14] Max Struct:[+inf]
[2025-06-02 02:56:52] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
[2025-06-02 02:56:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 02:56:52] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:56:52] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2025-06-02 02:56:52] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-02 02:56:52] [INFO ] [Real]Added 98 Read/Feed constraints in 55 ms returned sat
[2025-06-02 02:56: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 02:56:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:56:53] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2025-06-02 02:56:53] [INFO ] [Nat]Added 98 Read/Feed constraints in 99 ms returned sat
[2025-06-02 02:56:53] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 113 ms.
[2025-06-02 02:56:53] [INFO ] Added : 1 causal constraints over 1 iterations in 226 ms. Result :sat
Minimization took 384 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[14] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14] Max Struct:[+inf]
Support contains 1 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 1337/1337 transitions.
Graph (complete) has 2296 edges and 476 vertex of which 473 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 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 473 transition count 1332
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 13 place count 466 transition count 1318
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 466 transition count 1318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 466 transition count 1316
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 459 transition count 1300
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 459 transition count 1300
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 42 place count 453 transition count 1282
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 453 transition count 1282
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 447 transition count 1270
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 447 transition count 1270
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 441 transition count 1258
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 441 transition count 1258
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 435 transition count 1246
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 435 transition count 1246
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 430 transition count 1236
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 430 transition count 1236
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 99 place count 425 transition count 1224
Iterating global reduction 2 with 5 rules applied. Total rules applied 104 place count 425 transition count 1224
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 108 place count 421 transition count 1216
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 421 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 420 transition count 1214
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 420 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 419 transition count 1212
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 419 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 418 transition count 1210
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 418 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 417 transition count 1208
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 417 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 416 transition count 1206
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 416 transition count 1206
Applied a total of 122 rules in 217 ms. Remains 416 /476 variables (removed 60) and now considering 1206/1337 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 416/476 places, 1206/1337 transitions.
[2025-06-02 02:56:54] [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 {253=1, 340=1, 666=1, 679=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {233=1, 320=1, 646=1, 679=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[14] Max Struct:[+inf]
[2025-06-02 02:56:54] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2025-06-02 02:56:54] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[14] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 3700 ms. (270 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 866 ms. (1153 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14] Max Struct:[+inf]
[2025-06-02 02:56:59] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-02 02:56:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 02:56:59] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 02:56:59] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2025-06-02 02:56:59] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-02 02:56:59] [INFO ] [Real]Added 74 Read/Feed constraints in 31 ms returned sat
[2025-06-02 02:56: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 02:56:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:57:00] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2025-06-02 02:57:00] [INFO ] [Nat]Added 74 Read/Feed constraints in 32 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:57:00] [INFO ] Deduced a trap composed of 70 places in 482 ms of which 50 ms to minimize.
[2025-06-02 02:57:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 540 ms
[2025-06-02 02:57:00] [INFO ] Computed and/alt/rep : 330/1240/330 causal constraints (skipped 349 transitions) in 107 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:57:01] [INFO ] Deduced a trap composed of 70 places in 467 ms of which 36 ms to minimize.
[2025-06-02 02:57:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 532 ms
[2025-06-02 02:57:01] [INFO ] Added : 5 causal constraints over 2 iterations in 857 ms. Result :sat
Minimization took 351 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[14] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14] 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 59 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 59 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 59 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-02 02:57:02] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-02 02:57:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:57:02] [INFO ] Implicit Places using invariants in 661 ms returned []
[2025-06-02 02:57:02] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-02 02:57:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:57:03] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-06-02 02:57:05] [INFO ] Implicit Places using invariants and state equation in 2377 ms returned []
Implicit Place search using SMT with State Equation took 3042 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:57:05] [INFO ] Redundant transitions in 29 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-02 02:57:05] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-02 02:57:05] [INFO ] Invariant cache hit.
[2025-06-02 02:57:05] [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/416 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 02:57:20] [INFO ] Deduced a trap composed of 131 places in 303 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/1097 variables, and 4 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/416 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/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 681/1097 variables, 416/420 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 62337ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 62339ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65480 ms. Remains : 416/416 places, 1206/1206 transitions.
[2025-06-02 02:58:07] [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 {253=1, 340=1, 666=1, 679=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {233=1, 320=1, 646=1, 679=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[14] Max Struct:[+inf]
[2025-06-02 02:58:08] [INFO ] Flatten gal took : 81 ms
RANDOM walk for 40003 steps (8 resets) in 324 ms. (123 steps per ms) remains 1/1 properties
[2025-06-02 02:58:08] [INFO ] Flatten gal took : 59 ms
[2025-06-02 02:58:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10462394820093015052.gal : 22 ms
[2025-06-02 02:58:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16251164094164168262.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/ReachabilityCardinality10462394820093015052.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16251164094164168262.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 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality16251164094164168262.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 1862
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1862 after 695653
Interrupted probabilistic random walk after 355185 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 1
Probabilistic random walk after 355185 steps, saw 217804 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
[2025-06-02 02:58:11] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-02 02:58:11] [INFO ] Invariant cache hit.
[2025-06-02 02:58:11] [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) 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) 346/350 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/355 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 3/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) 598/953 variables, 332/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/953 variables, 73/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/953 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 62/1015 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1015 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/1083 variables, 66/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1083 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1091 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1091 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1097 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (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 529 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 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) 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) 346/350 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/355 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 3/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) 598/953 variables, 332/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/953 variables, 73/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/953 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1015 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1015 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/1083 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1083 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/1091 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1091 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1097 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1097 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 670 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1210ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 79 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 56 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 58 ms. Remains : 416/416 places, 1206/1206 transitions.
RANDOM walk for 40000 steps (8 resets) in 318 ms. (125 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :695653 after 6.64141e+07
Interrupted probabilistic random walk after 331975 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 331975 steps, saw 203572 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
[2025-06-02 02:58:15] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-02 02:58:15] [INFO ] Invariant cache hit.
[2025-06-02 02:58:15] [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) 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) 346/350 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/355 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 3/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) 598/953 variables, 332/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/953 variables, 73/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/953 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 62/1015 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1015 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/1083 variables, 66/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1083 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1091 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1091 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1097 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (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 536 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 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) 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) 346/350 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/355 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 3/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) 598/953 variables, 332/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/953 variables, 73/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/953 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1015 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1015 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/1083 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1083 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/1091 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1091 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1097 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1097 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 698 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1244ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 90 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 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 57 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2025-06-02 02:58:17] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-02 02:58:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6.64141e+07 after 2.25041e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.25041e+08 after 2.6536e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.6536e+08 after 3.64167e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.64167e+08 after 4.55773e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.55773e+08 after 6.01677e+08
[2025-06-02 02:58:17] [INFO ] Implicit Places using invariants in 665 ms returned []
[2025-06-02 02:58:17] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-02 02:58:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:58:18] [INFO ] State equation strengthened by 74 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6.01677e+08 after 1.25831e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.25831e+09 after 1.32284e+09
[2025-06-02 02:58:20] [INFO ] Implicit Places using invariants and state equation in 2428 ms returned []
Implicit Place search using SMT with State Equation took 3095 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:58:20] [INFO ] Redundant transitions in 30 ms returned []
Running 1204 sub problems to find dead transitions.
[2025-06-02 02:58:20] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2025-06-02 02:58:20] [INFO ] Invariant cache hit.
[2025-06-02 02:58:20] [INFO ] State equation strengthened by 74 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.32284e+09 after 1.53264e+09
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.53264e+09 after 1.9636e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.9636e+09 after 2.83027e+09
At refinement iteration 0 (INCLUDED_ONLY) 0/416 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 02:58:35] [INFO ] Deduced a trap composed of 131 places in 342 ms of which 9 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.83027e+09 after 4.58231e+09
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/1097 variables, and 4 constraints, problems are : Problem set: 0 solved, 1204 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/416 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/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Detected timeout of ITS tools.
[2025-06-02 02:58:58] [INFO ] Flatten gal took : 32 ms
[2025-06-02 02:58:58] [INFO ] Applying decomposition
[2025-06-02 02:58:58] [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/graph6234689801887022492.txt' '-o' '/tmp/graph6234689801887022492.bin' '-w' '/tmp/graph6234689801887022492.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6234689801887022492.bin' '-l' '-1' '-v' '-w' '/tmp/graph6234689801887022492.weights' '-q' '0' '-e' '0.001'
[2025-06-02 02:58:58] [INFO ] Decomposing Gal with order
[2025-06-02 02:58:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 02:58:58] [INFO ] Removed a total of 2061 redundant transitions.
[2025-06-02 02:58:58] [INFO ] Flatten gal took : 79 ms
[2025-06-02 02:58:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 851 labels/synchronizations in 58 ms.
[2025-06-02 02:58:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16635161061308027053.gal : 8 ms
[2025-06-02 02:58:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4784113367625198587.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/ReachabilityCardinality16635161061308027053.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4784113367625198587.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/ReachabilityCardinality4784113367625198587.prop.
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 681/1097 variables, 416/420 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 61936ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 61938ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65129 ms. Remains : 416/416 places, 1206/1206 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 416 transition count 670
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 547 place count 405 transition count 670
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 547 place count 405 transition count 601
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 685 place count 336 transition count 601
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 939 place count 209 transition count 474
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1003 place count 145 transition count 346
Iterating global reduction 2 with 64 rules applied. Total rules applied 1067 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 1068 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 1068 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 1070 place count 144 transition count 344
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1133 place count 81 transition count 218
Iterating global reduction 3 with 63 rules applied. Total rules applied 1196 place count 81 transition count 218
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1259 place count 18 transition count 92
Iterating global reduction 3 with 63 rules applied. Total rules applied 1322 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 1385 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 1385 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 1387 place count 17 transition count 28
Applied a total of 1387 rules in 156 ms. Remains 17 /416 variables (removed 399) and now considering 28/1206 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 28 rows 17 cols
[2025-06-02 02:59:22] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 02:59:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 02:59:22] [INFO ] After 79ms 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 02:59:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-02 02:59:22] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 02:59:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 02:59:22] [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 02:59:22] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 02:59:22] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-02 02:59:22] [INFO ] Flatten gal took : 4 ms
[2025-06-02 02:59:22] [INFO ] Flatten gal took : 4 ms
[2025-06-02 02:59:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18379306800095946364.gal : 1 ms
[2025-06-02 02:59:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16324767716508064428.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/ReachabilityCardinality18379306800095946364.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16324767716508064428.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/ReachabilityCardinality16324767716508064428.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 30
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :30 after 105
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :105 after 705
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :705 after 2025
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2025 after 4625
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4625 after 9785
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9785 after 20065
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :20065 after 40585
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :40585 after 81585
Detected timeout of ITS tools.
[2025-06-02 02:59:37] [INFO ] Flatten gal took : 1 ms
[2025-06-02 02:59:37] [INFO ] Applying decomposition
[2025-06-02 02:59: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/graph6911554024900530229.txt' '-o' '/tmp/graph6911554024900530229.bin' '-w' '/tmp/graph6911554024900530229.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6911554024900530229.bin' '-l' '-1' '-v' '-w' '/tmp/graph6911554024900530229.weights' '-q' '0' '-e' '0.001'
[2025-06-02 02:59:37] [INFO ] Decomposing Gal with order
[2025-06-02 02:59:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 02:59:37] [INFO ] Removed a total of 26 redundant transitions.
[2025-06-02 02:59:37] [INFO ] Flatten gal took : 3 ms
[2025-06-02 02:59:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2025-06-02 02:59:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1927143741749337823.gal : 1 ms
[2025-06-02 02:59:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3564184143998128218.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/ReachabilityCardinality1927143741749337823.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3564184143998128218.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/ReachabilityCardinality3564184143998128218.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 30
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30503 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[14] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-04 in 180486 ms.
Starting property specific reduction for FunctionPointer-PT-c004-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 02:59:52] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
// Phase 1: matrix 777 rows 476 cols
[2025-06-02 02:59:52] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 46 ms. (212 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 02:59:52] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
[2025-06-02 02:59:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 02:59:53] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 02:59:53] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2025-06-02 02:59:53] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-02 02:59:53] [INFO ] [Real]Added 98 Read/Feed constraints in 56 ms returned sat
[2025-06-02 02:59:53] [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 02:59:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 02:59:53] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2025-06-02 02:59:53] [INFO ] [Nat]Added 98 Read/Feed constraints in 53 ms returned sat
[2025-06-02 02:59:54] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 114 ms.
[2025-06-02 02:59:54] [INFO ] Added : 2 causal constraints over 1 iterations in 231 ms. Result :sat
Minimization took 384 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 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 1337/1337 transitions.
Graph (complete) has 2296 edges and 476 vertex of which 473 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 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 473 transition count 1332
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 13 place count 466 transition count 1318
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 466 transition count 1318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 466 transition count 1316
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 459 transition count 1300
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 459 transition count 1300
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 42 place count 453 transition count 1284
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 453 transition count 1284
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 448 transition count 1274
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 448 transition count 1274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 443 transition count 1264
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 443 transition count 1264
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 438 transition count 1254
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 438 transition count 1254
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 82 place count 434 transition count 1246
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 434 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 430 transition count 1236
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 430 transition count 1236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 97 place count 427 transition count 1230
Iterating global reduction 2 with 3 rules applied. Total rules applied 100 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 426 transition count 1228
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 425 transition count 1226
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 424 transition count 1224
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 423 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 422 transition count 1220
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 422 transition count 1220
Applied a total of 110 rules in 464 ms. Remains 422 /476 variables (removed 54) and now considering 1220/1337 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 465 ms. Remains : 422/476 places, 1220/1337 transitions.
[2025-06-02 02:59:55] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-02 02:59:55] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2025-06-02 02:59:55] [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 4036 ms. (247 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1017 ms. (982 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-02 03:00:00] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-02 03:00:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 03:00:01] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 03:00:01] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2025-06-02 03:00:01] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 03:00:01] [INFO ] [Real]Added 75 Read/Feed constraints in 38 ms returned sat
[2025-06-02 03:00: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 03:00:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 03:00:01] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2025-06-02 03:00: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 03:00:02] [INFO ] Deduced a trap composed of 70 places in 441 ms of which 33 ms to minimize.
[2025-06-02 03:00:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 504 ms
[2025-06-02 03:00:02] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 140 ms.
[2025-06-02 03:00:02] [INFO ] Added : 10 causal constraints over 3 iterations in 393 ms. Result :sat
Minimization took 354 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 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 110 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 85 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2025-06-02 03:00:03] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-02 03:00:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:00:04] [INFO ] Implicit Places using invariants in 880 ms returned []
[2025-06-02 03:00:04] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-02 03:00:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:00:04] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 03:00:06] [INFO ] Implicit Places using invariants and state equation in 2558 ms returned []
Implicit Place search using SMT with State Equation took 3476 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:00:06] [INFO ] Redundant transitions in 30 ms returned []
Running 1218 sub problems to find dead transitions.
[2025-06-02 03:00:06] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-02 03:00:06] [INFO ] Invariant cache hit.
[2025-06-02 03:00: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/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:00:23] [INFO ] Deduced a trap composed of 131 places in 348 ms of which 10 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/1111 variables, and 4 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/422 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 62778ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 62781ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66392 ms. Remains : 422/422 places, 1220/1220 transitions.
[2025-06-02 03:01:09] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-02 03:01:10] [INFO ] Flatten gal took : 65 ms
[2025-06-02 03:01:10] [INFO ] Flatten gal took : 49 ms
[2025-06-02 03:01:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8507671029939559459.gal : 7 ms
[2025-06-02 03:01:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15090848021073779008.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/ReachabilityCardinality8507671029939559459.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15090848021073779008.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40005 steps (8 resets) in 327 ms. (121 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 ...329
BEST_FIRST walk for 35961 steps (7 resets) in 68 ms. (521 steps per ms) remains 0/1 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-06 in 77356 ms.
Starting property specific reduction for FunctionPointer-PT-c004-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 03:01:10] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
// Phase 1: matrix 777 rows 476 cols
[2025-06-02 03:01:10] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10004 steps (2 resets) in 92 ms. (107 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 27 ms. (357 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 03:01:10] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
[2025-06-02 03:01:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 03:01:10] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 03:01:10] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2025-06-02 03:01:10] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-02 03:01:10] [INFO ] [Real]Added 98 Read/Feed constraints in 87 ms returned sat
[2025-06-02 03:01:10] [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 03:01:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 03:01:11] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2025-06-02 03:01:11] [INFO ] [Nat]Added 98 Read/Feed constraints in 57 ms returned sat
[2025-06-02 03:01:11] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 114 ms.
[2025-06-02 03:01:11] [INFO ] Added : 2 causal constraints over 1 iterations in 234 ms. Result :sat
Minimization took 405 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 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 1337/1337 transitions.
Graph (complete) has 2296 edges and 476 vertex of which 473 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 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 473 transition count 1332
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 13 place count 466 transition count 1318
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 466 transition count 1318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 466 transition count 1316
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 459 transition count 1302
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 459 transition count 1302
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 42 place count 453 transition count 1284
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 453 transition count 1284
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 448 transition count 1274
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 448 transition count 1274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 443 transition count 1264
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 443 transition count 1264
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 438 transition count 1254
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 438 transition count 1254
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 82 place count 434 transition count 1246
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 434 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 430 transition count 1236
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 430 transition count 1236
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 426 transition count 1228
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 425 transition count 1226
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 424 transition count 1224
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 423 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 422 transition count 1220
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 421 transition count 1218
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 421 transition count 1218
Applied a total of 112 rules in 297 ms. Remains 421 /476 variables (removed 55) and now considering 1218/1337 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 421/476 places, 1218/1337 transitions.
[2025-06-02 03:01:12] [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 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 03:01:12] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2025-06-02 03:01:12] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3906 ms. (255 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 861 ms. (1160 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 03:01:17] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 03:01:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 03:01:17] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 03:01:17] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2025-06-02 03:01:17] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 03:01:18] [INFO ] [Real]Added 75 Read/Feed constraints in 42 ms returned sat
[2025-06-02 03:01: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 03:01:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 03:01:18] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2025-06-02 03:01:18] [INFO ] [Nat]Added 75 Read/Feed constraints in 40 ms returned sat
[2025-06-02 03:01:18] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 105 ms.
[2025-06-02 03:01:18] [INFO ] Added : 12 causal constraints over 5 iterations in 383 ms. Result :sat
Minimization took 353 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:[1] 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 55 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 55 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 53 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2025-06-02 03:01:19] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 03:01:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:01:20] [INFO ] Implicit Places using invariants in 630 ms returned []
[2025-06-02 03:01:20] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 03:01:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:01:20] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 03:01:22] [INFO ] Implicit Places using invariants and state equation in 2273 ms returned []
Implicit Place search using SMT with State Equation took 2937 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:01:22] [INFO ] Redundant transitions in 30 ms returned []
Running 1216 sub problems to find dead transitions.
[2025-06-02 03:01:22] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 03:01:22] [INFO ] Invariant cache hit.
[2025-06-02 03:01: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 03:01:37] [INFO ] Deduced a trap composed of 131 places in 327 ms of which 11 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 30029 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 62169ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 62172ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65205 ms. Remains : 421/421 places, 1218/1218 transitions.
[2025-06-02 03:02: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 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-02 03:02:25] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 03:02:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 3788 ms. (263 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 861 ms. (1160 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-02 03:02:29] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 03:02:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 03:02:29] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 03:02:30] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2025-06-02 03:02:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 03:02:30] [INFO ] [Real]Added 75 Read/Feed constraints in 38 ms returned sat
[2025-06-02 03:02: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 03:02:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 03:02:30] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2025-06-02 03:02:30] [INFO ] [Nat]Added 75 Read/Feed constraints in 36 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:02:30] [INFO ] Deduced a trap composed of 70 places in 437 ms of which 32 ms to minimize.
[2025-06-02 03:02:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 514 ms
[2025-06-02 03:02:31] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 98 ms.
[2025-06-02 03:02:31] [INFO ] Added : 12 causal constraints over 4 iterations in 381 ms. Result :sat
Minimization took 364 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 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 76 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 77 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 53 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2025-06-02 03:02:32] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 03:02:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:02:32] [INFO ] Implicit Places using invariants in 560 ms returned []
[2025-06-02 03:02:32] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 03:02:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:02:32] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 03:02:34] [INFO ] Implicit Places using invariants and state equation in 2237 ms returned []
Implicit Place search using SMT with State Equation took 2839 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:02:34] [INFO ] Redundant transitions in 30 ms returned []
Running 1216 sub problems to find dead transitions.
[2025-06-02 03:02:34] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2025-06-02 03:02:34] [INFO ] Invariant cache hit.
[2025-06-02 03:02: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/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 03:02:51] [INFO ] Deduced a trap composed of 131 places in 318 ms of which 9 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 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 62671ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 62673ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65607 ms. Remains : 421/421 places, 1218/1218 transitions.
[2025-06-02 03:03:37] [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 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-02 03:03:38] [INFO ] Flatten gal took : 80 ms
[2025-06-02 03:03:38] [INFO ] Flatten gal took : 36 ms
[2025-06-02 03:03:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1457340354242533052.gal : 5 ms
[2025-06-02 03:03:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18261874507194105944.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/ReachabilityCardinality1457340354242533052.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18261874507194105944.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
RANDOM walk for 40000 steps (8 resets) in 372 ms. (107 steps per ms) remains 1/1 properties
/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 37137 steps (8 resets) in 63 ms. (580 steps per ms) remains 0/1 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-08 in 147987 ms.
Starting property specific reduction for FunctionPointer-PT-c004-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 03:03:38] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
// Phase 1: matrix 777 rows 476 cols
[2025-06-02 03:03:38] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 45 ms. (217 steps per ms)
BEST_FIRST walk for 10000 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 03:03:38] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
[2025-06-02 03:03:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 03:03:38] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 03:03:38] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2025-06-02 03:03:38] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-02 03:03:38] [INFO ] [Real]Added 98 Read/Feed constraints in 57 ms returned sat
[2025-06-02 03:03:38] [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 03:03:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 03:03:39] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2025-06-02 03:03:39] [INFO ] [Nat]Added 98 Read/Feed constraints in 91 ms returned sat
[2025-06-02 03:03:39] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 108 ms.
[2025-06-02 03:03:39] [INFO ] Added : 2 causal constraints over 1 iterations in 224 ms. Result :sat
Minimization took 381 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 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 1337/1337 transitions.
Graph (complete) has 2296 edges and 476 vertex of which 473 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 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 473 transition count 1332
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 13 place count 466 transition count 1318
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 466 transition count 1318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 466 transition count 1316
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 459 transition count 1300
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 459 transition count 1300
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 42 place count 453 transition count 1282
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 453 transition count 1282
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 448 transition count 1272
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 448 transition count 1272
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 443 transition count 1262
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 443 transition count 1262
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 438 transition count 1252
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 438 transition count 1252
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 433 transition count 1242
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 433 transition count 1242
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 93 place count 428 transition count 1230
Iterating global reduction 2 with 5 rules applied. Total rules applied 98 place count 428 transition count 1230
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 102 place count 424 transition count 1222
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 424 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 423 transition count 1220
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 423 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 422 transition count 1218
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 422 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 421 transition count 1216
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 421 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 420 transition count 1214
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 420 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 419 transition count 1212
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 419 transition count 1212
Applied a total of 116 rules in 198 ms. Remains 419 /476 variables (removed 57) and now considering 1212/1337 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 419/476 places, 1212/1337 transitions.
[2025-06-02 03:03:40] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-02 03:03:40] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
// Phase 1: matrix 685 rows 419 cols
[2025-06-02 03:03:40] [INFO ] Computed 3 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3764 ms. (265 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 824 ms. (1212 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-02 03:03:45] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2025-06-02 03:03:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 03:03:45] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 03:03:45] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2025-06-02 03:03:45] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 03:03:45] [INFO ] [Real]Added 75 Read/Feed constraints in 52 ms returned sat
[2025-06-02 03:03: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 03:03:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 03:03:46] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2025-06-02 03:03:46] [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 03:03:46] [INFO ] Deduced a trap composed of 70 places in 453 ms of which 32 ms to minimize.
[2025-06-02 03:03:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 514 ms
[2025-06-02 03:03:46] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 351 transitions) in 103 ms.
[2025-06-02 03:03:47] [INFO ] Added : 11 causal constraints over 4 iterations in 372 ms. Result :sat
Minimization took 356 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:[3] Max Struct:[+inf]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 53 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 52 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2025-06-02 03:03:47] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2025-06-02 03:03:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:03:48] [INFO ] Implicit Places using invariants in 559 ms returned []
[2025-06-02 03:03:48] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2025-06-02 03:03:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:03:48] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 03:03:50] [INFO ] Implicit Places using invariants and state equation in 2325 ms returned []
Implicit Place search using SMT with State Equation took 2913 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:03:50] [INFO ] Redundant transitions in 29 ms returned []
Running 1210 sub problems to find dead transitions.
[2025-06-02 03:03:50] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2025-06-02 03:03:50] [INFO ] Invariant cache hit.
[2025-06-02 03:03: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/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:04:06] [INFO ] Deduced a trap composed of 131 places in 312 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1104 variables, and 4 constraints, problems are : Problem set: 0 solved, 1210 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/419 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1210/1210 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1210 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 62597ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 62601ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65612 ms. Remains : 419/419 places, 1212/1212 transitions.
[2025-06-02 03:04:53] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=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 :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-02 03:04:54] [INFO ] Flatten gal took : 96 ms
[2025-06-02 03:04:54] [INFO ] Flatten gal took : 74 ms
RANDOM walk for 40010 steps (8 resets) in 656 ms. (60 steps per ms) remains 1/1 properties
[2025-06-02 03:04:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17779483600574455903.gal : 9 ms
[2025-06-02 03:04:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15021404400439917922.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/ReachabilityCardinality17779483600574455903.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15021404400439917922.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 30240 steps (6 resets) in 91 ms. (328 steps per ms) remains 0/1 properties
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:[3] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-09 in 76117 ms.
Starting property specific reduction for FunctionPointer-PT-c004-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 03:04:54] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
// Phase 1: matrix 777 rows 476 cols
[2025-06-02 03:04:54] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10003 steps (2 resets) in 71 ms. (138 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 03:04:54] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
[2025-06-02 03:04:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 03:04:54] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 03:04:54] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2025-06-02 03:04:55] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-02 03:04:55] [INFO ] [Real]Added 98 Read/Feed constraints in 64 ms returned sat
[2025-06-02 03:04:55] [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 03:04:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 03:04:55] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2025-06-02 03:04:55] [INFO ] [Nat]Added 98 Read/Feed constraints in 84 ms returned sat
[2025-06-02 03:04:56] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 175 ms.
[2025-06-02 03:04:56] [INFO ] Added : 2 causal constraints over 1 iterations in 357 ms. Result :sat
Minimization took 502 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 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 1337/1337 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 468 transition count 1321
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 468 transition count 1321
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 468 transition count 1319
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 460 transition count 1301
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 460 transition count 1301
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 453 transition count 1281
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 453 transition count 1281
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 447 transition count 1269
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 447 transition count 1269
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 441 transition count 1257
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 441 transition count 1257
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 435 transition count 1245
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 435 transition count 1245
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 430 transition count 1235
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 430 transition count 1235
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 425 transition count 1223
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 425 transition count 1223
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 108 place count 421 transition count 1215
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 421 transition count 1215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 420 transition count 1213
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 420 transition count 1213
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 419 transition count 1211
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 419 transition count 1211
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 418 transition count 1209
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 418 transition count 1209
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 417 transition count 1207
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 417 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 416 transition count 1205
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 416 transition count 1205
Applied a total of 122 rules in 319 ms. Remains 416 /476 variables (removed 60) and now considering 1205/1337 (removed 132) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 319 ms. Remains : 416/476 places, 1205/1337 transitions.
[2025-06-02 03:04:57] [INFO ] Flow matrix only has 680 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 {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 03:04:57] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2025-06-02 03:04:57] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 3929 ms. (254 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 819 ms. (1219 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 03:05:02] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-02 03:05:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 03:05:02] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 03:05:02] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2025-06-02 03:05:02] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 03:05:02] [INFO ] [Real]Added 75 Read/Feed constraints in 35 ms returned sat
[2025-06-02 03:05:02] [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 03:05:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 03:05:03] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2025-06-02 03:05:03] [INFO ] [Nat]Added 75 Read/Feed constraints in 34 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:05:03] [INFO ] Deduced a trap composed of 69 places in 543 ms of which 49 ms to minimize.
[2025-06-02 03:05:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 637 ms
[2025-06-02 03:05:04] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 139 ms.
[2025-06-02 03:05:04] [INFO ] Added : 4 causal constraints over 2 iterations in 394 ms. Result :sat
Minimization took 468 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:[1] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 72 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 78 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2025-06-02 03:05:05] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-02 03:05:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:05:05] [INFO ] Implicit Places using invariants in 758 ms returned []
[2025-06-02 03:05:05] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-02 03:05:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:05:06] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 03:05:08] [INFO ] Implicit Places using invariants and state equation in 2812 ms returned []
Implicit Place search using SMT with State Equation took 3575 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:05:08] [INFO ] Redundant transitions in 47 ms returned []
Running 1203 sub problems to find dead transitions.
[2025-06-02 03:05:08] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-02 03:05:08] [INFO ] Invariant cache hit.
[2025-06-02 03:05:08] [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, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:05:27] [INFO ] Deduced a trap composed of 131 places in 490 ms of which 14 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1203 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 416/1096 variables, and 4 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/416 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1203/1203 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 1)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 1)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/1096 variables, and 4 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/416 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 0/1203 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62580ms problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 62584ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66299 ms. Remains : 416/416 places, 1205/1205 transitions.
[2025-06-02 03:06:11] [INFO ] Flow matrix only has 680 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 {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-02 03:06:11] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-02 03:06:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 3728 ms. (268 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 841 ms. (1187 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-02 03:06:16] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-02 03:06:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 03:06:16] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 03:06:16] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2025-06-02 03:06:16] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 03:06:16] [INFO ] [Real]Added 75 Read/Feed constraints in 46 ms returned sat
[2025-06-02 03:06: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 03:06:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 03:06:17] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2025-06-02 03:06:17] [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 03:06:17] [INFO ] Deduced a trap composed of 69 places in 611 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:06:18] [INFO ] Deduced a trap composed of 69 places in 549 ms of which 54 ms to minimize.
[2025-06-02 03:06:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1280 ms
[2025-06-02 03:06:18] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 155 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:06:19] [INFO ] Deduced a trap composed of 131 places in 419 ms of which 9 ms to minimize.
[2025-06-02 03:06:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 508 ms
[2025-06-02 03:06:19] [INFO ] Added : 5 causal constraints over 2 iterations in 969 ms. Result :sat
Minimization took 411 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:[4] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 88 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 88 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2025-06-02 03:06:20] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-02 03:06:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:06:21] [INFO ] Implicit Places using invariants in 837 ms returned []
[2025-06-02 03:06:21] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-02 03:06:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:06:21] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 03:06:23] [INFO ] Implicit Places using invariants and state equation in 2665 ms returned []
Implicit Place search using SMT with State Equation took 3504 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:06:23] [INFO ] Redundant transitions in 28 ms returned []
Running 1203 sub problems to find dead transitions.
[2025-06-02 03:06:23] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-02 03:06:23] [INFO ] Invariant cache hit.
[2025-06-02 03:06: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/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:06:41] [INFO ] Deduced a trap composed of 131 places in 300 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/1096 variables, and 4 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/416 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1203/1203 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/1096 variables, and 4 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/416 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 0/1203 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61998ms problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 62000ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65633 ms. Remains : 416/416 places, 1205/1205 transitions.
[2025-06-02 03:07:25] [INFO ] Flow matrix only has 680 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 {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2025-06-02 03:07:26] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-02 03:07:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 3780 ms. (264 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 847 ms. (1179 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2025-06-02 03:07:30] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-02 03:07:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 03:07:31] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 03:07:31] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2025-06-02 03:07:31] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 03:07:31] [INFO ] [Real]Added 75 Read/Feed constraints in 30 ms returned sat
[2025-06-02 03:07:31] [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 03:07:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 03:07:31] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2025-06-02 03:07:31] [INFO ] [Nat]Added 75 Read/Feed constraints in 105 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:07:32] [INFO ] Deduced a trap composed of 69 places in 691 ms of which 85 ms to minimize.
[2025-06-02 03:07:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 772 ms
[2025-06-02 03:07:32] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 157 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:07:33] [INFO ] Deduced a trap composed of 131 places in 694 ms of which 117 ms to minimize.
[2025-06-02 03:07:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 799 ms
[2025-06-02 03:07:33] [INFO ] Added : 6 causal constraints over 2 iterations in 1228 ms. Result :sat
Minimization took 526 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 76 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 53 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2025-06-02 03:07:34] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-02 03:07:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:07:35] [INFO ] Implicit Places using invariants in 862 ms returned []
[2025-06-02 03:07:35] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-02 03:07:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:07:35] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 03:07:38] [INFO ] Implicit Places using invariants and state equation in 2546 ms returned []
Implicit Place search using SMT with State Equation took 3410 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:07:38] [INFO ] Redundant transitions in 47 ms returned []
Running 1203 sub problems to find dead transitions.
[2025-06-02 03:07:38] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-02 03:07:38] [INFO ] Invariant cache hit.
[2025-06-02 03:07: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/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:07:56] [INFO ] Deduced a trap composed of 131 places in 440 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/1096 variables, and 4 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/416 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1203/1203 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/1096 variables, and 4 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/416 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 0/1203 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62674ms problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 62677ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66198 ms. Remains : 416/416 places, 1205/1205 transitions.
[2025-06-02 03:08:40] [INFO ] Flow matrix only has 680 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 {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2025-06-02 03:08:41] [INFO ] Flatten gal took : 47 ms
RANDOM walk for 40007 steps (8 resets) in 260 ms. (153 steps per ms) remains 1/1 properties
[2025-06-02 03:08:41] [INFO ] Flatten gal took : 48 ms
[2025-06-02 03:08:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6584986507713185296.gal : 8 ms
[2025-06-02 03:08:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14050291061851988275.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/ReachabilityCardinality6584986507713185296.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14050291061851988275.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 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 ...329
Loading property file /tmp/ReachabilityCardinality14050291061851988275.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 1862
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1862 after 695653
Interrupted probabilistic random walk after 374417 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 1
Probabilistic random walk after 374417 steps, saw 229597 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
[2025-06-02 03:08:44] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-02 03:08:44] [INFO ] Invariant cache hit.
[2025-06-02 03:08:44] [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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 340/348 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1082 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/1096 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 479 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 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) 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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 340/348 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/354 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 598/952 variables, 333/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 74/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1082 variables, 66/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1090 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1090 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1096 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1096 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1096 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 647 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 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]
After SMT, in 1136ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 53 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 416/416 places, 1205/1205 transitions.
RANDOM walk for 40004 steps (8 resets) in 202 ms. (197 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 :695653 after 6.64141e+07
Interrupted probabilistic random walk after 367855 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 1
Probabilistic random walk after 367855 steps, saw 225572 distinct states, run finished after 3004 ms. (steps per millisecond=122 ) properties seen :0
[2025-06-02 03:08:48] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-02 03:08:48] [INFO ] Invariant cache hit.
[2025-06-02 03:08:48] [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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 340/348 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1082 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/1096 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 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) 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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 340/348 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/354 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 598/952 variables, 333/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 74/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1082 variables, 66/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1090 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1090 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1096 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1096 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1096 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 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]
After SMT, in 1180ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 50 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 52 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2025-06-02 03:08:50] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-02 03:08:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:08:50] [INFO ] Implicit Places using invariants in 458 ms returned []
[2025-06-02 03:08:50] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-02 03:08:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6.64141e+07 after 2.14495e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.14495e+08 after 2.32324e+08
[2025-06-02 03:08:51] [INFO ] State equation strengthened by 75 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.32324e+08 after 3.09474e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.09474e+08 after 3.11979e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.11979e+08 after 5.10945e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.10945e+08 after 5.65139e+08
[2025-06-02 03:08:53] [INFO ] Implicit Places using invariants and state equation in 2371 ms returned []
Implicit Place search using SMT with State Equation took 2831 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:08:53] [INFO ] Redundant transitions in 28 ms returned []
Running 1203 sub problems to find dead transitions.
[2025-06-02 03:08:53] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2025-06-02 03:08:53] [INFO ] Invariant cache hit.
[2025-06-02 03:08:53] [INFO ] State equation strengthened by 75 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.65139e+08 after 1.48647e+09
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.69273e+09,15.343,248232,2,10069,17,1.55983e+06,6,0,2871,194746,0
Total reachable state count : 1692730067
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,15.3488,248232,2,417,17,1.55983e+06,7,0,2874,194746,0
ITS tools runner thread asked to quit. Dying gracefully.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:09:12] [INFO ] Deduced a trap composed of 131 places in 508 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/1096 variables, and 4 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/416 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1203/1203 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/1096 variables, and 4 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/416 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 0/1203 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62185ms problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 62187ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65107 ms. Remains : 416/416 places, 1205/1205 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-10 in 300965 ms.
Starting property specific reduction for FunctionPointer-PT-c004-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 03:09:55] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
// Phase 1: matrix 777 rows 476 cols
[2025-06-02 03:09:55] [INFO ] Computed 3 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 03:09:55] [INFO ] Flow matrix only has 777 transitions (discarded 560 similar events)
[2025-06-02 03:09:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 03:09:55] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-02 03:09:55] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2025-06-02 03:09:55] [INFO ] State equation strengthened by 98 read => feed constraints.
[2025-06-02 03:09:55] [INFO ] [Real]Added 98 Read/Feed constraints in 50 ms returned sat
[2025-06-02 03:09:55] [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 03:09:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 03:09:56] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2025-06-02 03:09:56] [INFO ] [Nat]Added 98 Read/Feed constraints in 98 ms returned sat
[2025-06-02 03:09:56] [INFO ] Computed and/alt/rep : 93/98/86 causal constraints (skipped 689 transitions) in 174 ms.
[2025-06-02 03:09:57] [INFO ] Added : 2 causal constraints over 1 iterations in 337 ms. Result :sat
Minimization took 511 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 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 1337/1337 transitions.
Graph (complete) has 2296 edges and 476 vertex of which 473 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 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 473 transition count 1332
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 13 place count 466 transition count 1318
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 466 transition count 1318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 466 transition count 1316
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 459 transition count 1300
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 459 transition count 1300
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 42 place count 453 transition count 1284
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 453 transition count 1284
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 448 transition count 1274
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 448 transition count 1274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 443 transition count 1264
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 443 transition count 1264
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 438 transition count 1254
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 438 transition count 1254
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 82 place count 434 transition count 1246
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 434 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 430 transition count 1236
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 430 transition count 1236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 97 place count 427 transition count 1230
Iterating global reduction 2 with 3 rules applied. Total rules applied 100 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 426 transition count 1228
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 425 transition count 1226
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 424 transition count 1224
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 423 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 422 transition count 1220
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 422 transition count 1220
Applied a total of 110 rules in 195 ms. Remains 422 /476 variables (removed 54) and now considering 1220/1337 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 422/476 places, 1220/1337 transitions.
[2025-06-02 03:09:57] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 03:09:58] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2025-06-02 03:09:58] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 3751 ms. (266 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 806 ms. (1239 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 03:10:02] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-02 03:10:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 03:10:03] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2025-06-02 03:10:03] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2025-06-02 03:10:03] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 03:10:03] [INFO ] [Real]Added 75 Read/Feed constraints in 48 ms returned sat
[2025-06-02 03:10: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 03:10:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-02 03:10:03] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2025-06-02 03:10:04] [INFO ] [Nat]Added 75 Read/Feed constraints in 73 ms returned sat
[2025-06-02 03:10:04] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 103 ms.
[2025-06-02 03:10:04] [INFO ] Added : 9 causal constraints over 3 iterations in 377 ms. Result :sat
Minimization took 527 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 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 55 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 51 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2025-06-02 03:10:05] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-02 03:10:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:10:05] [INFO ] Implicit Places using invariants in 586 ms returned []
[2025-06-02 03:10:05] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-02 03:10:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:10:06] [INFO ] State equation strengthened by 75 read => feed constraints.
[2025-06-02 03:10:08] [INFO ] Implicit Places using invariants and state equation in 2494 ms returned []
Implicit Place search using SMT with State Equation took 3082 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:10:08] [INFO ] Redundant transitions in 29 ms returned []
Running 1218 sub problems to find dead transitions.
[2025-06-02 03:10:08] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-02 03:10:08] [INFO ] Invariant cache hit.
[2025-06-02 03:10:08] [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/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 03:10:26] [INFO ] Deduced a trap composed of 131 places in 452 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/1111 variables, and 4 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/422 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/1111 variables, and 4 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/422 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 0/1218 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62156ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 62158ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65328 ms. Remains : 422/422 places, 1220/1220 transitions.
[2025-06-02 03:11:10] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 03:11:11] [INFO ] Flatten gal took : 37 ms
RANDOM walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 1/1 properties
[2025-06-02 03:11:11] [INFO ] Flatten gal took : 51 ms
BEST_FIRST walk for 40002 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
[2025-06-02 03:11:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9753094547479723996.gal : 5 ms
[2025-06-02 03:11:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14167821418194389402.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/ReachabilityCardinality9753094547479723996.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14167821418194389402.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/ReachabilityCardinality14167821418194389402.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 1862
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1862 after 695653
Interrupted probabilistic random walk after 327197 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 1
Probabilistic random walk after 327197 steps, saw 200644 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
[2025-06-02 03:11:14] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2025-06-02 03:11:14] [INFO ] Invariant cache hit.
[2025-06-02 03:11:14] [INFO ] State equation strengthened by 75 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/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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 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) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/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) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 576 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1000ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 54 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 422/422 places, 1220/1220 transitions.
RANDOM walk for 40001 steps (8 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
BEST_FIRST walk for 39632 steps (8 resets) in 43 ms. (900 steps per ms) remains 0/1 properties
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:[0] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-13 in 79982 ms.
[2025-06-02 03:11:15] [INFO ] Flatten gal took : 31 ms
[2025-06-02 03:11:15] [INFO ] Applying decomposition
[2025-06-02 03:11:15] [INFO ] Flatten gal took : 31 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/graph1844769750798943261.txt' '-o' '/tmp/graph1844769750798943261.bin' '-w' '/tmp/graph1844769750798943261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1844769750798943261.bin' '-l' '-1' '-v' '-w' '/tmp/graph1844769750798943261.weights' '-q' '0' '-e' '0.001'
[2025-06-02 03:11:15] [INFO ] Decomposing Gal with order
[2025-06-02 03:11:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 03:11:15] [INFO ] Removed a total of 2293 redundant transitions.
[2025-06-02 03:11:15] [INFO ] Flatten gal took : 74 ms
[2025-06-02 03:11:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 1030 labels/synchronizations in 39 ms.
[2025-06-02 03:11:15] [INFO ] Time to serialize gal into /tmp/UpperBounds14093464909228385252.gal : 7 ms
[2025-06-02 03:11:15] [INFO ] Time to serialize properties into /tmp/UpperBounds5783685225603504069.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/UpperBounds14093464909228385252.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5783685225603504069.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 ...284
Loading property file /tmp/UpperBounds5783685225603504069.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-c004"
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-c004, 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-174867007400125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c004.tgz
mv FunctionPointer-PT-c004 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 ;