About the Execution of ITS-Tools for FunctionPointer-PT-b016
| 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 | 1 ? 0 1 0 0 16 1 1 16 16 inf 0 ? 16 ? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007400085.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-b016, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007400085
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 860K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K 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 391K 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-b016-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748773664904
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-b016
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-01 10:27:47] [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-01 10:27:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:27:48] [INFO ] Load time of PNML (sax parser for PT used): 310 ms
[2025-06-01 10:27:48] [INFO ] Transformed 306 places.
[2025-06-01 10:27:48] [INFO ] Transformed 840 transitions.
[2025-06-01 10:27:48] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 542 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Deduced a syphon composed of 84 places in 13 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b016-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0] Max Struct:[+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, 1, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 10:27:48] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2025-06-01 10:27:48] [INFO ] Computed 4 invariants in 40 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, 16, 1, 1, 16, 16, +inf, +inf, +inf]
FORMULA FunctionPointer-PT-b016-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10010 steps (7 resets) in 115 ms. (86 steps per ms)
FORMULA FunctionPointer-PT-b016-UpperBounds-14 16 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b016-UpperBounds-09 16 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b016-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b016-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b016-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (17 resets) in 153 ms. (389 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 8, 3, 1, 1, 17] Max Struct:[+inf, 16, 16, +inf, +inf, +inf]
[2025-06-01 10:27:48] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
[2025-06-01 10:27:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 10:27:49] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2025-06-01 10:27:49] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 10:27:49] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2025-06-01 10:27:49] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-06-01 10:27:49] [INFO ] [Real]Added 65 Read/Feed constraints in 35 ms returned sat
[2025-06-01 10:27:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 10:27:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-01 10:27:49] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 10:27:49] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2025-06-01 10:27:50] [INFO ] [Nat]Added 65 Read/Feed constraints in 40 ms returned sat
[2025-06-01 10:27:50] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 182 ms.
[2025-06-01 10:27:50] [INFO ] Added : 2 causal constraints over 1 iterations in 328 ms. Result :sat
Minimization took 177 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 10:27:50] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 10:27:50] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 10:27:51] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2025-06-01 10:27:51] [INFO ] [Real]Added 65 Read/Feed constraints in 23 ms returned sat
[2025-06-01 10:27:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 10:27:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 10:27:51] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 10:27:51] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2025-06-01 10:27:51] [INFO ] [Nat]Added 65 Read/Feed constraints in 29 ms returned sat
[2025-06-01 10:27:51] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 129 ms.
[2025-06-01 10:27:51] [INFO ] Added : 3 causal constraints over 1 iterations in 233 ms. Result :sat
Minimization took 241 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 10:27:52] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 10:27:52] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 10:27:52] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2025-06-01 10:27:52] [INFO ] [Real]Added 65 Read/Feed constraints in 22 ms returned sat
[2025-06-01 10:27: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-01 10:27:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 10:27:52] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 10:27:52] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2025-06-01 10:27:52] [INFO ] [Nat]Added 65 Read/Feed constraints in 26 ms returned sat
[2025-06-01 10:27:52] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 96 ms.
[2025-06-01 10:27:53] [INFO ] Added : 2 causal constraints over 1 iterations in 193 ms. Result :sat
Minimization took 164 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 10:27:53] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 10:27:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 7 ms returned sat
[2025-06-01 10:27:53] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2025-06-01 10:27:53] [INFO ] [Real]Added 65 Read/Feed constraints in 21 ms returned sat
[2025-06-01 10: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-01 10:27:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 10:27:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 10:27:53] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2025-06-01 10:27:53] [INFO ] [Nat]Added 65 Read/Feed constraints in 33 ms returned sat
[2025-06-01 10:27:54] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 121 ms.
[2025-06-01 10:27:54] [INFO ] Added : 2 causal constraints over 1 iterations in 215 ms. Result :sat
Minimization took 138 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 10:27:54] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 10:27:54] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 10 ms returned sat
[2025-06-01 10:27:54] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2025-06-01 10:27:54] [INFO ] [Real]Added 65 Read/Feed constraints in 23 ms returned sat
[2025-06-01 10:27:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 10:27:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 10:27:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 10:27:55] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2025-06-01 10:27:55] [INFO ] [Nat]Added 65 Read/Feed constraints in 20 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:27:55] [INFO ] Deduced a trap composed of 21 places in 335 ms of which 19 ms to minimize.
[2025-06-01 10:27:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 392 ms
[2025-06-01 10:27:55] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 84 ms.
[2025-06-01 10:27:55] [INFO ] Added : 2 causal constraints over 1 iterations in 183 ms. Result :sat
Minimization took 151 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 10:27:55] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 10:27:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 10:27:56] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2025-06-01 10:27:56] [INFO ] [Real]Added 65 Read/Feed constraints in 22 ms returned sat
[2025-06-01 10:27:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 10:27:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 10:27:56] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 10:27:56] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2025-06-01 10:27:56] [INFO ] [Nat]Added 65 Read/Feed constraints in 22 ms returned sat
[2025-06-01 10:27:56] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 82 ms.
[2025-06-01 10:27:56] [INFO ] Added : 1 causal constraints over 1 iterations in 178 ms. Result :sat
Minimization took 164 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 8, 3, 1, 1, 17] Max Struct:[+inf, 16, 16, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 8, 8, 1, 1, 17] Max Struct:[+inf, 16, 16, +inf, +inf, +inf]
Support contains 6 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 188 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.6 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 188 transition count 600
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 77 place count 160 transition count 452
Iterating global reduction 1 with 28 rules applied. Total rules applied 105 place count 160 transition count 452
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 145 place count 160 transition count 412
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 160 place count 145 transition count 382
Iterating global reduction 2 with 15 rules applied. Total rules applied 175 place count 145 transition count 382
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 183 place count 145 transition count 374
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 190 place count 138 transition count 360
Iterating global reduction 3 with 7 rules applied. Total rules applied 197 place count 138 transition count 360
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 203 place count 132 transition count 336
Iterating global reduction 3 with 6 rules applied. Total rules applied 209 place count 132 transition count 336
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 215 place count 126 transition count 324
Iterating global reduction 3 with 6 rules applied. Total rules applied 221 place count 126 transition count 324
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 226 place count 121 transition count 304
Iterating global reduction 3 with 5 rules applied. Total rules applied 231 place count 121 transition count 304
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 236 place count 116 transition count 284
Iterating global reduction 3 with 5 rules applied. Total rules applied 241 place count 116 transition count 284
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 246 place count 111 transition count 274
Iterating global reduction 3 with 5 rules applied. Total rules applied 251 place count 111 transition count 274
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 256 place count 106 transition count 264
Iterating global reduction 3 with 5 rules applied. Total rules applied 261 place count 106 transition count 264
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 266 place count 101 transition count 254
Iterating global reduction 3 with 5 rules applied. Total rules applied 271 place count 101 transition count 254
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 276 place count 96 transition count 244
Iterating global reduction 3 with 5 rules applied. Total rules applied 281 place count 96 transition count 244
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 286 place count 91 transition count 234
Iterating global reduction 3 with 5 rules applied. Total rules applied 291 place count 91 transition count 234
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 297 place count 91 transition count 228
Applied a total of 297 rules in 258 ms. Remains 91 /222 variables (removed 131) and now considering 228/648 (removed 420) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 274 ms. Remains : 91/222 places, 228/648 transitions.
[2025-06-01 10:27:57] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {26=1, 68=1, 100=1, 135=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 73=1, 105=1, 136=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :[2, 2, 2, 3, 5, 5]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 8, 8, 3, 5, 17] Max Struct:[+inf, 16, 16, +inf, +inf, +inf]
[2025-06-01 10:27:57] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
// Phase 1: matrix 142 rows 91 cols
[2025-06-01 10:27:57] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 8, 8, 3, 5, 17] Max Struct:[+inf, 16, 16, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2212 ms. (451 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 5239 ms. (1145 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[108, 15, 8, 150, 751, 435] Max Struct:[+inf, 16, 16, +inf, +inf, +inf]
[2025-06-01 10:28:05] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:28:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:28:05] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:28:05] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-06-01 10:28:05] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-01 10:28:05] [INFO ] [Real]Added 21 Read/Feed constraints in 8 ms returned sat
[2025-06-01 10:28: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-01 10:28:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:28:05] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-06-01 10:28:05] [INFO ] [Nat]Added 21 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:28:05] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 11 ms to minimize.
[2025-06-01 10:28:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2025-06-01 10:28:05] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 16 ms.
[2025-06-01 10:28:05] [INFO ] Added : 13 causal constraints over 3 iterations in 92 ms. Result :sat
Minimization took 53 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:28:05] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:28:06] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2025-06-01 10:28:06] [INFO ] [Real]Added 21 Read/Feed constraints in 8 ms returned sat
[2025-06-01 10:28: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-01 10:28:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:28:06] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2025-06-01 10:28:06] [INFO ] [Nat]Added 21 Read/Feed constraints in 8 ms returned sat
[2025-06-01 10:28:06] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 14 ms.
[2025-06-01 10:28:06] [INFO ] Added : 2 causal constraints over 1 iterations in 47 ms. Result :sat
Minimization took 37 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:28:06] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:28:06] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2025-06-01 10:28:06] [INFO ] [Real]Added 21 Read/Feed constraints in 7 ms returned sat
[2025-06-01 10:28: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-01 10:28:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:28:06] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-06-01 10:28:06] [INFO ] [Nat]Added 21 Read/Feed constraints in 7 ms returned sat
[2025-06-01 10:28:06] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 17 ms.
[2025-06-01 10:28:06] [INFO ] Added : 2 causal constraints over 1 iterations in 45 ms. Result :sat
Minimization took 32 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:28:06] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:28:06] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2025-06-01 10:28:06] [INFO ] [Real]Added 21 Read/Feed constraints in 6 ms returned sat
[2025-06-01 10:28: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-01 10:28:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:28:06] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-06-01 10:28:06] [INFO ] [Nat]Added 21 Read/Feed constraints in 8 ms returned sat
[2025-06-01 10:28:06] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 16 ms.
[2025-06-01 10:28:07] [INFO ] Added : 31 causal constraints over 8 iterations in 148 ms. Result :sat
Minimization took 46 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:28:07] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:28:07] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2025-06-01 10:28:07] [INFO ] [Real]Added 21 Read/Feed constraints in 7 ms returned sat
[2025-06-01 10:28: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-01 10:28:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:28:07] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2025-06-01 10:28:07] [INFO ] [Nat]Added 21 Read/Feed constraints in 8 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:28:07] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 11 ms to minimize.
[2025-06-01 10:28:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2025-06-01 10:28:07] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 12 ms.
[2025-06-01 10:28:07] [INFO ] Added : 28 causal constraints over 8 iterations in 134 ms. Result :sat
Minimization took 46 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:28:07] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:28:07] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2025-06-01 10:28:07] [INFO ] [Real]Added 21 Read/Feed constraints in 6 ms returned sat
[2025-06-01 10:28: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-01 10:28:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:28:07] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2025-06-01 10:28:07] [INFO ] [Nat]Added 21 Read/Feed constraints in 7 ms returned sat
[2025-06-01 10:28:07] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 17 ms.
[2025-06-01 10:28:07] [INFO ] Added : 13 causal constraints over 6 iterations in 116 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[108, 15, 8, 150, 751, 435] Max Struct:[+inf, 16, 16, +inf, +inf, +inf]
FORMULA FunctionPointer-PT-b016-UpperBounds-10 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-b016-UpperBounds-06 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[108, 150, 751, 435] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 228/228 transitions.
Applied a total of 0 rules in 11 ms. Remains 91 /91 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 91/91 places, 228/228 transitions.
[2025-06-01 10:28:13] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {26=1, 68=1, 100=1, 135=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {31=1, 73=1, 105=1, 136=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 4) seen :[2, 4, 8, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[108, 150, 751, 435] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-01 10:28:13] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:28:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[108, 150, 751, 435] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1733 ms. (576 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 2970 ms. (1346 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[248, 150, 751, 435] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-01 10:28:18] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:28:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:28:18] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:28:18] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2025-06-01 10:28:18] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-01 10:28:18] [INFO ] [Real]Added 21 Read/Feed constraints in 6 ms returned sat
[2025-06-01 10:28: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-01 10:28:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 10:28:18] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2025-06-01 10:28:18] [INFO ] [Nat]Added 21 Read/Feed constraints in 9 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:28:18] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 8 ms to minimize.
[2025-06-01 10:28:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2025-06-01 10:28:18] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 17 ms.
[2025-06-01 10:28:18] [INFO ] Added : 13 causal constraints over 3 iterations in 91 ms. Result :sat
Minimization took 50 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:28:18] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:28:18] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2025-06-01 10:28:18] [INFO ] [Real]Added 21 Read/Feed constraints in 9 ms returned sat
[2025-06-01 10:28: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-01 10:28:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:28:19] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2025-06-01 10:28:19] [INFO ] [Nat]Added 21 Read/Feed constraints in 9 ms returned sat
[2025-06-01 10:28:19] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 17 ms.
[2025-06-01 10:28:19] [INFO ] Added : 31 causal constraints over 8 iterations in 181 ms. Result :sat
Minimization took 57 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:28:19] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 10:28:19] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-06-01 10:28:19] [INFO ] [Real]Added 21 Read/Feed constraints in 10 ms returned sat
[2025-06-01 10:28: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-01 10:28:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 10:28:19] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2025-06-01 10:28:19] [INFO ] [Nat]Added 21 Read/Feed constraints in 10 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:28:19] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 14 ms to minimize.
[2025-06-01 10:28:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2025-06-01 10:28:19] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 18 ms.
[2025-06-01 10:28:19] [INFO ] Added : 28 causal constraints over 8 iterations in 182 ms. Result :sat
Minimization took 64 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:28:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 10:28:20] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2025-06-01 10:28:20] [INFO ] [Real]Added 21 Read/Feed constraints in 11 ms returned sat
[2025-06-01 10:28: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-01 10:28:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 10:28:20] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2025-06-01 10:28:20] [INFO ] [Nat]Added 21 Read/Feed constraints in 8 ms returned sat
[2025-06-01 10:28:20] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 18 ms.
[2025-06-01 10:28:20] [INFO ] Added : 13 causal constraints over 6 iterations in 127 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[248, 150, 751, 435] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[248, 150, 751, 435] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 228/228 transitions.
Applied a total of 0 rules in 9 ms. Remains 91 /91 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 91/91 places, 228/228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 228/228 transitions.
Applied a total of 0 rules in 7 ms. Remains 91 /91 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2025-06-01 10:28:25] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:28:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:28:25] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-01 10:28:25] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:28:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:28:25] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-01 10:28:26] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:28:26] [INFO ] Redundant transitions in 12 ms returned []
Running 226 sub problems to find dead transitions.
[2025-06-01 10:28:26] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:28:26] [INFO ] Invariant cache hit.
[2025-06-01 10:28:26] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 142/233 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 21/115 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 0/233 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 115 constraints, problems are : Problem set: 0 solved, 226 unsolved in 13575 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 142/233 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 21/115 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 226/341 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:28:49] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:28:49] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:28:58] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 233/233 variables, and 344 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 43912ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 43937ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44389 ms. Remains : 91/91 places, 228/228 transitions.
[2025-06-01 10:29:10] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {26=1, 68=1, 100=1, 135=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 73=1, 105=1, 136=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :[4, 2, 5, 8]
Current structural bounds on expressions (after cover walk) : Max Seen:[248, 150, 751, 435] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-01 10:29:10] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:29:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[248, 150, 751, 435] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1748 ms. (571 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 3468 ms. (1153 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[248, 169, 751, 866] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-01 10:29:15] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:29:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:29:15] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 10:29:15] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2025-06-01 10:29:15] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-01 10:29:15] [INFO ] [Real]Added 21 Read/Feed constraints in 13 ms returned sat
[2025-06-01 10: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-01 10:29:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 10:29:15] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2025-06-01 10:29:15] [INFO ] [Nat]Added 21 Read/Feed constraints in 10 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:29:15] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 15 ms to minimize.
[2025-06-01 10:29:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2025-06-01 10:29:16] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 18 ms.
[2025-06-01 10:29:16] [INFO ] Added : 13 causal constraints over 3 iterations in 93 ms. Result :sat
Minimization took 47 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:29:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 10:29:16] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2025-06-01 10:29:16] [INFO ] [Real]Added 21 Read/Feed constraints in 9 ms returned sat
[2025-06-01 10:29: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-01 10:29:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 10:29:16] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2025-06-01 10:29:16] [INFO ] [Nat]Added 21 Read/Feed constraints in 9 ms returned sat
[2025-06-01 10:29:16] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 19 ms.
[2025-06-01 10:29:16] [INFO ] Added : 31 causal constraints over 8 iterations in 203 ms. Result :sat
Minimization took 64 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:29:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 10:29:16] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-06-01 10:29:16] [INFO ] [Real]Added 21 Read/Feed constraints in 11 ms returned sat
[2025-06-01 10:29: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-01 10:29:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 10:29:17] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-06-01 10:29:17] [INFO ] [Nat]Added 21 Read/Feed constraints in 11 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:29:17] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 14 ms to minimize.
[2025-06-01 10:29:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2025-06-01 10:29:17] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 17 ms.
[2025-06-01 10:29:17] [INFO ] Added : 28 causal constraints over 8 iterations in 184 ms. Result :sat
Minimization took 61 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:29:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 10:29:17] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-06-01 10:29:17] [INFO ] [Real]Added 21 Read/Feed constraints in 10 ms returned sat
[2025-06-01 10: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-01 10:29:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:29:17] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2025-06-01 10:29:17] [INFO ] [Nat]Added 21 Read/Feed constraints in 8 ms returned sat
[2025-06-01 10:29:17] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 20 ms.
[2025-06-01 10:29:17] [INFO ] Added : 13 causal constraints over 6 iterations in 136 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[248, 169, 751, 866] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[248, 169, 751, 866] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 228/228 transitions.
Applied a total of 0 rules in 9 ms. Remains 91 /91 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 91/91 places, 228/228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 228/228 transitions.
Applied a total of 0 rules in 10 ms. Remains 91 /91 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2025-06-01 10:29:24] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:29:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:29:24] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-06-01 10:29:24] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:29:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:29:24] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-01 10:29:24] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:29:24] [INFO ] Redundant transitions in 19 ms returned []
Running 226 sub problems to find dead transitions.
[2025-06-01 10:29:24] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:29:24] [INFO ] Invariant cache hit.
[2025-06-01 10:29:24] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 142/233 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 21/115 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 0/233 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 115 constraints, problems are : Problem set: 0 solved, 226 unsolved in 13085 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 142/233 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 21/115 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 226/341 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:29:46] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:29:46] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:29:57] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 233/233 variables, and 344 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 43317ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 43320ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43978 ms. Remains : 91/91 places, 228/228 transitions.
[2025-06-01 10:30:07] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {26=1, 68=1, 100=1, 135=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 73=1, 105=1, 136=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :[3, 3, 9, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[248, 169, 751, 866] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-01 10:30:08] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:30:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[248, 169, 751, 866] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2160 ms. (462 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 3047 ms. (1312 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[248, 169, 751, 866] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-01 10:30:13] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:30:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:30:13] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-01 10:30:13] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-06-01 10:30:13] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-01 10:30:13] [INFO ] [Real]Added 21 Read/Feed constraints in 11 ms returned sat
[2025-06-01 10:30: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-01 10:30:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 10:30:13] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2025-06-01 10:30:13] [INFO ] [Nat]Added 21 Read/Feed constraints in 11 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:30:13] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 14 ms to minimize.
[2025-06-01 10:30:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2025-06-01 10:30:13] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 17 ms.
[2025-06-01 10:30:13] [INFO ] Added : 13 causal constraints over 3 iterations in 93 ms. Result :sat
Minimization took 53 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:30:14] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 10:30:14] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2025-06-01 10:30:14] [INFO ] [Real]Added 21 Read/Feed constraints in 9 ms returned sat
[2025-06-01 10:30: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-01 10:30:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 10:30:14] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2025-06-01 10:30:14] [INFO ] [Nat]Added 21 Read/Feed constraints in 8 ms returned sat
[2025-06-01 10:30:14] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 18 ms.
[2025-06-01 10:30:14] [INFO ] Added : 31 causal constraints over 8 iterations in 185 ms. Result :sat
Minimization took 65 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:30:14] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:30:14] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2025-06-01 10:30:14] [INFO ] [Real]Added 21 Read/Feed constraints in 10 ms returned sat
[2025-06-01 10:30: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-01 10:30:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:30:14] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2025-06-01 10:30:14] [INFO ] [Nat]Added 21 Read/Feed constraints in 8 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:30:15] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 13 ms to minimize.
[2025-06-01 10:30:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2025-06-01 10:30:15] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 16 ms.
[2025-06-01 10:30:15] [INFO ] Added : 28 causal constraints over 8 iterations in 167 ms. Result :sat
Minimization took 54 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:30:15] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:30:15] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-06-01 10:30:15] [INFO ] [Real]Added 21 Read/Feed constraints in 8 ms returned sat
[2025-06-01 10: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-01 10:30:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 10:30:15] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-06-01 10:30:15] [INFO ] [Nat]Added 21 Read/Feed constraints in 7 ms returned sat
[2025-06-01 10:30:15] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 19 ms.
[2025-06-01 10:30:15] [INFO ] Added : 13 causal constraints over 6 iterations in 123 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[248, 169, 751, 866] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[248, 169, 751, 866] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 228/228 transitions.
Applied a total of 0 rules in 7 ms. Remains 91 /91 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 91/91 places, 228/228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 228/228 transitions.
Applied a total of 0 rules in 7 ms. Remains 91 /91 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2025-06-01 10:30:21] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:30:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:30:21] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-06-01 10:30:21] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:30:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:30:21] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-01 10:30:22] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:30:22] [INFO ] Redundant transitions in 3 ms returned []
Running 226 sub problems to find dead transitions.
[2025-06-01 10:30:22] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:30:22] [INFO ] Invariant cache hit.
[2025-06-01 10:30:22] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 142/233 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 21/115 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 0/233 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 115 constraints, problems are : Problem set: 0 solved, 226 unsolved in 12569 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 142/233 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 21/115 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 226/341 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:30:42] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:30:42] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:30:53] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 233/233 variables, and 344 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 42679ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 42681ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43269 ms. Remains : 91/91 places, 228/228 transitions.
[2025-06-01 10:31:04] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {26=1, 68=1, 100=1, 135=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {31=1, 73=1, 105=1, 136=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 4) seen :[3, 3, 3, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[248, 169, 751, 866] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 40002 steps (8 resets) in 1185 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 219 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 206 ms. (193 steps per ms) remains 4/4 properties
[2025-06-01 10:31:05] [INFO ] Flatten gal took : 102 ms
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 4/4 properties
[2025-06-01 10:31:05] [INFO ] Flatten gal took : 56 ms
[2025-06-01 10:31:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7349478879781495352.gal : 20 ms
[2025-06-01 10:31:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5600743913455012502.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/ReachabilityCardinality7349478879781495352.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5600743913455012502.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5600743913455012502.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :31 after 1058
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1058 after 174131
Interrupted probabilistic random walk after 339533 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 4
Probabilistic random walk after 339533 steps, saw 211362 distinct states, run finished after 3006 ms. (steps per millisecond=112 ) properties seen :0
[2025-06-01 10:31:08] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:31:08] [INFO ] Invariant cache hit.
[2025-06-01 10:31:08] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 87/103 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 8/111 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 106/217 variables, 60/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 19/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 32
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 6/223 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD size :174131 after 2.97284e+08
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 10/233 variables, 11/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/233 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 115 constraints, problems are : Problem set: 0 solved, 4 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 87/103 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 8/111 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 106/217 variables, 60/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 19/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:31:09] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 6/223 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 10/233 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:31:09] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/233 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/233 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/233 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 121 constraints, problems are : Problem set: 0 solved, 4 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 774ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :2.97284e+08 after 6.70601e+12
Detected timeout of ITS tools.
[2025-06-01 10:31:56] [INFO ] Flatten gal took : 71 ms
[2025-06-01 10:31:56] [INFO ] Applying decomposition
[2025-06-01 10:31:56] [INFO ] Flatten gal took : 51 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/graph18246449661153928756.txt' '-o' '/tmp/graph18246449661153928756.bin' '-w' '/tmp/graph18246449661153928756.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18246449661153928756.bin' '-l' '-1' '-v' '-w' '/tmp/graph18246449661153928756.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:31:56] [INFO ] Decomposing Gal with order
[2025-06-01 10:31:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:31:56] [INFO ] Removed a total of 387 redundant transitions.
[2025-06-01 10:31:56] [INFO ] Flatten gal took : 120 ms
[2025-06-01 10:31:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 24 ms.
[2025-06-01 10:31:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality359942273604919331.gal : 13 ms
[2025-06-01 10:31:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4478300245266865822.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/ReachabilityCardinality359942273604919331.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4478300245266865822.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 ...306
Loading property file /tmp/ReachabilityCardinality4478300245266865822.prop.
Parikh walk visited 0 properties in 49897 ms.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 228/228 transitions.
Applied a total of 0 rules in 20 ms. Remains 91 /91 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 91/91 places, 228/228 transitions.
RANDOM walk for 40003 steps (8 resets) in 193 ms. (206 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 303896 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 4
Probabilistic random walk after 303896 steps, saw 189179 distinct states, run finished after 3002 ms. (steps per millisecond=101 ) properties seen :0
[2025-06-01 10:32:02] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:32:02] [INFO ] Invariant cache hit.
[2025-06-01 10:32:02] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 87/103 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 8/111 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 106/217 variables, 60/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 19/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 6/223 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 10/233 variables, 11/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/233 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 115 constraints, problems are : Problem set: 0 solved, 4 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 87/103 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 8/111 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 106/217 variables, 60/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 19/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:32:03] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 6/223 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 10/233 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:32:03] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/233 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/233 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/233 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 121 constraints, problems are : Problem set: 0 solved, 4 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 803ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Detected timeout of ITS tools.
Parikh walk visited 0 properties in 47867 ms.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 228/228 transitions.
Applied a total of 0 rules in 5 ms. Remains 91 /91 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 91/91 places, 228/228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 228/228 transitions.
Applied a total of 0 rules in 8 ms. Remains 91 /91 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2025-06-01 10:32:51] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:32:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:32:51] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-01 10:32:51] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:32:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:32:51] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-01 10:32:51] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:32:51] [INFO ] Redundant transitions in 3 ms returned []
Running 226 sub problems to find dead transitions.
[2025-06-01 10:32:51] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:32:51] [INFO ] Invariant cache hit.
[2025-06-01 10:32:51] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 142/233 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 21/115 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 0/233 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 115 constraints, problems are : Problem set: 0 solved, 226 unsolved in 9435 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 142/233 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 21/115 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 226/341 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:33:08] [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-01 10:33:08] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:33:16] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 233/233 variables, and 344 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 91/91 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 39608ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 39613ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40090 ms. Remains : 91/91 places, 228/228 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[248, 169, 751, 866] Max Struct:[+inf, +inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-b016-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-01 10:33:31] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:33:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-01 10:33:31] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:33:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 10:33:31] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:33:31] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2025-06-01 10:33:31] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-01 10:33:31] [INFO ] [Real]Added 21 Read/Feed constraints in 6 ms returned sat
[2025-06-01 10:33:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 10:33:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:33:31] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-06-01 10:33:31] [INFO ] [Nat]Added 21 Read/Feed constraints in 6 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:33:31] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 5 ms to minimize.
[2025-06-01 10:33:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2025-06-01 10:33:31] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 12 ms.
[2025-06-01 10:33:31] [INFO ] Added : 18 causal constraints over 5 iterations in 83 ms. Result :sat
Minimization took 39 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 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 228/228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 89 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 88 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 88 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 87 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 87 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 86 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 86 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 85 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 85 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 84 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 84 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 83 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 83 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 82 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 82 transition count 208
Applied a total of 18 rules in 26 ms. Remains 82 /91 variables (removed 9) and now considering 208/228 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 82/91 places, 208/228 transitions.
[2025-06-01 10:33:32] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {29=1, 32=1, 34=1, 63=1, 94=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {26=1, 60=1, 91=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-01 10:33:32] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2025-06-01 10:33:32] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1475 ms. (677 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 727 ms. (1373 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[239] Max Struct:[+inf]
[2025-06-01 10:33:34] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 10:33:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:33:34] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:33:34] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-06-01 10:33:34] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 10:33:34] [INFO ] [Real]Added 18 Read/Feed constraints in 6 ms returned sat
[2025-06-01 10:33: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-01 10:33:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:33:34] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2025-06-01 10:33:34] [INFO ] [Nat]Added 18 Read/Feed constraints in 6 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:33:34] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 7 ms to minimize.
[2025-06-01 10:33:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2025-06-01 10:33:34] [INFO ] Computed and/alt/rep : 60/196/54 causal constraints (skipped 72 transitions) in 10 ms.
[2025-06-01 10:33:34] [INFO ] Added : 14 causal constraints over 4 iterations in 63 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[239] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[239] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2025-06-01 10:33:35] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 10:33:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:33:36] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-06-01 10:33:36] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 10:33:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:33:36] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 10:33:36] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:33:36] [INFO ] Redundant transitions in 2 ms returned []
Running 206 sub problems to find dead transitions.
[2025-06-01 10:33:36] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 10:33:36] [INFO ] Invariant cache hit.
[2025-06-01 10:33:36] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 206 unsolved in 9800 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 206/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:33:52] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 310 constraints, problems are : Problem set: 0 solved, 206 unsolved in 24818 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34701ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 34701ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35127 ms. Remains : 82/82 places, 208/208 transitions.
[2025-06-01 10:34:11] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {29=1, 32=1, 34=1, 63=1, 94=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 60=1, 91=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[239] Max Struct:[+inf]
[2025-06-01 10:34:11] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 10:34:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[239] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 1484 ms. (673 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 675 ms. (1479 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[239] Max Struct:[+inf]
[2025-06-01 10:34:13] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 10:34:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:34:13] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:34:13] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2025-06-01 10:34:13] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 10:34:13] [INFO ] [Real]Added 18 Read/Feed constraints in 6 ms returned sat
[2025-06-01 10:34: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-01 10:34:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:34:13] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2025-06-01 10:34:13] [INFO ] [Nat]Added 18 Read/Feed constraints in 6 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:34:13] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 7 ms to minimize.
[2025-06-01 10:34:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2025-06-01 10:34:13] [INFO ] Computed and/alt/rep : 60/196/54 causal constraints (skipped 72 transitions) in 11 ms.
[2025-06-01 10:34:13] [INFO ] Added : 14 causal constraints over 4 iterations in 65 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[239] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[239] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2025-06-01 10:34:14] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 10:34:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:34:15] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-01 10:34:15] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 10:34:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:34:15] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 10:34:15] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:34:15] [INFO ] Redundant transitions in 2 ms returned []
Running 206 sub problems to find dead transitions.
[2025-06-01 10:34:15] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 10:34:15] [INFO ] Invariant cache hit.
[2025-06-01 10:34:15] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 206 unsolved in 9752 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 206/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:34:31] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 310 constraints, problems are : Problem set: 0 solved, 206 unsolved in 24873 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34683ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 34683ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35107 ms. Remains : 82/82 places, 208/208 transitions.
[2025-06-01 10:34:50] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {29=1, 32=1, 34=1, 63=1, 94=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {26=1, 60=1, 91=1, 123=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[239] Max Struct:[+inf]
[2025-06-01 10:34:50] [INFO ] Flatten gal took : 45 ms
RANDOM walk for 40009 steps (8 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
[2025-06-01 10:34:50] [INFO ] Flatten gal took : 16 ms
[2025-06-01 10:34:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15998890069302245925.gal : 4 ms
[2025-06-01 10:34:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4607806007241088500.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/ReachabilityCardinality15998890069302245925.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4607806007241088500.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality4607806007241088500.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 1045
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1045 after 158846
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :158846 after 1.87407e+08
Interrupted probabilistic random walk after 1530230 steps, run timeout after 3001 ms. (steps per millisecond=509 ) properties seen :0 out of 1
Probabilistic random walk after 1530230 steps, saw 952387 distinct states, run finished after 3001 ms. (steps per millisecond=509 ) properties seen :0
[2025-06-01 10:34:53] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 10:34:53] [INFO ] Invariant cache hit.
[2025-06-01 10:34:53] [INFO ] State equation strengthened by 18 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) 70/75 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/85 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 100/185 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 18/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/191 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/205 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/209 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/209 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/210 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 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) 70/75 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/85 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 100/185 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 18/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/191 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/205 variables, 12/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/209 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/210 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/210 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/210 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 315ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 684 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 82/82 places, 208/208 transitions.
RANDOM walk for 40000 steps (8 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.87407e+08 after 9.09726e+11
Interrupted probabilistic random walk after 1458012 steps, run timeout after 3001 ms. (steps per millisecond=485 ) properties seen :0 out of 1
Probabilistic random walk after 1458012 steps, saw 907436 distinct states, run finished after 3001 ms. (steps per millisecond=485 ) properties seen :0
[2025-06-01 10:34:57] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 10:34:57] [INFO ] Invariant cache hit.
[2025-06-01 10:34:57] [INFO ] State equation strengthened by 18 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) 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) 70/75 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/85 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 100/185 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 18/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/191 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/205 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/209 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/209 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/210 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 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) 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) 70/75 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/85 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 100/185 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 18/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/191 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/205 variables, 12/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/209 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/210 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/210 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/210 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 322ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 612 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2025-06-01 10:34:58] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 10:34:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:34:58] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-01 10:34:58] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 10:34:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:34:58] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 10:34:58] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:34:58] [INFO ] Redundant transitions in 1 ms returned []
Running 206 sub problems to find dead transitions.
[2025-06-01 10:34:58] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2025-06-01 10:34:58] [INFO ] Invariant cache hit.
[2025-06-01 10:34:58] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9.09726e+11 after 6.59113e+12
At refinement iteration 5 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 206 unsolved in 9528 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 206/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6.59113e+12 after 6.63835e+14
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.63835e+14 after 2.3469e+15
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:35:14] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.3469e+15 after 5.70647e+15
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 206 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.70647e+15 after 1.24191e+16
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 310 constraints, problems are : Problem set: 0 solved, 206 unsolved in 24937 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34529ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 34530ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34918 ms. Remains : 82/82 places, 208/208 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 82 transition count 121
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 94 place count 75 transition count 121
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 94 place count 75 transition count 105
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 126 place count 59 transition count 105
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 156 place count 44 transition count 90
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 163 place count 37 transition count 76
Iterating global reduction 2 with 7 rules applied. Total rules applied 170 place count 37 transition count 76
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 177 place count 30 transition count 62
Iterating global reduction 2 with 7 rules applied. Total rules applied 184 place count 30 transition count 62
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 191 place count 23 transition count 48
Iterating global reduction 2 with 7 rules applied. Total rules applied 198 place count 23 transition count 48
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 205 place count 23 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 205 place count 23 transition count 40
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 207 place count 22 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 211 place count 20 transition count 40
Applied a total of 211 rules in 25 ms. Remains 20 /82 variables (removed 62) and now considering 40/208 (removed 168) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 40 rows 20 cols
[2025-06-01 10:35:33] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 10:35:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:35:33] [INFO ] After 21ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 10:35:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 10:35:33] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 10:35:33] [INFO ] After 60ms 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-01 10:35:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:35:33] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 10:35:33] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 10:35:33] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 10:35:33] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 10:35:33] [INFO ] Flatten gal took : 5 ms
[2025-06-01 10:35:33] [INFO ] Flatten gal took : 3 ms
[2025-06-01 10:35:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4538942371030700223.gal : 2 ms
[2025-06-01 10:35:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2197902728511679213.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/ReachabilityCardinality4538942371030700223.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2197902728511679213.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2197902728511679213.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 1836
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1836 after 310692
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :310692 after 2.20708e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.20708e+06 after 1.10754e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.10754e+07 after 4.8981e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.8981e+07 after 2.05226e+08
Detected timeout of ITS tools.
[2025-06-01 10:35:40] [INFO ] Flatten gal took : 14 ms
[2025-06-01 10:35:40] [INFO ] Applying decomposition
[2025-06-01 10:35:40] [INFO ] Flatten gal took : 14 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/graph11898904218626954208.txt' '-o' '/tmp/graph11898904218626954208.bin' '-w' '/tmp/graph11898904218626954208.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11898904218626954208.bin' '-l' '-1' '-v' '-w' '/tmp/graph11898904218626954208.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:35:40] [INFO ] Decomposing Gal with order
[2025-06-01 10:35:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:35:40] [INFO ] Removed a total of 353 redundant transitions.
[2025-06-01 10:35:40] [INFO ] Flatten gal took : 27 ms
[2025-06-01 10:35:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 121 labels/synchronizations in 11 ms.
[2025-06-01 10:35:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9517557609977825427.gal : 3 ms
[2025-06-01 10:35:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9250813193598379216.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/ReachabilityCardinality9517557609977825427.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9250813193598379216.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/ReachabilityCardinality9250813193598379216.prop.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.05226e+08 after 8.39009e+08
Detected timeout of ITS tools.
[2025-06-01 10:35:48] [INFO ] Flatten gal took : 4 ms
[2025-06-01 10:35:48] [INFO ] Applying decomposition
[2025-06-01 10:35:48] [INFO ] Flatten gal took : 2 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/graph9088094674460737155.txt' '-o' '/tmp/graph9088094674460737155.bin' '-w' '/tmp/graph9088094674460737155.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9088094674460737155.bin' '-l' '-1' '-v' '-w' '/tmp/graph9088094674460737155.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:35:48] [INFO ] Decomposing Gal with order
[2025-06-01 10:35:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:35:48] [INFO ] Removed a total of 47 redundant transitions.
[2025-06-01 10:35:48] [INFO ] Flatten gal took : 7 ms
[2025-06-01 10:35:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2025-06-01 10:35:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1103839756501650544.gal : 2 ms
[2025-06-01 10:35:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17164223989689867575.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/ReachabilityCardinality1103839756501650544.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17164223989689867575.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/ReachabilityCardinality17164223989689867575.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 2679
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30261 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[239] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b016-UpperBounds-01 in 151970 ms.
Starting property specific reduction for FunctionPointer-PT-b016-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 10:36:03] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
// Phase 1: matrix 142 rows 91 cols
[2025-06-01 10:36:03] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 20 ms. (476 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:[4] Max Struct:[+inf]
[2025-06-01 10:36:03] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:36:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 10:36:03] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:36:03] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-06-01 10:36:03] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-01 10:36:03] [INFO ] [Real]Added 21 Read/Feed constraints in 6 ms returned sat
[2025-06-01 10:36:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 10:36:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:36:03] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2025-06-01 10:36:03] [INFO ] [Nat]Added 21 Read/Feed constraints in 7 ms returned sat
[2025-06-01 10:36:03] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 12 ms.
[2025-06-01 10:36:03] [INFO ] Added : 8 causal constraints over 3 iterations in 61 ms. Result :sat
Minimization took 33 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 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 228/228 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 89 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 88 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 88 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 87 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 87 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 86 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 86 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 85 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 85 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 84 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 84 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 83 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 83 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 82 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 82 transition count 206
Applied a total of 18 rules in 26 ms. Remains 82 /91 variables (removed 9) and now considering 206/228 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 82/91 places, 206/228 transitions.
[2025-06-01 10:36:03] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {30=1, 63=1, 93=1, 121=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {24=1, 57=1, 87=1, 122=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2025-06-01 10:36:03] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
// Phase 1: matrix 126 rows 82 cols
[2025-06-01 10:36:03] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1611 ms. (620 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 710 ms. (1406 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[278] Max Struct:[+inf]
[2025-06-01 10:36:06] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2025-06-01 10:36:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:36:06] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:36:06] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-06-01 10:36:06] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 10:36:06] [INFO ] [Real]Added 18 Read/Feed constraints in 6 ms returned sat
[2025-06-01 10:36: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-01 10:36:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:36:06] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2025-06-01 10:36:06] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2025-06-01 10:36:06] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 71 transitions) in 11 ms.
[2025-06-01 10:36:06] [INFO ] Added : 9 causal constraints over 3 iterations in 71 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[278] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[278] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 206/206 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 206/206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 206/206 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2025-06-01 10:36:06] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2025-06-01 10:36:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:36:06] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-01 10:36:06] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2025-06-01 10:36:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:36:06] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 10:36:07] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:36:07] [INFO ] Redundant transitions in 1 ms returned []
Running 204 sub problems to find dead transitions.
[2025-06-01 10:36:07] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2025-06-01 10:36:07] [INFO ] Invariant cache hit.
[2025-06-01 10:36:07] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 126/208 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 103 constraints, problems are : Problem set: 0 solved, 204 unsolved in 6659 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 126/208 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 204/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 307 constraints, problems are : Problem set: 0 solved, 204 unsolved in 19160 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25890ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 25891ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26298 ms. Remains : 82/82 places, 206/206 transitions.
[2025-06-01 10:36:32] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {30=1, 63=1, 93=1, 121=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {24=1, 57=1, 87=1, 122=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2025-06-01 10:36:33] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2025-06-01 10:36:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1458 ms. (685 steps per ms)
FORMULA FunctionPointer-PT-b016-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-01 10:36:34] [INFO ] Flatten gal took : 12 ms
[2025-06-01 10:36:34] [INFO ] Flatten gal took : 12 ms
[2025-06-01 10:36:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18359399722256070883.gal : 3 ms
[2025-06-01 10:36:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15854268232976595631.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/ReachabilityCardinality18359399722256070883.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15854268232976595631.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 ...330
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-b016-UpperBounds-11 in 31094 ms.
Starting property specific reduction for FunctionPointer-PT-b016-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-01 10:36:34] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
// Phase 1: matrix 142 rows 91 cols
[2025-06-01 10:36:34] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 19 ms. (500 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[+inf]
[2025-06-01 10:36:34] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:36:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 10:36:34] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:36:34] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-06-01 10:36:34] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-01 10:36:34] [INFO ] [Real]Added 21 Read/Feed constraints in 6 ms returned sat
[2025-06-01 10:36:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 10:36:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:36:34] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2025-06-01 10:36:34] [INFO ] [Nat]Added 21 Read/Feed constraints in 6 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:36:34] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 5 ms to minimize.
[2025-06-01 10:36:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2025-06-01 10:36:34] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 10 ms.
[2025-06-01 10:36:34] [INFO ] Added : 23 causal constraints over 6 iterations in 90 ms. Result :sat
Minimization took 35 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 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 228/228 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 89 transition count 222
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 89 transition count 222
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 87 transition count 218
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 87 transition count 218
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 85 transition count 210
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 85 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 84 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 84 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 83 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 83 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 82 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 82 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 81 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 81 transition count 202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 80 transition count 200
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 80 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 79 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 79 transition count 198
Applied a total of 24 rules in 18 ms. Remains 79 /91 variables (removed 12) and now considering 198/228 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 79/91 places, 198/228 transitions.
[2025-06-01 10:36:35] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {31=1, 60=1, 106=1, 121=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 59=1, 105=1, 120=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :[6]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
[2025-06-01 10:36:35] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
// Phase 1: matrix 122 rows 79 cols
[2025-06-01 10:36:35] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1525 ms. (655 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 692 ms. (1443 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[710] Max Struct:[+inf]
[2025-06-01 10:36:37] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 10:36:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:36:37] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:36:37] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2025-06-01 10:36:37] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 10:36:37] [INFO ] [Real]Added 18 Read/Feed constraints in 6 ms returned sat
[2025-06-01 10: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-01 10:36:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:36:37] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2025-06-01 10:36:37] [INFO ] [Nat]Added 18 Read/Feed constraints in 5 ms returned sat
[2025-06-01 10:36:37] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 67 transitions) in 11 ms.
[2025-06-01 10:36:37] [INFO ] Added : 16 causal constraints over 5 iterations in 70 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[710] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[710] Max Struct:[+inf]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 79/79 places, 198/198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2025-06-01 10:36:40] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 10:36:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:36:40] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-01 10:36:40] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 10:36:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:36:40] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 10:36:40] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:36:40] [INFO ] Redundant transitions in 1 ms returned []
Running 196 sub problems to find dead transitions.
[2025-06-01 10:36:40] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 10:36:40] [INFO ] Invariant cache hit.
[2025-06-01 10:36:40] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 122/201 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 196 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 100 constraints, problems are : Problem set: 0 solved, 196 unsolved in 5057 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 122/201 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 196/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:36:51] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 297 constraints, problems are : Problem set: 0 solved, 196 unsolved in 24217 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 29326ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 29327ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29778 ms. Remains : 79/79 places, 198/198 transitions.
[2025-06-01 10:37:09] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {31=1, 60=1, 106=1, 121=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 59=1, 105=1, 120=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :[6]
Current structural bounds on expressions (after cover walk) : Max Seen:[710] Max Struct:[+inf]
[2025-06-01 10:37:09] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 10:37:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[710] Max Struct:[+inf]
RANDOM walk for 1000007 steps (2 resets) in 1464 ms. (682 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 704 ms. (1418 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[781] Max Struct:[+inf]
[2025-06-01 10:37:12] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 10:37:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:37:12] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:37:12] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2025-06-01 10:37:12] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 10:37:12] [INFO ] [Real]Added 18 Read/Feed constraints in 7 ms returned sat
[2025-06-01 10:37: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-01 10:37:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:37:12] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2025-06-01 10:37:12] [INFO ] [Nat]Added 18 Read/Feed constraints in 6 ms returned sat
[2025-06-01 10:37:12] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 67 transitions) in 11 ms.
[2025-06-01 10:37:12] [INFO ] Added : 16 causal constraints over 5 iterations in 71 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[781] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[781] Max Struct:[+inf]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 79/79 places, 198/198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2025-06-01 10:37:14] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 10:37:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:37:14] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-01 10:37:14] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 10:37:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:37:14] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 10:37:15] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:37:15] [INFO ] Redundant transitions in 1 ms returned []
Running 196 sub problems to find dead transitions.
[2025-06-01 10:37:15] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 10:37:15] [INFO ] Invariant cache hit.
[2025-06-01 10:37:15] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 122/201 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 196 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 100 constraints, problems are : Problem set: 0 solved, 196 unsolved in 5341 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 122/201 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 196/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:37:26] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 297 constraints, problems are : Problem set: 0 solved, 196 unsolved in 24147 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 29548ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 29549ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29954 ms. Remains : 79/79 places, 198/198 transitions.
[2025-06-01 10:37:44] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {31=1, 60=1, 106=1, 121=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {30=1, 59=1, 105=1, 120=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 :[13]
Current structural bounds on expressions (after cover walk) : Max Seen:[781] Max Struct:[+inf]
[2025-06-01 10:37:44] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 10:37:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[781] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1759 ms. (568 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 625 ms. (1597 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[781] Max Struct:[+inf]
[2025-06-01 10:37:47] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 10:37:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:37:47] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:37:47] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2025-06-01 10:37:47] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 10:37:47] [INFO ] [Real]Added 18 Read/Feed constraints in 5 ms returned sat
[2025-06-01 10:37: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-01 10:37:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:37:47] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-06-01 10:37:47] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2025-06-01 10:37:47] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 67 transitions) in 12 ms.
[2025-06-01 10:37:47] [INFO ] Added : 16 causal constraints over 5 iterations in 67 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[781] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[781] Max Struct:[+inf]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 5 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 79/79 places, 198/198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 5 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2025-06-01 10:37:49] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 10:37:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:37:49] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-01 10:37:49] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 10:37:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:37:49] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 10:37:50] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:37:50] [INFO ] Redundant transitions in 1 ms returned []
Running 196 sub problems to find dead transitions.
[2025-06-01 10:37:50] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 10:37:50] [INFO ] Invariant cache hit.
[2025-06-01 10:37:50] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 122/201 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 196 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 100 constraints, problems are : Problem set: 0 solved, 196 unsolved in 6886 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 122/201 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 196/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:38:03] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 297 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36959ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 36960ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37358 ms. Remains : 79/79 places, 198/198 transitions.
[2025-06-01 10:38:27] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {31=1, 60=1, 106=1, 121=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 59=1, 105=1, 120=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[8]
Current structural bounds on expressions (after cover walk) : Max Seen:[781] Max Struct:[+inf]
[2025-06-01 10:38:27] [INFO ] Flatten gal took : 20 ms
RANDOM walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
[2025-06-01 10:38:27] [INFO ] Flatten gal took : 9 ms
[2025-06-01 10:38:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9170411477067808460.gal : 2 ms
[2025-06-01 10:38:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5328134194474542280.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/ReachabilityCardinality9170411477067808460.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5328134194474542280.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality5328134194474542280.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 1040
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1040 after 155240
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :155240 after 1.73998e+08
Interrupted probabilistic random walk after 1557229 steps, run timeout after 3001 ms. (steps per millisecond=518 ) properties seen :0 out of 1
Probabilistic random walk after 1557229 steps, saw 969193 distinct states, run finished after 3001 ms. (steps per millisecond=518 ) properties seen :0
[2025-06-01 10:38:30] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 10:38:30] [INFO ] Invariant cache hit.
[2025-06-01 10:38:30] [INFO ] State equation strengthened by 18 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) 71/75 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/82 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 100/182 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 17/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 6/188 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/198 variables, 10/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/198 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/201 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 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) 71/75 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/82 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 100/182 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 17/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/188 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/198 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:38:30] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/198 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/198 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/201 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/201 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/201 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 307ms problems are : Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.73998e+08 after 7.12126e+11
Parikh walk visited 0 properties in 1624 ms.
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 79/79 places, 198/198 transitions.
RANDOM walk for 40000 steps (8 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1514338 steps, run timeout after 3001 ms. (steps per millisecond=504 ) properties seen :0 out of 1
Probabilistic random walk after 1514338 steps, saw 942497 distinct states, run finished after 3001 ms. (steps per millisecond=504 ) properties seen :0
[2025-06-01 10:38:35] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 10:38:35] [INFO ] Invariant cache hit.
[2025-06-01 10:38:35] [INFO ] State equation strengthened by 18 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) 71/75 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/82 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 100/182 variables, 57/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 17/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 6/188 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/188 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/198 variables, 10/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/198 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/201 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 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) 71/75 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/82 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 100/182 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 17/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/182 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/188 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/198 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:38:35] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/198 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/198 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/201 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/201 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/201 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 333ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1500 ms.
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 7 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 79/79 places, 198/198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2025-06-01 10:38:37] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 10:38:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:38:37] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-01 10:38:37] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 10:38:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:38:37] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-01 10:38:37] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:38:37] [INFO ] Redundant transitions in 1 ms returned []
Running 196 sub problems to find dead transitions.
[2025-06-01 10:38:37] [INFO ] Flow matrix only has 122 transitions (discarded 76 similar events)
[2025-06-01 10:38:37] [INFO ] Invariant cache hit.
[2025-06-01 10:38:37] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 122/201 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 196 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7.12126e+11 after 4.44487e+12
At refinement iteration 5 (OVERLAPS) 0/201 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 100 constraints, problems are : Problem set: 0 solved, 196 unsolved in 6703 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 122/201 variables, 79/82 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 196 unsolved
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4.44487e+12 after 1.59572e+14
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.59572e+14 after 1.84263e+15
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 196/296 constraints. Problems are: Problem set: 0 solved, 196 unsolved
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.84263e+15 after 5.20221e+15
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:38:51] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5.20221e+15 after 1.19148e+16
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 297 constraints, problems are : Problem set: 0 solved, 196 unsolved in 29564 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 79/79 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36316ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 36317ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36822 ms. Remains : 79/79 places, 198/198 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 79 transition count 114
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 92 place count 71 transition count 114
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 92 place count 71 transition count 101
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 118 place count 58 transition count 101
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 150 place count 42 transition count 85
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 157 place count 35 transition count 71
Iterating global reduction 2 with 7 rules applied. Total rules applied 164 place count 35 transition count 71
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 171 place count 28 transition count 57
Iterating global reduction 2 with 7 rules applied. Total rules applied 178 place count 28 transition count 57
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 185 place count 21 transition count 43
Iterating global reduction 2 with 7 rules applied. Total rules applied 192 place count 21 transition count 43
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 199 place count 21 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 199 place count 21 transition count 35
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 201 place count 20 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 203 place count 19 transition count 36
Applied a total of 203 rules in 10 ms. Remains 19 /79 variables (removed 60) and now considering 36/198 (removed 162) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 36 rows 19 cols
[2025-06-01 10:39:13] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 10:39:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:39:14] [INFO ] After 50ms 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-01 10:39:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:39:14] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 10:39:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 10:39:14] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 10:39:14] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 10:39:14] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 10:39:14] [INFO ] Flatten gal took : 2 ms
[2025-06-01 10:39:14] [INFO ] Flatten gal took : 2 ms
[2025-06-01 10:39:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5957987269447172363.gal : 1 ms
[2025-06-01 10:39:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10379092340427317527.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/ReachabilityCardinality5957987269447172363.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10379092340427317527.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/ReachabilityCardinality10379092340427317527.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 1836
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1836 after 310692
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :310692 after 2.20708e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.20708e+06 after 1.10754e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.10754e+07 after 4.8981e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.8981e+07 after 2.05226e+08
Detected timeout of ITS tools.
[2025-06-01 10:39:17] [INFO ] Flatten gal took : 10 ms
[2025-06-01 10:39:17] [INFO ] Applying decomposition
[2025-06-01 10:39:17] [INFO ] Flatten gal took : 10 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/graph13114205967901304811.txt' '-o' '/tmp/graph13114205967901304811.bin' '-w' '/tmp/graph13114205967901304811.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13114205967901304811.bin' '-l' '-1' '-v' '-w' '/tmp/graph13114205967901304811.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:39:17] [INFO ] Decomposing Gal with order
[2025-06-01 10:39:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:39:17] [INFO ] Removed a total of 334 redundant transitions.
[2025-06-01 10:39:17] [INFO ] Flatten gal took : 23 ms
[2025-06-01 10:39:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 14 ms.
[2025-06-01 10:39:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1045307210055583068.gal : 3 ms
[2025-06-01 10:39:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4930285182727584860.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/ReachabilityCardinality1045307210055583068.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4930285182727584860.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/ReachabilityCardinality4930285182727584860.prop.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.05226e+08 after 8.39009e+08
Detected timeout of ITS tools.
[2025-06-01 10:39:29] [INFO ] Flatten gal took : 2 ms
[2025-06-01 10:39:29] [INFO ] Applying decomposition
[2025-06-01 10:39:29] [INFO ] Flatten gal took : 5 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/graph9614900940693207607.txt' '-o' '/tmp/graph9614900940693207607.bin' '-w' '/tmp/graph9614900940693207607.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9614900940693207607.bin' '-l' '-1' '-v' '-w' '/tmp/graph9614900940693207607.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:39:29] [INFO ] Decomposing Gal with order
[2025-06-01 10:39:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:39:29] [INFO ] Removed a total of 42 redundant transitions.
[2025-06-01 10:39:29] [INFO ] Flatten gal took : 6 ms
[2025-06-01 10:39:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2025-06-01 10:39:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7203429822747721858.gal : 1 ms
[2025-06-01 10:39:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality302913007160889129.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/ReachabilityCardinality7203429822747721858.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality302913007160889129.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 ...306
Loading property file /tmp/ReachabilityCardinality302913007160889129.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 3221
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30275 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[781] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b016-UpperBounds-13 in 189720 ms.
Starting property specific reduction for FunctionPointer-PT-b016-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 10:39:44] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
// Phase 1: matrix 142 rows 91 cols
[2025-06-01 10:39:44] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[21] Max Struct:[+inf]
[2025-06-01 10:39:44] [INFO ] Flow matrix only has 142 transitions (discarded 86 similar events)
[2025-06-01 10:39:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 10:39:44] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:39:44] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-06-01 10:39:44] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-06-01 10:39:44] [INFO ] [Real]Added 21 Read/Feed constraints in 8 ms returned sat
[2025-06-01 10:39:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 10:39:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:44] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2025-06-01 10:39:44] [INFO ] [Nat]Added 21 Read/Feed constraints in 6 ms returned sat
[2025-06-01 10:39:44] [INFO ] Computed and/alt/rep : 63/245/58 causal constraints (skipped 82 transitions) in 13 ms.
[2025-06-01 10:39:44] [INFO ] Added : 13 causal constraints over 6 iterations in 92 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[21] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[21] Max Struct:[+inf]
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 228/228 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 89 transition count 222
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 89 transition count 222
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 87 transition count 218
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 87 transition count 218
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 85 transition count 210
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 85 transition count 210
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 83 transition count 206
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 83 transition count 206
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 81 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 81 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 79 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 79 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 78 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 78 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 77 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 77 transition count 194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 76 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 76 transition count 192
Applied a total of 30 rules in 15 ms. Remains 76 /91 variables (removed 15) and now considering 192/228 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 76/91 places, 192/228 transitions.
[2025-06-01 10:39:44] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {26=1, 54=1, 84=1, 114=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {27=1, 55=1, 101=1, 116=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 :[6]
Current structural bounds on expressions (after cover walk) : Max Seen:[21] Max Struct:[+inf]
[2025-06-01 10:39:44] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
// Phase 1: matrix 118 rows 76 cols
[2025-06-01 10:39:44] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[21] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1735 ms. (576 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 635 ms. (1572 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[859] Max Struct:[+inf]
[2025-06-01 10:39:47] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 10:39:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:39:47] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:39:47] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-06-01 10:39:47] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-01 10:39:47] [INFO ] [Real]Added 17 Read/Feed constraints in 7 ms returned sat
[2025-06-01 10:39: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-01 10:39:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:39:47] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2025-06-01 10:39:47] [INFO ] [Nat]Added 17 Read/Feed constraints in 6 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:39:47] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:39:47] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 10 ms to minimize.
[2025-06-01 10:39:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2025-06-01 10:39:47] [INFO ] Computed and/alt/rep : 57/184/51 causal constraints (skipped 65 transitions) in 12 ms.
[2025-06-01 10:39:47] [INFO ] Added : 5 causal constraints over 3 iterations in 55 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[859] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[859] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 76/76 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2025-06-01 10:39:47] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 10:39:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:39:47] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-01 10:39:47] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 10:39:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:39:47] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-01 10:39:48] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:39:48] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2025-06-01 10:39:48] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 10:39:48] [INFO ] Invariant cache hit.
[2025-06-01 10:39:48] [INFO ] State equation strengthened by 17 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 96 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6502 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 190/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:40:00] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 287 constraints, problems are : Problem set: 0 solved, 190 unsolved in 28826 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35405ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 35406ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35823 ms. Remains : 76/76 places, 192/192 transitions.
[2025-06-01 10:40:23] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {26=1, 54=1, 84=1, 114=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {27=1, 55=1, 101=1, 116=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[859] Max Struct:[+inf]
[2025-06-01 10:40:23] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 10:40:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[859] Max Struct:[+inf]
RANDOM walk for 1000004 steps (2 resets) in 1649 ms. (606 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 657 ms. (1519 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[927] Max Struct:[+inf]
[2025-06-01 10:40:26] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 10:40:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:40:26] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:40:26] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2025-06-01 10:40:26] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-01 10:40:26] [INFO ] [Real]Added 17 Read/Feed constraints in 5 ms returned sat
[2025-06-01 10:40:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:40:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:40:26] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-06-01 10:40:26] [INFO ] [Nat]Added 17 Read/Feed constraints in 5 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:40:26] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:40:26] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 7 ms to minimize.
[2025-06-01 10:40:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2025-06-01 10:40:26] [INFO ] Computed and/alt/rep : 57/184/51 causal constraints (skipped 65 transitions) in 8 ms.
[2025-06-01 10:40:26] [INFO ] Added : 5 causal constraints over 3 iterations in 47 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[927] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[927] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 14 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 76/76 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2025-06-01 10:40:26] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 10:40:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:40:26] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-01 10:40:26] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 10:40:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:40:26] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-01 10:40:26] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:40:26] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2025-06-01 10:40:26] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 10:40:26] [INFO ] Invariant cache hit.
[2025-06-01 10:40:26] [INFO ] State equation strengthened by 17 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 96 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6865 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 190/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:40:40] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 287 constraints, problems are : Problem set: 0 solved, 190 unsolved in 29794 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36724ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 36725ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37136 ms. Remains : 76/76 places, 192/192 transitions.
[2025-06-01 10:41:03] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {26=1, 54=1, 84=1, 114=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {27=1, 55=1, 101=1, 116=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[927] Max Struct:[+inf]
[2025-06-01 10:41:03] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 10:41:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[927] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1568 ms. (637 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 639 ms. (1562 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[927] Max Struct:[+inf]
[2025-06-01 10:41:06] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 10:41:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 10:41:06] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:41:06] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2025-06-01 10:41:06] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-01 10:41:06] [INFO ] [Real]Added 17 Read/Feed constraints in 9 ms returned sat
[2025-06-01 10: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-01 10:41:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 10:41:06] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2025-06-01 10:41:06] [INFO ] [Nat]Added 17 Read/Feed constraints in 6 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:41:06] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:41:06] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 10 ms to minimize.
[2025-06-01 10:41:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
[2025-06-01 10:41:06] [INFO ] Computed and/alt/rep : 57/184/51 causal constraints (skipped 65 transitions) in 13 ms.
[2025-06-01 10:41:06] [INFO ] Added : 5 causal constraints over 3 iterations in 58 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[927] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[927] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 76/76 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2025-06-01 10:41:06] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 10:41:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:41:06] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-01 10:41:06] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 10:41:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:41:06] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-01 10:41:06] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:41:06] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2025-06-01 10:41:06] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 10:41:06] [INFO ] Invariant cache hit.
[2025-06-01 10:41:06] [INFO ] State equation strengthened by 17 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 96 constraints, problems are : Problem set: 0 solved, 190 unsolved in 7193 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 190/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:41:19] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 287 constraints, problems are : Problem set: 0 solved, 190 unsolved in 28936 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36204ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 36206ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36626 ms. Remains : 76/76 places, 192/192 transitions.
[2025-06-01 10:41:43] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {26=1, 54=1, 84=1, 114=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {27=1, 55=1, 101=1, 116=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[927] Max Struct:[+inf]
[2025-06-01 10:41:43] [INFO ] Flatten gal took : 21 ms
[2025-06-01 10:41:43] [INFO ] Flatten gal took : 12 ms
[2025-06-01 10:41:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15004201158610167023.gal : 2 ms
[2025-06-01 10:41:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8373511932362048429.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/ReachabilityCardinality15004201158610167023.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8373511932362048429.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality8373511932362048429.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
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 1038
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1038 after 153131
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :153131 after 1.62427e+08
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.62427e+08 after 4.96314e+11
Interrupted probabilistic random walk after 1455802 steps, run timeout after 3001 ms. (steps per millisecond=485 ) properties seen :0 out of 1
Probabilistic random walk after 1455802 steps, saw 906127 distinct states, run finished after 3001 ms. (steps per millisecond=485 ) properties seen :0
[2025-06-01 10:41:46] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 10:41:46] [INFO ] Invariant cache hit.
[2025-06-01 10:41:46] [INFO ] State equation strengthened by 17 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) 67/71 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/76 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 94/170 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 6/176 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/176 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/187 variables, 10/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/191 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/191 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/194 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 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) 67/71 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/76 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 94/170 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/176 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/176 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/187 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/191 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/191 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/194 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 97 constraints, problems are : Problem set: 0 solved, 1 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 281ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1302 ms.
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 11 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 76/76 places, 192/192 transitions.
RANDOM walk for 40001 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1501601 steps, run timeout after 3001 ms. (steps per millisecond=500 ) properties seen :0 out of 1
Probabilistic random walk after 1501601 steps, saw 934636 distinct states, run finished after 3001 ms. (steps per millisecond=500 ) properties seen :0
[2025-06-01 10:41:51] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 10:41:51] [INFO ] Invariant cache hit.
[2025-06-01 10:41:51] [INFO ] State equation strengthened by 17 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) 67/71 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/76 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 94/170 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 6/176 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/176 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/187 variables, 10/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/191 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/191 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/194 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 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) 67/71 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/76 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 94/170 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/176 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/176 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/187 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/191 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/191 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/194 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 97 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 354ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1408 ms.
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2025-06-01 10:41:52] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 10:41:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:41:52] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-01 10:41:52] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 10:41:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 10:41:53] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-01 10:41:53] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 10:41:53] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2025-06-01 10:41:53] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2025-06-01 10:41:53] [INFO ] Invariant cache hit.
[2025-06-01 10:41:53] [INFO ] State equation strengthened by 17 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4.96314e+11 after 1.95987e+12
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.95987e+12 after 1.10918e+13
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.10918e+13 after 2.58076e+13
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.58076e+13 after 4.27323e+15
At refinement iteration 5 (OVERLAPS) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 96 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6543 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 190/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 10:42:05] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 190 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.27323e+15 after 1.76939e+16
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 287 constraints, problems are : Problem set: 0 solved, 190 unsolved in 29856 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36466ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 36467ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36815 ms. Remains : 76/76 places, 192/192 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 76 transition count 111
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 69 transition count 111
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 88 place count 69 transition count 98
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 114 place count 56 transition count 98
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 144 place count 41 transition count 83
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 151 place count 34 transition count 69
Iterating global reduction 2 with 7 rules applied. Total rules applied 158 place count 34 transition count 69
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 165 place count 27 transition count 55
Iterating global reduction 2 with 7 rules applied. Total rules applied 172 place count 27 transition count 55
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 179 place count 20 transition count 41
Iterating global reduction 2 with 7 rules applied. Total rules applied 186 place count 20 transition count 41
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 193 place count 20 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 193 place count 20 transition count 33
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 195 place count 19 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 197 place count 18 transition count 33
Applied a total of 197 rules in 26 ms. Remains 18 /76 variables (removed 58) and now considering 33/192 (removed 159) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 18 cols
[2025-06-01 10:42:29] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 10:42:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 10:42:29] [INFO ] After 37ms 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-01 10:42:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 10:42:29] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 10:42:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-01 10:42:29] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 10:42:29] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 10:42:29] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 10:42:29] [INFO ] Flatten gal took : 7 ms
[2025-06-01 10:42:29] [INFO ] Flatten gal took : 3 ms
[2025-06-01 10:42:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17226435110249619375.gal : 1 ms
[2025-06-01 10:42:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality787668796802702112.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/ReachabilityCardinality17226435110249619375.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality787668796802702112.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality787668796802702112.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 1836
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1836 after 310692
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :310692 after 2.20708e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.20708e+06 after 1.10754e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.10754e+07 after 4.8981e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.8981e+07 after 2.05226e+08
Detected timeout of ITS tools.
[2025-06-01 10:42:33] [INFO ] Flatten gal took : 8 ms
[2025-06-01 10:42:33] [INFO ] Applying decomposition
[2025-06-01 10:42:33] [INFO ] Flatten gal took : 11 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/graph12661486760015820533.txt' '-o' '/tmp/graph12661486760015820533.bin' '-w' '/tmp/graph12661486760015820533.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12661486760015820533.bin' '-l' '-1' '-v' '-w' '/tmp/graph12661486760015820533.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:42:33] [INFO ] Decomposing Gal with order
[2025-06-01 10:42:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:42:33] [INFO ] Removed a total of 325 redundant transitions.
[2025-06-01 10:42:33] [INFO ] Flatten gal took : 17 ms
[2025-06-01 10:42:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 5 ms.
[2025-06-01 10:42:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4552934131176989441.gal : 2 ms
[2025-06-01 10:42:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10591603381355327978.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/ReachabilityCardinality4552934131176989441.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10591603381355327978.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/ReachabilityCardinality10591603381355327978.prop.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.05226e+08 after 8.39009e+08
Detected timeout of ITS tools.
[2025-06-01 10:42:44] [INFO ] Flatten gal took : 2 ms
[2025-06-01 10:42:44] [INFO ] Applying decomposition
[2025-06-01 10:42:44] [INFO ] Flatten gal took : 6 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/graph1586986509104234444.txt' '-o' '/tmp/graph1586986509104234444.bin' '-w' '/tmp/graph1586986509104234444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1586986509104234444.bin' '-l' '-1' '-v' '-w' '/tmp/graph1586986509104234444.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:42:44] [INFO ] Decomposing Gal with order
[2025-06-01 10:42:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:42:44] [INFO ] Removed a total of 28 redundant transitions.
[2025-06-01 10:42:44] [INFO ] Flatten gal took : 3 ms
[2025-06-01 10:42:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2025-06-01 10:42:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12293182045847669427.gal : 4 ms
[2025-06-01 10:42:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12039323094693959195.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/ReachabilityCardinality12293182045847669427.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12039323094693959195.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality12039323094693959195.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 1139
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1139 after 30651
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30651 after 82875
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :82875 after 187323
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :187323 after 396219
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :396219 after 814011
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :814011 after 1.6496e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.6496e+06 after 3.32076e+06
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30220 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[927] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b016-UpperBounds-15 in 195627 ms.
[2025-06-01 10:42:59] [INFO ] Flatten gal took : 7 ms
[2025-06-01 10:42:59] [INFO ] Applying decomposition
[2025-06-01 10:42:59] [INFO ] Flatten gal took : 8 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/graph2542648539669292270.txt' '-o' '/tmp/graph2542648539669292270.bin' '-w' '/tmp/graph2542648539669292270.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2542648539669292270.bin' '-l' '-1' '-v' '-w' '/tmp/graph2542648539669292270.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:42:59] [INFO ] Decomposing Gal with order
[2025-06-01 10:42:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:42:59] [INFO ] Removed a total of 388 redundant transitions.
[2025-06-01 10:42:59] [INFO ] Flatten gal took : 20 ms
[2025-06-01 10:43:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 7 ms.
[2025-06-01 10:43:00] [INFO ] Time to serialize gal into /tmp/UpperBounds16572962320146566509.gal : 3 ms
[2025-06-01 10:43:00] [INFO ] Time to serialize properties into /tmp/UpperBounds10930841476053839830.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/UpperBounds16572962320146566509.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10930841476053839830.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 ...285
Loading property file /tmp/UpperBounds10930841476053839830.prop.
Detected timeout of ITS tools.
[2025-06-01 11:08:04] [INFO ] Flatten gal took : 10 ms
[2025-06-01 11:08:04] [INFO ] Time to serialize gal into /tmp/UpperBounds14636226757331403342.gal : 7 ms
[2025-06-01 11:08:04] [INFO ] Time to serialize properties into /tmp/UpperBounds13102222247128781316.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/UpperBounds14636226757331403342.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13102222247128781316.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 ...306
Loading property file /tmp/UpperBounds13102222247128781316.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-b016"
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-b016, 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-174867007400085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b016.tgz
mv FunctionPointer-PT-b016 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 ;