About the Execution of ITS-Tools for FunctionPointer-PT-c008
| 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 | FFTFFTFFTFFFF?FF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007400132.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-c008, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007400132
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.2M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c008-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748842992894
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c008
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 05:43:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 05:43:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:43:15] [INFO ] Load time of PNML (sax parser for PT used): 718 ms
[2025-06-02 05:43:15] [INFO ] Transformed 2826 places.
[2025-06-02 05:43:15] [INFO ] Transformed 8960 transitions.
[2025-06-02 05:43:15] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 932 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1198 places in 58 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c008-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 294 places :
Symmetric choice reduction at 1 with 294 rule applications. Total rules 311 place count 1317 transition count 3790
Iterating global reduction 1 with 294 rules applied. Total rules applied 605 place count 1317 transition count 3790
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Iterating post reduction 1 with 432 rules applied. Total rules applied 1037 place count 1317 transition count 3358
Discarding 148 places :
Symmetric choice reduction at 2 with 148 rule applications. Total rules 1185 place count 1169 transition count 3062
Iterating global reduction 2 with 148 rules applied. Total rules applied 1333 place count 1169 transition count 3062
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 1429 place count 1169 transition count 2966
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1443 place count 1155 transition count 2938
Iterating global reduction 3 with 14 rules applied. Total rules applied 1457 place count 1155 transition count 2938
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1470 place count 1142 transition count 2912
Iterating global reduction 3 with 13 rules applied. Total rules applied 1483 place count 1142 transition count 2912
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1496 place count 1129 transition count 2886
Iterating global reduction 3 with 13 rules applied. Total rules applied 1509 place count 1129 transition count 2886
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1522 place count 1116 transition count 2860
Iterating global reduction 3 with 13 rules applied. Total rules applied 1535 place count 1116 transition count 2860
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1548 place count 1103 transition count 2834
Iterating global reduction 3 with 13 rules applied. Total rules applied 1561 place count 1103 transition count 2834
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1574 place count 1090 transition count 2808
Iterating global reduction 3 with 13 rules applied. Total rules applied 1587 place count 1090 transition count 2808
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1600 place count 1077 transition count 2782
Iterating global reduction 3 with 13 rules applied. Total rules applied 1613 place count 1077 transition count 2782
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 1664 place count 1026 transition count 2590
Iterating global reduction 3 with 51 rules applied. Total rules applied 1715 place count 1026 transition count 2590
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 1766 place count 975 transition count 2386
Iterating global reduction 3 with 51 rules applied. Total rules applied 1817 place count 975 transition count 2386
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 1868 place count 924 transition count 2272
Iterating global reduction 3 with 51 rules applied. Total rules applied 1919 place count 924 transition count 2272
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 1970 place count 873 transition count 2170
Iterating global reduction 3 with 51 rules applied. Total rules applied 2021 place count 873 transition count 2170
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2072 place count 822 transition count 2068
Iterating global reduction 3 with 51 rules applied. Total rules applied 2123 place count 822 transition count 2068
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2174 place count 771 transition count 1966
Iterating global reduction 3 with 51 rules applied. Total rules applied 2225 place count 771 transition count 1966
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 2275 place count 721 transition count 1866
Iterating global reduction 3 with 50 rules applied. Total rules applied 2325 place count 721 transition count 1866
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2331 place count 715 transition count 1854
Iterating global reduction 3 with 6 rules applied. Total rules applied 2337 place count 715 transition count 1854
Applied a total of 2337 rules in 1908 ms. Remains 715 /1628 variables (removed 913) and now considering 1854/5962 (removed 4108) transitions.
[2025-06-02 05:43:18] [INFO ] Flow matrix only has 1243 transitions (discarded 611 similar events)
// Phase 1: matrix 1243 rows 715 cols
[2025-06-02 05:43:18] [INFO ] Computed 2 invariants in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:43:19] [INFO ] Implicit Places using invariants in 1259 ms returned []
[2025-06-02 05:43:19] [INFO ] Flow matrix only has 1243 transitions (discarded 611 similar events)
[2025-06-02 05:43:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:43:20] [INFO ] State equation strengthened by 301 read => feed constraints.
[2025-06-02 05:43:25] [INFO ] Implicit Places using invariants and state equation in 5663 ms returned []
Implicit Place search using SMT with State Equation took 6981 ms to find 0 implicit places.
Running 1852 sub problems to find dead transitions.
[2025-06-02 05:43:25] [INFO ] Flow matrix only has 1243 transitions (discarded 611 similar events)
[2025-06-02 05:43:25] [INFO ] Invariant cache hit.
[2025-06-02 05:43:25] [INFO ] State equation strengthened by 301 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/715 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/715 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1852 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 715/1958 variables, and 2 constraints, problems are : Problem set: 0 solved, 1852 unsolved in 30103 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/715 constraints, ReadFeed: 0/301 constraints, PredecessorRefiner: 1852/1852 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1852 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/715 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/715 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1852 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 715/1958 variables, and 2 constraints, problems are : Problem set: 0 solved, 1852 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/715 constraints, ReadFeed: 0/301 constraints, PredecessorRefiner: 0/1852 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65477ms problems are : Problem set: 0 solved, 1852 unsolved
Search for dead transitions found 0 dead transitions in 65519ms
Starting structural reductions in LTL mode, iteration 1 : 715/1628 places, 1854/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74451 ms. Remains : 715/1628 places, 1854/5962 transitions.
Support contains 19 out of 715 places after structural reductions.
[2025-06-02 05:44:31] [INFO ] Flatten gal took : 204 ms
[2025-06-02 05:44:31] [INFO ] Flatten gal took : 137 ms
[2025-06-02 05:44:31] [INFO ] Input system was already deterministic with 1854 transitions.
RANDOM walk for 40004 steps (8 resets) in 2434 ms. (16 steps per ms) remains 13/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 392 ms. (101 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 496 ms. (80 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
[2025-06-02 05:44:32] [INFO ] Flow matrix only has 1243 transitions (discarded 611 similar events)
[2025-06-02 05:44:32] [INFO ] Invariant cache hit.
[2025-06-02 05:44:32] [INFO ] State equation strengthened by 301 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 382/390 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1308/1698 variables, 536/544 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1698 variables, 301/845 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1698 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1760 variables, 1/846 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1760 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/1761 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1761 variables, 1/848 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1761 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 190/1951 variables, 165/1013 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1951 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 6/1957 variables, 4/1017 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1957 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1/1958 variables, 1/1018 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1958 variables, 0/1018 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/1958 variables, 0/1018 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1958/1958 variables, and 1018 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2353 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 715/715 constraints, ReadFeed: 301/301 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 382/390 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1308/1698 variables, 536/544 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1698 variables, 301/845 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1698 variables, 7/852 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1698 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 62/1760 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:40] [INFO ] Deduced a trap along path composed of 3 places in 142 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1760/1958 variables, and 854 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 544/715 constraints, ReadFeed: 301/301 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7436ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 715 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 715/715 places, 1854/1854 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 708 transition count 1838
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 708 transition count 1838
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 702 transition count 1822
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 702 transition count 1822
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 696 transition count 1802
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 696 transition count 1802
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 690 transition count 1784
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 690 transition count 1784
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 684 transition count 1772
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 684 transition count 1772
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 678 transition count 1760
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 678 transition count 1760
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 80 place count 672 transition count 1748
Iterating global reduction 0 with 6 rules applied. Total rules applied 86 place count 672 transition count 1748
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 667 transition count 1736
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 667 transition count 1736
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 100 place count 663 transition count 1726
Iterating global reduction 0 with 4 rules applied. Total rules applied 104 place count 663 transition count 1726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 662 transition count 1724
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 662 transition count 1724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 661 transition count 1722
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 661 transition count 1722
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 660 transition count 1720
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 660 transition count 1720
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 659 transition count 1718
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 659 transition count 1718
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 658 transition count 1716
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 658 transition count 1716
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 128 place count 658 transition count 1702
Applied a total of 128 rules in 843 ms. Remains 658 /715 variables (removed 57) and now considering 1702/1854 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 844 ms. Remains : 658/715 places, 1702/1854 transitions.
RANDOM walk for 40000 steps (8 resets) in 320 ms. (124 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 145033 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 7
Probabilistic random walk after 145033 steps, saw 94158 distinct states, run finished after 3013 ms. (steps per millisecond=48 ) properties seen :0
[2025-06-02 05:44:44] [INFO ] Flow matrix only has 1140 transitions (discarded 562 similar events)
// Phase 1: matrix 1140 rows 658 cols
[2025-06-02 05:44:44] [INFO ] Computed 2 invariants in 15 ms
[2025-06-02 05:44:44] [INFO ] State equation strengthened by 280 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 361/369 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/369 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1212/1581 variables, 503/511 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1581 variables, 280/791 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1581 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1643 variables, 1/792 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1643 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/1644 variables, 1/793 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1644 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1644 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 154/1798 variables, 146/940 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1798 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/1798 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1798/1798 variables, and 940 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2379 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 658/658 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 361/369 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/369 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1212/1581 variables, 503/511 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1581 variables, 280/791 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1581 variables, 7/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1581 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 62/1643 variables, 1/799 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:50] [INFO ] Deduced a trap along path composed of 3 places in 107 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:50] [INFO ] Deduced a trap along path composed of 3 places in 101 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:51] [INFO ] Deduced a trap along path composed of 3 places in 99 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:51] [INFO ] Deduced a trap along path composed of 3 places in 112 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:51] [INFO ] Deduced a trap along path composed of 3 places in 100 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:51] [INFO ] Deduced a trap along path composed of 3 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:51] [INFO ] Deduced a trap along path composed of 3 places in 90 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:51] [INFO ] Deduced a trap along path composed of 3 places in 89 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:52] [INFO ] Deduced a trap along path composed of 3 places in 91 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:52] [INFO ] Deduced a trap along path composed of 3 places in 91 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:52] [INFO ] Deduced a trap along path composed of 3 places in 84 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:52] [INFO ] Deduced a trap along path composed of 3 places in 88 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:52] [INFO ] Deduced a trap along path composed of 3 places in 80 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:52] [INFO ] Deduced a trap along path composed of 3 places in 81 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:52] [INFO ] Deduced a trap along path composed of 3 places in 76 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:53] [INFO ] Deduced a trap along path composed of 3 places in 74 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:53] [INFO ] Deduced a trap along path composed of 3 places in 72 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:53] [INFO ] Deduced a trap along path composed of 3 places in 82 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:53] [INFO ] Deduced a trap along path composed of 3 places in 74 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:53] [INFO ] Deduced a trap along path composed of 3 places in 71 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1643 variables, 20/819 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:54] [INFO ] Deduced a trap along path composed of 3 places in 71 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:54] [INFO ] Deduced a trap along path composed of 3 places in 84 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:54] [INFO ] Deduced a trap along path composed of 3 places in 79 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:55] [INFO ] Deduced a trap along path composed of 3 places in 70 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:55] [INFO ] Deduced a trap along path composed of 3 places in 67 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:55] [INFO ] Deduced a trap along path composed of 3 places in 64 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:55] [INFO ] Deduced a trap along path composed of 3 places in 60 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:55] [INFO ] Deduced a trap along path composed of 3 places in 60 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:55] [INFO ] Deduced a trap along path composed of 3 places in 59 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:55] [INFO ] Deduced a trap along path composed of 3 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:55] [INFO ] Deduced a trap along path composed of 3 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:56] [INFO ] Deduced a trap along path composed of 3 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:56] [INFO ] Deduced a trap along path composed of 3 places in 56 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:56] [INFO ] Deduced a trap along path composed of 3 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:56] [INFO ] Deduced a trap along path composed of 3 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:56] [INFO ] Deduced a trap along path composed of 3 places in 49 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:56] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:56] [INFO ] Deduced a trap along path composed of 3 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:56] [INFO ] Deduced a trap along path composed of 3 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:57] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1643 variables, 20/839 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:57] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:58] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:58] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:58] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:58] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:58] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:58] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:58] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:58] [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-02 05:44:58] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:58] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:58] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:59] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:59] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:59] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:44:59] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1643 variables, 16/855 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1643 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 1/1644 variables, 1/856 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1644 variables, 1/857 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1644 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 154/1798 variables, 146/1003 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:04] [INFO ] Deduced a trap composed of 131 places in 318 ms of which 11 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1798 variables, 1/1004 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:06] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1798 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1798 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:10] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/1798 variables, 1/1006 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1798 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 0/1798 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1798/1798 variables, and 1006 constraints, problems are : Problem set: 0 solved, 7 unsolved in 29406 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 658/658 constraints, ReadFeed: 280/280 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 58/58 constraints]
After SMT, in 31844ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 6 properties in 1228 ms.
Support contains 2 out of 658 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 658/658 places, 1702/1702 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 653 transition count 1692
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 653 transition count 1692
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 648 transition count 1680
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 648 transition count 1680
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 643 transition count 1662
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 643 transition count 1662
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 638 transition count 1652
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 638 transition count 1652
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 633 transition count 1642
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 633 transition count 1642
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 628 transition count 1632
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 628 transition count 1632
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 623 transition count 1622
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 623 transition count 1622
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 618 transition count 1612
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 618 transition count 1612
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 614 transition count 1604
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 614 transition count 1604
Applied a total of 88 rules in 327 ms. Remains 614 /658 variables (removed 44) and now considering 1604/1702 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 614/658 places, 1604/1702 transitions.
RANDOM walk for 40002 steps (9 resets) in 319 ms. (125 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 335098 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 335098 steps, saw 217508 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2025-06-02 05:45:21] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2025-06-02 05:45:21] [INFO ] Computed 2 invariants in 8 ms
[2025-06-02 05:45:21] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1537 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1537 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/1677 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 895 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 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 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1537 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:27] [INFO ] Deduced a trap along path composed of 3 places in 98 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:27] [INFO ] Deduced a trap along path composed of 3 places in 92 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:27] [INFO ] Deduced a trap along path composed of 3 places in 93 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:27] [INFO ] Deduced a trap along path composed of 3 places in 95 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:27] [INFO ] Deduced a trap along path composed of 3 places in 91 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:28] [INFO ] Deduced a trap along path composed of 3 places in 87 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:28] [INFO ] Deduced a trap along path composed of 3 places in 111 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:28] [INFO ] Deduced a trap along path composed of 3 places in 94 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:28] [INFO ] Deduced a trap along path composed of 3 places in 89 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:28] [INFO ] Deduced a trap along path composed of 3 places in 85 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:28] [INFO ] Deduced a trap along path composed of 3 places in 78 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:29] [INFO ] Deduced a trap along path composed of 3 places in 81 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:29] [INFO ] Deduced a trap along path composed of 3 places in 98 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:29] [INFO ] Deduced a trap along path composed of 3 places in 87 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:29] [INFO ] Deduced a trap along path composed of 3 places in 96 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:29] [INFO ] Deduced a trap along path composed of 3 places in 87 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:29] [INFO ] Deduced a trap along path composed of 3 places in 79 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:29] [INFO ] Deduced a trap along path composed of 3 places in 77 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:30] [INFO ] Deduced a trap along path composed of 3 places in 68 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:30] [INFO ] Deduced a trap along path composed of 3 places in 65 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1537 variables, 20/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:30] [INFO ] Deduced a trap along path composed of 3 places in 66 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:30] [INFO ] Deduced a trap along path composed of 3 places in 63 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:30] [INFO ] Deduced a trap along path composed of 3 places in 77 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:30] [INFO ] Deduced a trap along path composed of 3 places in 64 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:31] [INFO ] Deduced a trap along path composed of 3 places in 62 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:31] [INFO ] Deduced a trap along path composed of 3 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:31] [INFO ] Deduced a trap along path composed of 3 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:31] [INFO ] Deduced a trap along path composed of 3 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:31] [INFO ] Deduced a trap along path composed of 3 places in 54 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:31] [INFO ] Deduced a trap along path composed of 3 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:31] [INFO ] Deduced a trap along path composed of 3 places in 60 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:31] [INFO ] Deduced a trap along path composed of 3 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:32] [INFO ] Deduced a trap along path composed of 3 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:32] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:32] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:32] [INFO ] Deduced a trap along path composed of 3 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:32] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:32] [INFO ] Deduced a trap along path composed of 3 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:32] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:32] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1537 variables, 20/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:33] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:33] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:33] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:33] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:33] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:33] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:33] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:33] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:33] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:33] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:33] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:34] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:34] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:34] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:34] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:34] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1537 variables, 16/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1537 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1538 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1538 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1538 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 139/1677 variables, 135/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:35] [INFO ] Deduced a trap composed of 131 places in 303 ms of which 9 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1677 variables, 1/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:35] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:45:35] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1677 variables, 2/936 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1677 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 5/1682 variables, 3/939 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1682 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/1685 variables, 2/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1685 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1685 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 941 constraints, problems are : Problem set: 0 solved, 1 unsolved in 14603 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 58/58 constraints]
After SMT, in 15531ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 101 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 100 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2025-06-02 05:45:36] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 05:45:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:45:37] [INFO ] Implicit Places using invariants in 639 ms returned []
[2025-06-02 05:45:37] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 05:45:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:45:37] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 05:45:40] [INFO ] Implicit Places using invariants and state equation in 3342 ms returned []
Implicit Place search using SMT with State Equation took 3983 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:45:40] [INFO ] Redundant transitions in 136 ms returned []
Running 1602 sub problems to find dead transitions.
[2025-06-02 05:45:40] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 05:45:40] [INFO ] Invariant cache hit.
[2025-06-02 05:45:40] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 5.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63437ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 63443ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67679 ms. Remains : 614/614 places, 1604/1604 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((((p0 U p1)&&F((!p2&&G(!p3)))) U X(X(p0)))))'
Support contains 6 out of 715 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 715/715 places, 1854/1854 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 703 transition count 1828
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 703 transition count 1828
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 692 transition count 1802
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 692 transition count 1802
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 681 transition count 1762
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 681 transition count 1762
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 670 transition count 1724
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 670 transition count 1724
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 101 place count 659 transition count 1702
Iterating global reduction 0 with 11 rules applied. Total rules applied 112 place count 659 transition count 1702
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 123 place count 648 transition count 1680
Iterating global reduction 0 with 11 rules applied. Total rules applied 134 place count 648 transition count 1680
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 145 place count 637 transition count 1658
Iterating global reduction 0 with 11 rules applied. Total rules applied 156 place count 637 transition count 1658
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 166 place count 627 transition count 1636
Iterating global reduction 0 with 10 rules applied. Total rules applied 176 place count 627 transition count 1636
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 185 place count 618 transition count 1616
Iterating global reduction 0 with 9 rules applied. Total rules applied 194 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 195 place count 617 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 196 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 197 place count 616 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 198 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 199 place count 615 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 200 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 201 place count 614 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 202 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 203 place count 613 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 204 place count 613 transition count 1606
Applied a total of 204 rules in 310 ms. Remains 613 /715 variables (removed 102) and now considering 1606/1854 (removed 248) transitions.
[2025-06-02 05:46:45] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2025-06-02 05:46:45] [INFO ] Computed 2 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:46:45] [INFO ] Implicit Places using invariants in 738 ms returned []
[2025-06-02 05:46:45] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2025-06-02 05:46:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:46:46] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 05:46:49] [INFO ] Implicit Places using invariants and state equation in 3389 ms returned []
Implicit Place search using SMT with State Equation took 4128 ms to find 0 implicit places.
Running 1604 sub problems to find dead transitions.
[2025-06-02 05:46:49] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2025-06-02 05:46:49] [INFO ] Invariant cache hit.
[2025-06-02 05:46:49] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 5.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 613/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63452ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 63458ms
Starting structural reductions in LTL mode, iteration 1 : 613/715 places, 1606/1854 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67907 ms. Remains : 613/715 places, 1606/1854 transitions.
Stuttering acceptance computed with spot in 913 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p3), (NOT p0), (OR (AND (NOT p0) p2) (AND (NOT p0) p3)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p0) p3), (OR (AND (NOT p0) p2) (AND (NOT p0) p3)), (NOT p0), (AND (NOT p0) p3), (NOT p0), (OR (AND (NOT p0) p3) (AND (NOT p0) p2)), (OR p3 p2), p3]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-01 finished in 68967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1))))'
Support contains 4 out of 715 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 715/715 places, 1854/1854 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 704 transition count 1830
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 704 transition count 1830
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 693 transition count 1802
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 693 transition count 1802
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 682 transition count 1762
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 682 transition count 1762
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 77 place count 671 transition count 1726
Iterating global reduction 0 with 11 rules applied. Total rules applied 88 place count 671 transition count 1726
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 99 place count 660 transition count 1704
Iterating global reduction 0 with 11 rules applied. Total rules applied 110 place count 660 transition count 1704
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 121 place count 649 transition count 1682
Iterating global reduction 0 with 11 rules applied. Total rules applied 132 place count 649 transition count 1682
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 143 place count 638 transition count 1660
Iterating global reduction 0 with 11 rules applied. Total rules applied 154 place count 638 transition count 1660
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 164 place count 628 transition count 1638
Iterating global reduction 0 with 10 rules applied. Total rules applied 174 place count 628 transition count 1638
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 182 place count 620 transition count 1620
Iterating global reduction 0 with 8 rules applied. Total rules applied 190 place count 620 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 191 place count 619 transition count 1618
Iterating global reduction 0 with 1 rules applied. Total rules applied 192 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 193 place count 618 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 194 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 195 place count 617 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 196 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 197 place count 616 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 198 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 199 place count 615 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 200 place count 615 transition count 1610
Applied a total of 200 rules in 333 ms. Remains 615 /715 variables (removed 100) and now considering 1610/1854 (removed 244) transitions.
[2025-06-02 05:47:53] [INFO ] Flow matrix only has 1076 transitions (discarded 534 similar events)
// Phase 1: matrix 1076 rows 615 cols
[2025-06-02 05:47:53] [INFO ] Computed 2 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:47:54] [INFO ] Implicit Places using invariants in 723 ms returned []
[2025-06-02 05:47:54] [INFO ] Flow matrix only has 1076 transitions (discarded 534 similar events)
[2025-06-02 05:47:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:47:55] [INFO ] State equation strengthened by 267 read => feed constraints.
[2025-06-02 05:47:57] [INFO ] Implicit Places using invariants and state equation in 3222 ms returned []
Implicit Place search using SMT with State Equation took 3951 ms to find 0 implicit places.
Running 1608 sub problems to find dead transitions.
[2025-06-02 05:47:57] [INFO ] Flow matrix only has 1076 transitions (discarded 534 similar events)
[2025-06-02 05:47:57] [INFO ] Invariant cache hit.
[2025-06-02 05:47:57] [INFO ] State equation strengthened by 267 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1691 variables, and 2 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 615/1691 variables, and 2 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63771ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 63777ms
Starting structural reductions in LTL mode, iteration 1 : 615/715 places, 1610/1854 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68066 ms. Remains : 615/715 places, 1610/1854 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 1178 ms.
Product exploration explored 100000 steps with 33333 reset in 1023 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 29 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c008-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c008-LTLFireability-05 finished in 70508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 715 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 715/715 places, 1854/1854 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 703 transition count 1828
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 703 transition count 1828
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 692 transition count 1800
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 692 transition count 1800
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 681 transition count 1760
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 681 transition count 1760
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 670 transition count 1724
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 670 transition count 1724
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 101 place count 659 transition count 1702
Iterating global reduction 0 with 11 rules applied. Total rules applied 112 place count 659 transition count 1702
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 123 place count 648 transition count 1680
Iterating global reduction 0 with 11 rules applied. Total rules applied 134 place count 648 transition count 1680
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 145 place count 637 transition count 1658
Iterating global reduction 0 with 11 rules applied. Total rules applied 156 place count 637 transition count 1658
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 166 place count 627 transition count 1636
Iterating global reduction 0 with 10 rules applied. Total rules applied 176 place count 627 transition count 1636
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 184 place count 619 transition count 1618
Iterating global reduction 0 with 8 rules applied. Total rules applied 192 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 193 place count 618 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 194 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 195 place count 617 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 196 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 197 place count 616 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 198 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 199 place count 615 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 200 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 201 place count 614 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 202 place count 614 transition count 1608
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 206 place count 614 transition count 1604
Applied a total of 206 rules in 707 ms. Remains 614 /715 variables (removed 101) and now considering 1604/1854 (removed 250) transitions.
[2025-06-02 05:49:04] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2025-06-02 05:49:04] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:49:05] [INFO ] Implicit Places using invariants in 892 ms returned []
[2025-06-02 05:49:05] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 05:49:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:49:06] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 05:49:10] [INFO ] Implicit Places using invariants and state equation in 4319 ms returned []
Implicit Place search using SMT with State Equation took 5213 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:49:10] [INFO ] Redundant transitions in 136 ms returned []
Running 1602 sub problems to find dead transitions.
[2025-06-02 05:49:10] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 05:49:10] [INFO ] Invariant cache hit.
[2025-06-02 05:49:10] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63776ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 63781ms
Starting structural reductions in SI_LTL mode, iteration 1 : 614/715 places, 1604/1854 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69849 ms. Remains : 614/715 places, 1604/1854 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 793 ms.
Stack based approach found an accepted trace after 1468 steps with 0 reset with depth 1469 and stack size 1469 in 14 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-06 finished in 70727 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(G(p1))&&p0)))))'
Support contains 3 out of 715 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 715/715 places, 1854/1854 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 704 transition count 1830
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 704 transition count 1830
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 694 transition count 1806
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 694 transition count 1806
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 684 transition count 1770
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 684 transition count 1770
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 674 transition count 1736
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 674 transition count 1736
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 664 transition count 1716
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 664 transition count 1716
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 654 transition count 1696
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 654 transition count 1696
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 644 transition count 1676
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 644 transition count 1676
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 151 place count 635 transition count 1656
Iterating global reduction 0 with 9 rules applied. Total rules applied 160 place count 635 transition count 1656
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 168 place count 627 transition count 1638
Iterating global reduction 0 with 8 rules applied. Total rules applied 176 place count 627 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 177 place count 626 transition count 1636
Iterating global reduction 0 with 1 rules applied. Total rules applied 178 place count 626 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 179 place count 625 transition count 1634
Iterating global reduction 0 with 1 rules applied. Total rules applied 180 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 181 place count 624 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 182 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 183 place count 623 transition count 1630
Iterating global reduction 0 with 1 rules applied. Total rules applied 184 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 185 place count 622 transition count 1628
Iterating global reduction 0 with 1 rules applied. Total rules applied 186 place count 622 transition count 1628
Applied a total of 186 rules in 335 ms. Remains 622 /715 variables (removed 93) and now considering 1628/1854 (removed 226) transitions.
[2025-06-02 05:50:15] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
// Phase 1: matrix 1087 rows 622 cols
[2025-06-02 05:50:15] [INFO ] Computed 2 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:50:16] [INFO ] Implicit Places using invariants in 928 ms returned []
[2025-06-02 05:50:16] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2025-06-02 05:50:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:50:16] [INFO ] State equation strengthened by 268 read => feed constraints.
[2025-06-02 05:50:20] [INFO ] Implicit Places using invariants and state equation in 4731 ms returned []
Implicit Place search using SMT with State Equation took 5663 ms to find 0 implicit places.
Running 1626 sub problems to find dead transitions.
[2025-06-02 05:50:20] [INFO ] Flow matrix only has 1087 transitions (discarded 541 similar events)
[2025-06-02 05:50:20] [INFO ] Invariant cache hit.
[2025-06-02 05:50:20] [INFO ] State equation strengthened by 268 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1709 variables, and 2 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1626/1626 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1626 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1626 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 7)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1709 variables, and 2 constraints, problems are : Problem set: 0 solved, 1626 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 0/1626 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63646ms problems are : Problem set: 0 solved, 1626 unsolved
Search for dead transitions found 0 dead transitions in 63651ms
Starting structural reductions in LTL mode, iteration 1 : 622/715 places, 1628/1854 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69655 ms. Remains : 622/715 places, 1628/1854 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 715 ms.
Stack based approach found an accepted trace after 1443 steps with 0 reset with depth 1444 and stack size 1444 in 16 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-07 finished in 70628 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 715 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 715/715 places, 1854/1854 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 703 transition count 1828
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 703 transition count 1828
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 692 transition count 1800
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 692 transition count 1800
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 681 transition count 1760
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 681 transition count 1760
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 670 transition count 1724
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 670 transition count 1724
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 101 place count 659 transition count 1702
Iterating global reduction 0 with 11 rules applied. Total rules applied 112 place count 659 transition count 1702
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 123 place count 648 transition count 1680
Iterating global reduction 0 with 11 rules applied. Total rules applied 134 place count 648 transition count 1680
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 145 place count 637 transition count 1658
Iterating global reduction 0 with 11 rules applied. Total rules applied 156 place count 637 transition count 1658
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 166 place count 627 transition count 1636
Iterating global reduction 0 with 10 rules applied. Total rules applied 176 place count 627 transition count 1636
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 184 place count 619 transition count 1618
Iterating global reduction 0 with 8 rules applied. Total rules applied 192 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 193 place count 618 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 194 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 195 place count 617 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 196 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 197 place count 616 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 198 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 199 place count 615 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 200 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 201 place count 614 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 202 place count 614 transition count 1608
Applied a total of 202 rules in 330 ms. Remains 614 /715 variables (removed 101) and now considering 1608/1854 (removed 246) transitions.
[2025-06-02 05:51:25] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2025-06-02 05:51:25] [INFO ] Computed 2 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:51:26] [INFO ] Implicit Places using invariants in 911 ms returned []
[2025-06-02 05:51:26] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 05:51:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:51:27] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 05:51:31] [INFO ] Implicit Places using invariants and state equation in 4434 ms returned []
Implicit Place search using SMT with State Equation took 5349 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2025-06-02 05:51:31] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2025-06-02 05:51:31] [INFO ] Invariant cache hit.
[2025-06-02 05:51:31] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 5.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63886ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 63890ms
Starting structural reductions in LTL mode, iteration 1 : 614/715 places, 1608/1854 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69575 ms. Remains : 614/715 places, 1608/1854 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-11 finished in 69691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G(p1)||G(F(p2))||G(p0))))'
Support contains 5 out of 715 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 715/715 places, 1854/1854 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 705 transition count 1832
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 705 transition count 1832
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 696 transition count 1808
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 696 transition count 1808
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 687 transition count 1776
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 687 transition count 1776
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 678 transition count 1748
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 678 transition count 1748
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 83 place count 669 transition count 1730
Iterating global reduction 0 with 9 rules applied. Total rules applied 92 place count 669 transition count 1730
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 101 place count 660 transition count 1712
Iterating global reduction 0 with 9 rules applied. Total rules applied 110 place count 660 transition count 1712
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 119 place count 651 transition count 1694
Iterating global reduction 0 with 9 rules applied. Total rules applied 128 place count 651 transition count 1694
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 136 place count 643 transition count 1676
Iterating global reduction 0 with 8 rules applied. Total rules applied 144 place count 643 transition count 1676
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 150 place count 637 transition count 1662
Iterating global reduction 0 with 6 rules applied. Total rules applied 156 place count 637 transition count 1662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 157 place count 636 transition count 1660
Iterating global reduction 0 with 1 rules applied. Total rules applied 158 place count 636 transition count 1660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 159 place count 635 transition count 1658
Iterating global reduction 0 with 1 rules applied. Total rules applied 160 place count 635 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 161 place count 634 transition count 1656
Iterating global reduction 0 with 1 rules applied. Total rules applied 162 place count 634 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 163 place count 633 transition count 1654
Iterating global reduction 0 with 1 rules applied. Total rules applied 164 place count 633 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 165 place count 632 transition count 1652
Iterating global reduction 0 with 1 rules applied. Total rules applied 166 place count 632 transition count 1652
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 174 place count 632 transition count 1644
Applied a total of 174 rules in 586 ms. Remains 632 /715 variables (removed 83) and now considering 1644/1854 (removed 210) transitions.
[2025-06-02 05:52:35] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
// Phase 1: matrix 1099 rows 632 cols
[2025-06-02 05:52:35] [INFO ] Computed 2 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:52:36] [INFO ] Implicit Places using invariants in 839 ms returned []
[2025-06-02 05:52:36] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-02 05:52:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:52:37] [INFO ] State equation strengthened by 271 read => feed constraints.
[2025-06-02 05:52:41] [INFO ] Implicit Places using invariants and state equation in 4633 ms returned []
Implicit Place search using SMT with State Equation took 5474 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:52:41] [INFO ] Redundant transitions in 71 ms returned []
Running 1642 sub problems to find dead transitions.
[2025-06-02 05:52:41] [INFO ] Flow matrix only has 1099 transitions (discarded 545 similar events)
[2025-06-02 05:52:41] [INFO ] Invariant cache hit.
[2025-06-02 05:52:41] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/1731 variables, and 2 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/632 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1642/1642 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1642 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/1731 variables, and 2 constraints, problems are : Problem set: 0 solved, 1642 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/632 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 0/1642 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63705ms problems are : Problem set: 0 solved, 1642 unsolved
Search for dead transitions found 0 dead transitions in 63710ms
Starting structural reductions in SI_LTL mode, iteration 1 : 632/715 places, 1644/1854 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69854 ms. Remains : 632/715 places, 1644/1854 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 746 ms.
Stack based approach found an accepted trace after 3455 steps with 0 reset with depth 3456 and stack size 3456 in 32 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c008-LTLFireability-12 finished in 70833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 715 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 715/715 places, 1854/1854 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 704 transition count 1830
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 704 transition count 1830
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 694 transition count 1804
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 694 transition count 1804
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 684 transition count 1766
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 684 transition count 1766
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 674 transition count 1732
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 674 transition count 1732
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 664 transition count 1712
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 664 transition count 1712
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 112 place count 654 transition count 1692
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 654 transition count 1692
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 644 transition count 1672
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 644 transition count 1672
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 151 place count 635 transition count 1654
Iterating global reduction 0 with 9 rules applied. Total rules applied 160 place count 635 transition count 1654
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 167 place count 628 transition count 1640
Iterating global reduction 0 with 7 rules applied. Total rules applied 174 place count 628 transition count 1640
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 180 place count 628 transition count 1634
Applied a total of 180 rules in 458 ms. Remains 628 /715 variables (removed 87) and now considering 1634/1854 (removed 220) transitions.
[2025-06-02 05:53:46] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2025-06-02 05:53:46] [INFO ] Computed 2 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:53:47] [INFO ] Implicit Places using invariants in 836 ms returned []
[2025-06-02 05:53:47] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2025-06-02 05:53:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:53:47] [INFO ] State equation strengthened by 269 read => feed constraints.
[2025-06-02 05:53:50] [INFO ] Implicit Places using invariants and state equation in 3573 ms returned []
Implicit Place search using SMT with State Equation took 4411 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:53:50] [INFO ] Redundant transitions in 56 ms returned []
Running 1632 sub problems to find dead transitions.
[2025-06-02 05:53:50] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2025-06-02 05:53:50] [INFO ] Invariant cache hit.
[2025-06-02 05:53:50] [INFO ] State equation strengthened by 269 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/1719 variables, and 2 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/628 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1632 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 7)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 628/1719 variables, and 2 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/628 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 0/1632 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64135ms problems are : Problem set: 0 solved, 1632 unsolved
Search for dead transitions found 0 dead transitions in 64139ms
Starting structural reductions in SI_LTL mode, iteration 1 : 628/715 places, 1634/1854 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69073 ms. Remains : 628/715 places, 1634/1854 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 886 ms.
Product exploration explored 100000 steps with 0 reset in 1032 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 122 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40010 steps (8 resets) in 703 ms. (56 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
[2025-06-02 05:54:57] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2025-06-02 05:54:57] [INFO ] Invariant cache hit.
[2025-06-02 05:54:57] [INFO ] State equation strengthened by 269 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 62/1560 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1560 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/1704 variables, 137/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1704 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 9/1713 variables, 5/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1713 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 6/1719 variables, 4/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1719/1719 variables, and 899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1219 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:59] [INFO ] Deduced a trap along path composed of 3 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:59] [INFO ] Deduced a trap along path composed of 3 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:54:59] [INFO ] Deduced a trap along path composed of 3 places in 49 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:00] [INFO ] Deduced a trap along path composed of 3 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:00] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:00] [INFO ] Deduced a trap along path composed of 3 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:00] [INFO ] Deduced a trap along path composed of 3 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:00] [INFO ] Deduced a trap along path composed of 3 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:00] [INFO ] Deduced a trap along path composed of 3 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:00] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:00] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:00] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:00] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:00] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:00] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:00] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:01] [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-02 05:55:01] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:01] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:01] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1498 variables, 20/773 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:01] [INFO ] Deduced a trap along path composed of 3 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:01] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:01] [INFO ] Deduced a trap along path composed of 3 places in 76 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:01] [INFO ] Deduced a trap along path composed of 3 places in 65 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:01] [INFO ] Deduced a trap along path composed of 3 places in 84 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:01] [INFO ] Deduced a trap along path composed of 3 places in 51 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:02] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:02] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:02] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:02] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:02] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:02] [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-02 05:55:02] [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-02 05:55:02] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:02] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:02] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:02] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:02] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:03] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:03] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1498 variables, 20/793 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:03] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:03] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:03] [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-02 05:55:03] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:03] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:03] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:03] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
SMT process timed out in 6265ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 101 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 628/628 places, 1634/1634 transitions.
RANDOM walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 181829 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 2
Probabilistic random walk after 181829 steps, saw 118037 distinct states, run finished after 3004 ms. (steps per millisecond=60 ) properties seen :0
[2025-06-02 05:55:07] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2025-06-02 05:55:07] [INFO ] Invariant cache hit.
[2025-06-02 05:55:07] [INFO ] State equation strengthened by 269 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 62/1560 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1560 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/1704 variables, 137/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1704 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 9/1713 variables, 5/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1713 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 6/1719 variables, 4/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1719/1719 variables, and 899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1220 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:09] [INFO ] Deduced a trap along path composed of 3 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:09] [INFO ] Deduced a trap along path composed of 3 places in 50 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:09] [INFO ] Deduced a trap along path composed of 3 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:09] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:09] [INFO ] Deduced a trap along path composed of 3 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:09] [INFO ] Deduced a trap along path composed of 3 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:09] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:09] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:09] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:10] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:10] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:10] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:10] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:10] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:10] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:10] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:10] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:10] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:10] [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-02 05:55:10] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1498 variables, 20/773 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:11] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:11] [INFO ] Deduced a trap along path composed of 3 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:11] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:11] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:11] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:11] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:11] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:11] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:11] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:12] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:12] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:12] [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-02 05:55:12] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:12] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:12] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:12] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:12] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:12] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:12] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:12] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1498 variables, 20/793 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:13] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:13] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:13] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:13] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:13] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:13] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:13] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:13] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:13] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1498 variables, 9/802 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:14] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:14] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:14] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:14] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:14] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:14] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1498 variables, 6/808 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:15] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:15] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:15] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:15] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:15] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:15] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1498 variables, 6/814 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:15] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1498 variables, 1/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1498 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 62/1560 variables, 1/816 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:16] [INFO ] Deduced a trap composed of 131 places in 310 ms of which 10 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1560 variables, 1/817 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:17] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:55:17] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1560 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1560 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 144/1704 variables, 137/956 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1704 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 9/1713 variables, 5/961 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1713 variables, 0/961 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 6/1719 variables, 4/965 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1719 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1719 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 965 constraints, problems are : Problem set: 0 solved, 2 unsolved in 10879 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 64/64 constraints]
After SMT, in 12129ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 380 ms.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 99 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 628/628 places, 1634/1634 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 101 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2025-06-02 05:55:19] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2025-06-02 05:55:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:55:20] [INFO ] Implicit Places using invariants in 810 ms returned []
[2025-06-02 05:55:20] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2025-06-02 05:55:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:55:21] [INFO ] State equation strengthened by 269 read => feed constraints.
[2025-06-02 05:55:24] [INFO ] Implicit Places using invariants and state equation in 3654 ms returned []
Implicit Place search using SMT with State Equation took 4466 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:55:24] [INFO ] Redundant transitions in 57 ms returned []
Running 1632 sub problems to find dead transitions.
[2025-06-02 05:55:24] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2025-06-02 05:55:24] [INFO ] Invariant cache hit.
[2025-06-02 05:55:24] [INFO ] State equation strengthened by 269 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/1719 variables, and 2 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/628 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1632 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 628/1719 variables, and 2 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/628 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 0/1632 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64406ms problems are : Problem set: 0 solved, 1632 unsolved
Search for dead transitions found 0 dead transitions in 64414ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69051 ms. Remains : 628/628 places, 1634/1634 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 966 edges and 628 vertex of which 192 / 628 are part of one of the 64 SCC in 3 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 415 transitions
Reduce isomorphic transitions removed 735 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 500 transition count 884
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 485 transition count 884
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 31 place count 485 transition count 808
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 183 place count 409 transition count 808
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 246 place count 346 transition count 745
Iterating global reduction 2 with 63 rules applied. Total rules applied 309 place count 346 transition count 745
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 435 place count 346 transition count 619
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 691 place count 218 transition count 491
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 154 transition count 363
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 154 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 154 transition count 362
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 91 transition count 236
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 91 transition count 236
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 28 transition count 110
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 28 transition count 110
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 28 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 28 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1137 place count 27 transition count 46
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 5 with 2 rules applied. Total rules applied 1139 place count 26 transition count 45
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 5 with 4 rules applied. Total rules applied 1143 place count 24 transition count 45
Applied a total of 1143 rules in 123 ms. Remains 24 /628 variables (removed 604) and now considering 45/1634 (removed 1589) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 45 rows 24 cols
[2025-06-02 05:56:29] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 05:56:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:56:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 05:56:29] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 05:56:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:56:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-02 05:56:29] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-06-02 05:56:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 05:56:29] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-02 05:56:29] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-02 05:56:29] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 372 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 176 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 114 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2025-06-02 05:56:29] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
// Phase 1: matrix 1091 rows 628 cols
[2025-06-02 05:56:29] [INFO ] Computed 2 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:56:30] [INFO ] Implicit Places using invariants in 772 ms returned []
[2025-06-02 05:56:30] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2025-06-02 05:56:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:56:31] [INFO ] State equation strengthened by 269 read => feed constraints.
[2025-06-02 05:56:33] [INFO ] Implicit Places using invariants and state equation in 3377 ms returned []
Implicit Place search using SMT with State Equation took 4152 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:56:33] [INFO ] Redundant transitions in 55 ms returned []
Running 1632 sub problems to find dead transitions.
[2025-06-02 05:56:33] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2025-06-02 05:56:33] [INFO ] Invariant cache hit.
[2025-06-02 05:56:34] [INFO ] State equation strengthened by 269 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/1719 variables, and 2 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/628 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1632 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 628/1719 variables, and 2 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/628 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 0/1632 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63669ms problems are : Problem set: 0 solved, 1632 unsolved
Search for dead transitions found 0 dead transitions in 63674ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68013 ms. Remains : 628/628 places, 1634/1634 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 123 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40005 steps (8 resets) in 407 ms. (98 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
[2025-06-02 05:57:38] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2025-06-02 05:57:38] [INFO ] Invariant cache hit.
[2025-06-02 05:57:38] [INFO ] State equation strengthened by 269 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 62/1560 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1560 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/1704 variables, 137/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1704 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 9/1713 variables, 5/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1713 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 6/1719 variables, 4/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1719/1719 variables, and 899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1265 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:40] [INFO ] Deduced a trap along path composed of 3 places in 54 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:40] [INFO ] Deduced a trap along path composed of 3 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:40] [INFO ] Deduced a trap along path composed of 3 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:40] [INFO ] Deduced a trap along path composed of 3 places in 49 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:40] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:40] [INFO ] Deduced a trap along path composed of 3 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:40] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:40] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:41] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:41] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:41] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:41] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:41] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:41] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:41] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:41] [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-02 05:57:41] [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-02 05:57:41] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:41] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:41] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1498 variables, 20/773 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:42] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:42] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:42] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:42] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:42] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:42] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:42] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:42] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:42] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:42] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:42] [INFO ] Deduced a trap along path composed of 3 places in 64 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:43] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:43] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:43] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:43] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:43] [INFO ] Deduced a trap along path composed of 3 places in 56 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:43] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:43] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:43] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:44] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1498 variables, 20/793 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:44] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:44] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1498/1719 variables, and 795 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 482/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 42/42 constraints]
After SMT, in 6309ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 107 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 628/628 places, 1634/1634 transitions.
RANDOM walk for 40000 steps (8 resets) in 349 ms. (114 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 81822 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 81822 steps, saw 53133 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2025-06-02 05:57:47] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2025-06-02 05:57:47] [INFO ] Invariant cache hit.
[2025-06-02 05:57:47] [INFO ] State equation strengthened by 269 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 62/1560 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1560 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/1704 variables, 137/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1704 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 9/1713 variables, 5/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1713 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 6/1719 variables, 4/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1719 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1719/1719 variables, and 899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1296 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 543/547 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/547 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/547 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 951/1498 variables, 478/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 268/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1498 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:49] [INFO ] Deduced a trap along path composed of 3 places in 52 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:49] [INFO ] Deduced a trap along path composed of 3 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:49] [INFO ] Deduced a trap along path composed of 3 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:50] [INFO ] Deduced a trap along path composed of 3 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:50] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:50] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:50] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:50] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:50] [INFO ] Deduced a trap along path composed of 3 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:50] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:50] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:50] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:50] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:50] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:50] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:51] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:51] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:51] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:51] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:51] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1498 variables, 20/773 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:51] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:51] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:51] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:51] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:51] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:51] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:52] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:52] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:52] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:52] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:52] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:52] [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-02 05:57:52] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:52] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:52] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:52] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:52] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:52] [INFO ] Deduced a trap along path composed of 3 places in 50 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:53] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:53] [INFO ] Deduced a trap along path composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1498 variables, 20/793 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:53] [INFO ] Deduced a trap along path composed of 3 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:53] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:53] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:53] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:54] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:54] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:54] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:54] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:54] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1498 variables, 9/802 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:55] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:55] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:55] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:55] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:55] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:55] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1498 variables, 6/808 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:56] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:56] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:56] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:56] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:57] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:57] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1498 variables, 6/814 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:57] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1498 variables, 1/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1498 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 62/1560 variables, 1/816 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:58] [INFO ] Deduced a trap composed of 131 places in 315 ms of which 9 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1560 variables, 1/817 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:58] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 05:57:58] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1560 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1560 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 144/1704 variables, 137/956 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1704 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 9/1713 variables, 5/961 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1713 variables, 0/961 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 6/1719 variables, 4/965 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1719 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1719 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 965 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11905 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 628/628 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 64/64 constraints]
After SMT, in 13228ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 10535 steps, including 202 resets, run visited all 2 properties in 150 ms. (steps per millisecond=70 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 157 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 243 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 934 ms.
Product exploration explored 100000 steps with 0 reset in 974 ms.
Built C files in :
/tmp/ltsmin15900498511483164480
[2025-06-02 05:58:03] [INFO ] Too many transitions (1634) to apply POR reductions. Disabling POR matrices.
[2025-06-02 05:58:03] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15900498511483164480
Running compilation step : cd /tmp/ltsmin15900498511483164480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15900498511483164480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15900498511483164480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 628 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 628/628 places, 1634/1634 transitions.
Applied a total of 0 rules in 144 ms. Remains 628 /628 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2025-06-02 05:58:06] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2025-06-02 05:58:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:58:07] [INFO ] Implicit Places using invariants in 750 ms returned []
[2025-06-02 05:58:07] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2025-06-02 05:58:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 05:58:08] [INFO ] State equation strengthened by 269 read => feed constraints.
[2025-06-02 05:58:10] [INFO ] Implicit Places using invariants and state equation in 3191 ms returned []
Implicit Place search using SMT with State Equation took 3947 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 05:58:10] [INFO ] Redundant transitions in 55 ms returned []
Running 1632 sub problems to find dead transitions.
[2025-06-02 05:58:10] [INFO ] Flow matrix only has 1091 transitions (discarded 543 similar events)
[2025-06-02 05:58:10] [INFO ] Invariant cache hit.
[2025-06-02 05:58:10] [INFO ] State equation strengthened by 269 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/1719 variables, and 2 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/628 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1632 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 628/1719 variables, and 2 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/628 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 0/1632 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64240ms problems are : Problem set: 0 solved, 1632 unsolved
Search for dead transitions found 0 dead transitions in 64243ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68399 ms. Remains : 628/628 places, 1634/1634 transitions.
Built C files in :
/tmp/ltsmin12160810953930683511
[2025-06-02 05:59:15] [INFO ] Too many transitions (1634) to apply POR reductions. Disabling POR matrices.
[2025-06-02 05:59:15] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12160810953930683511
Running compilation step : cd /tmp/ltsmin12160810953930683511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12160810953930683511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12160810953930683511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 05:59:18] [INFO ] Flatten gal took : 75 ms
[2025-06-02 05:59:18] [INFO ] Flatten gal took : 74 ms
[2025-06-02 05:59:18] [INFO ] Time to serialize gal into /tmp/LTL7866642482536614396.gal : 29 ms
[2025-06-02 05:59:18] [INFO ] Time to serialize properties into /tmp/LTL17033241172832196577.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7866642482536614396.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3578352647967122642.hoa' '-atoms' '/tmp/LTL17033241172832196577.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17033241172832196577.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3578352647967122642.hoa
Detected timeout of ITS tools.
[2025-06-02 05:59:33] [INFO ] Flatten gal took : 73 ms
[2025-06-02 05:59:33] [INFO ] Flatten gal took : 63 ms
[2025-06-02 05:59:33] [INFO ] Time to serialize gal into /tmp/LTL11877444935301423246.gal : 22 ms
[2025-06-02 05:59:33] [INFO ] Time to serialize properties into /tmp/LTL13438147981133763234.ltl : 3 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11877444935301423246.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13438147981133763234.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((s0<1)||(l2079<1))"))||("((s1>=1)&&(l1979>=1))")))))
Formula 0 simplified : G(F!"((s0<1)||(l2079<1))" & FG!"((s1>=1)&&(l1979>=1))")
Detected timeout of ITS tools.
[2025-06-02 05:59:48] [INFO ] Flatten gal took : 55 ms
[2025-06-02 05:59:48] [INFO ] Applying decomposition
[2025-06-02 05:59:48] [INFO ] Flatten gal took : 60 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/graph670964109606819511.txt' '-o' '/tmp/graph670964109606819511.bin' '-w' '/tmp/graph670964109606819511.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph670964109606819511.bin' '-l' '-1' '-v' '-w' '/tmp/graph670964109606819511.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:59:49] [INFO ] Decomposing Gal with order
[2025-06-02 05:59:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:59:49] [INFO ] Removed a total of 2723 redundant transitions.
[2025-06-02 05:59:49] [INFO ] Flatten gal took : 238 ms
[2025-06-02 05:59:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 1145 labels/synchronizations in 154 ms.
[2025-06-02 05:59:49] [INFO ] Time to serialize gal into /tmp/LTL6237300202730232526.gal : 22 ms
[2025-06-02 05:59:49] [INFO ] Time to serialize properties into /tmp/LTL10656340217514117711.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6237300202730232526.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10656340217514117711.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i0.u0.s0<1)||(i29.i3.u142.l2079<1))"))||("((i28.u1.s1>=1)&&(i29.i2.u144.l1979>=1))")))))
Formula 0 simplified : G(F!"((i0.u0.s0<1)||(i29.i3.u142.l2079<1))" & FG!"((i28.u1.s1>=1)&&(i29.i2.u144.l1979>=1))")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c008-LTLFireability-13 finished in 378839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 4 out of 715 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 715/715 places, 1854/1854 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 703 transition count 1830
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 703 transition count 1830
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 692 transition count 1804
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 692 transition count 1804
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 681 transition count 1762
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 681 transition count 1762
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 670 transition count 1724
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 670 transition count 1724
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 101 place count 659 transition count 1702
Iterating global reduction 0 with 11 rules applied. Total rules applied 112 place count 659 transition count 1702
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 123 place count 648 transition count 1680
Iterating global reduction 0 with 11 rules applied. Total rules applied 134 place count 648 transition count 1680
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 145 place count 637 transition count 1658
Iterating global reduction 0 with 11 rules applied. Total rules applied 156 place count 637 transition count 1658
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 167 place count 626 transition count 1634
Iterating global reduction 0 with 11 rules applied. Total rules applied 178 place count 626 transition count 1634
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 187 place count 617 transition count 1614
Iterating global reduction 0 with 9 rules applied. Total rules applied 196 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 197 place count 616 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 198 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 199 place count 615 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 200 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 201 place count 614 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 202 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 203 place count 613 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 204 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 205 place count 612 transition count 1604
Iterating global reduction 0 with 1 rules applied. Total rules applied 206 place count 612 transition count 1604
Applied a total of 206 rules in 271 ms. Remains 612 /715 variables (removed 103) and now considering 1604/1854 (removed 250) transitions.
[2025-06-02 06:00:05] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2025-06-02 06:00:05] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:00:05] [INFO ] Implicit Places using invariants in 807 ms returned []
[2025-06-02 06:00:05] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 06:00:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:00:06] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 06:00:09] [INFO ] Implicit Places using invariants and state equation in 3495 ms returned []
Implicit Place search using SMT with State Equation took 4309 ms to find 0 implicit places.
Running 1602 sub problems to find dead transitions.
[2025-06-02 06:00:09] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 06:00:09] [INFO ] Invariant cache hit.
[2025-06-02 06:00:09] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63535ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 63538ms
Starting structural reductions in LTL mode, iteration 1 : 612/715 places, 1604/1854 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68124 ms. Remains : 612/715 places, 1604/1854 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-15
Product exploration explored 100000 steps with 1 reset in 733 ms.
Product exploration explored 100000 steps with 0 reset in 922 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 257 ms. (155 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 319740 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 1
Probabilistic random walk after 319740 steps, saw 207544 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2025-06-02 06:01:18] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 06:01:18] [INFO ] Invariant cache hit.
[2025-06-02 06:01:18] [INFO ] State equation strengthened by 265 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 854/1241 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1241 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1241 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 361/1602 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1602 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1602 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1602 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 75/1677 variables, 71/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1677 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/1683 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1683 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1683 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 688 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/0 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 854/1241 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1241 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1241 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 361/1602 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1602 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1602 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1602 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 75/1677 variables, 71/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1677 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/1683 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1683 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1683 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 899 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1607ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 158 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=79 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1604/1604 transitions.
Applied a total of 0 rules in 17 ms. Remains 612 /612 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2025-06-02 06:01:20] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 06:01:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:01:21] [INFO ] Implicit Places using invariants in 710 ms returned []
[2025-06-02 06:01:21] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 06:01:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:01:21] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 06:01:24] [INFO ] Implicit Places using invariants and state equation in 3410 ms returned []
Implicit Place search using SMT with State Equation took 4125 ms to find 0 implicit places.
Running 1602 sub problems to find dead transitions.
[2025-06-02 06:01:24] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 06:01:24] [INFO ] Invariant cache hit.
[2025-06-02 06:01:24] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 5.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63657ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 63660ms
Finished structural reductions in LTL mode , in 1 iterations and 67807 ms. Remains : 612/612 places, 1604/1604 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40005 steps (8 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 322982 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 1
Probabilistic random walk after 322982 steps, saw 209647 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
[2025-06-02 06:02:31] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 06:02:31] [INFO ] Invariant cache hit.
[2025-06-02 06:02:31] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 854/1241 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1241 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1241 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 361/1602 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1602 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1602 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1602 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 75/1677 variables, 71/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1677 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/1683 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1683 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1683 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 675 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/0 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 854/1241 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1241 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1241 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 361/1602 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1602 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1602 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1602 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 75/1677 variables, 71/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1677 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/1683 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1683 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1683 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 868 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1569ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 57 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 734 ms.
Product exploration explored 100000 steps with 0 reset in 819 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 612 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 612/612 places, 1604/1604 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 612 transition count 1602
Applied a total of 2 rules in 250 ms. Remains 612 /612 variables (removed 0) and now considering 1602/1604 (removed 2) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:02:36] [INFO ] Redundant transitions in 53 ms returned []
Running 1600 sub problems to find dead transitions.
[2025-06-02 06:02:36] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 612 cols
[2025-06-02 06:02:36] [INFO ] Computed 2 invariants in 6 ms
[2025-06-02 06:02:36] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1682 variables, and 2 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 5)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/1682 variables, and 2 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63768ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 63772ms
Starting structural reductions in SI_LTL mode, iteration 1 : 612/612 places, 1602/1604 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64088 ms. Remains : 612/612 places, 1602/1604 transitions.
Built C files in :
/tmp/ltsmin11933164426642032669
[2025-06-02 06:03:39] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11933164426642032669
Running compilation step : cd /tmp/ltsmin11933164426642032669;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11933164426642032669;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11933164426642032669;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1604/1604 transitions.
Applied a total of 0 rules in 15 ms. Remains 612 /612 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2025-06-02 06:03:42] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 612 cols
[2025-06-02 06:03:42] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:03:43] [INFO ] Implicit Places using invariants in 699 ms returned []
[2025-06-02 06:03:43] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 06:03:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:03:44] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 06:03:47] [INFO ] Implicit Places using invariants and state equation in 3500 ms returned []
Implicit Place search using SMT with State Equation took 4201 ms to find 0 implicit places.
Running 1602 sub problems to find dead transitions.
[2025-06-02 06:03:47] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 06:03:47] [INFO ] Invariant cache hit.
[2025-06-02 06:03:47] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 5)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63490ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 63494ms
Finished structural reductions in LTL mode , in 1 iterations and 67715 ms. Remains : 612/612 places, 1604/1604 transitions.
Built C files in :
/tmp/ltsmin12719766878045303284
[2025-06-02 06:04:50] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12719766878045303284
Running compilation step : cd /tmp/ltsmin12719766878045303284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12719766878045303284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12719766878045303284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-02 06:04:53] [INFO ] Flatten gal took : 54 ms
[2025-06-02 06:04:53] [INFO ] Flatten gal took : 55 ms
[2025-06-02 06:04:53] [INFO ] Time to serialize gal into /tmp/LTL2955905669325270893.gal : 10 ms
[2025-06-02 06:04:53] [INFO ] Time to serialize properties into /tmp/LTL14142300923749814031.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2955905669325270893.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15266488785414913089.hoa' '-atoms' '/tmp/LTL14142300923749814031.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14142300923749814031.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15266488785414913089.hoa
Detected timeout of ITS tools.
[2025-06-02 06:05:08] [INFO ] Flatten gal took : 41 ms
[2025-06-02 06:05:09] [INFO ] Flatten gal took : 43 ms
[2025-06-02 06:05:09] [INFO ] Time to serialize gal into /tmp/LTL17034809720477942142.gal : 8 ms
[2025-06-02 06:05:09] [INFO ] Time to serialize properties into /tmp/LTL564214772348667789.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17034809720477942142.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL564214772348667789.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G("((((s0<1)||(l1476<1))&&((s1<1)||(l2624<1)))&&((s0<1)||(l1476<1)))")))))))
Formula 0 simplified : XXXXF!"((((s0<1)||(l1476<1))&&((s1<1)||(l2624<1)))&&((s0<1)||(l1476<1)))"
Detected timeout of ITS tools.
[2025-06-02 06:05:24] [INFO ] Flatten gal took : 42 ms
[2025-06-02 06:05:24] [INFO ] Applying decomposition
[2025-06-02 06:05:24] [INFO ] Flatten gal took : 42 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/graph17624128606411454602.txt' '-o' '/tmp/graph17624128606411454602.bin' '-w' '/tmp/graph17624128606411454602.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17624128606411454602.bin' '-l' '-1' '-v' '-w' '/tmp/graph17624128606411454602.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:05:24] [INFO ] Decomposing Gal with order
[2025-06-02 06:05:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:05:24] [INFO ] Removed a total of 2664 redundant transitions.
[2025-06-02 06:05:24] [INFO ] Flatten gal took : 96 ms
[2025-06-02 06:05:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 1087 labels/synchronizations in 90 ms.
[2025-06-02 06:05:24] [INFO ] Time to serialize gal into /tmp/LTL9411250014583902995.gal : 13 ms
[2025-06-02 06:05:24] [INFO ] Time to serialize properties into /tmp/LTL5699340276839039736.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9411250014583902995.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5699340276839039736.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(G("((((i0.u1.s0<1)||(i30.i1.u147.l1476<1))&&((i29.u0.s1<1)||(i21.u154.l2624<1)))&&((i0.u1.s0<1)||(i30.i1.u147.l1476<1)))"))...160
Formula 0 simplified : XXXXF!"((((i0.u1.s0<1)||(i30.i1.u147.l1476<1))&&((i29.u0.s1<1)||(i21.u154.l2624<1)))&&((i0.u1.s0<1)||(i30.i1.u147.l1476<1)))"
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c008-LTLFireability-15 finished in 334769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c008-LTLFireability-15
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 715 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 715/715 places, 1854/1854 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 703 transition count 1830
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 703 transition count 1830
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 692 transition count 1804
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 692 transition count 1804
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 681 transition count 1762
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 681 transition count 1762
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 670 transition count 1724
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 670 transition count 1724
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 101 place count 659 transition count 1702
Iterating global reduction 0 with 11 rules applied. Total rules applied 112 place count 659 transition count 1702
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 123 place count 648 transition count 1680
Iterating global reduction 0 with 11 rules applied. Total rules applied 134 place count 648 transition count 1680
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 145 place count 637 transition count 1658
Iterating global reduction 0 with 11 rules applied. Total rules applied 156 place count 637 transition count 1658
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 167 place count 626 transition count 1634
Iterating global reduction 0 with 11 rules applied. Total rules applied 178 place count 626 transition count 1634
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 187 place count 617 transition count 1614
Iterating global reduction 0 with 9 rules applied. Total rules applied 196 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 197 place count 616 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 198 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 199 place count 615 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 200 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 201 place count 614 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 202 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 203 place count 613 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 204 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 205 place count 612 transition count 1604
Iterating global reduction 0 with 1 rules applied. Total rules applied 206 place count 612 transition count 1604
Applied a total of 206 rules in 391 ms. Remains 612 /715 variables (removed 103) and now considering 1604/1854 (removed 250) transitions.
[2025-06-02 06:05:40] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 06:05:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:05:41] [INFO ] Implicit Places using invariants in 707 ms returned []
[2025-06-02 06:05:41] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 06:05:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:05:41] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 06:05:44] [INFO ] Implicit Places using invariants and state equation in 3484 ms returned []
Implicit Place search using SMT with State Equation took 4196 ms to find 0 implicit places.
Running 1602 sub problems to find dead transitions.
[2025-06-02 06:05:44] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 06:05:44] [INFO ] Invariant cache hit.
[2025-06-02 06:05:44] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63754ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 63757ms
Starting structural reductions in LI_LTL mode, iteration 1 : 612/715 places, 1604/1854 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 68349 ms. Remains : 612/715 places, 1604/1854 transitions.
Running random walk in product with property : FunctionPointer-PT-c008-LTLFireability-15
Product exploration explored 100000 steps with 1 reset in 842 ms.
Product exploration explored 100000 steps with 0 reset in 850 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40005 steps (8 resets) in 260 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 326551 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 326551 steps, saw 211964 distinct states, run finished after 3003 ms. (steps per millisecond=108 ) properties seen :0
[2025-06-02 06:06:53] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 06:06:53] [INFO ] Invariant cache hit.
[2025-06-02 06:06:53] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 854/1241 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1241 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1241 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 361/1602 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1602 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1602 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1602 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 75/1677 variables, 71/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1677 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/1683 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1683 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1683 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/0 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 854/1241 variables, 387/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1241 variables, 196/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1241 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 361/1602 variables, 150/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1602 variables, 1/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1602 variables, 69/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1602 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 75/1677 variables, 71/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1677 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/1683 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1683 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1683 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 861 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 612/612 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1543ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 612 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1604/1604 transitions.
Applied a total of 0 rules in 19 ms. Remains 612 /612 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2025-06-02 06:06:55] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 06:06:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:06:56] [INFO ] Implicit Places using invariants in 744 ms returned []
[2025-06-02 06:06:56] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 06:06:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:06:56] [INFO ] State equation strengthened by 265 read => feed constraints.
[2025-06-02 06:06:59] [INFO ] Implicit Places using invariants and state equation in 3469 ms returned []
Implicit Place search using SMT with State Equation took 4215 ms to find 0 implicit places.
Running 1602 sub problems to find dead transitions.
[2025-06-02 06:06:59] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2025-06-02 06:06:59] [INFO ] Invariant cache hit.
[2025-06-02 06:06:59] [INFO ] State equation strengthened by 265 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 612/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/612 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63675ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 63678ms
Finished structural reductions in LTL mode , in 1 iterations and 67916 ms. Remains : 612/612 places, 1604/1604 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 30139 steps (7 resets) in 129 ms. (231 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 349 steps with 1 reset in 3 ms.
Treatment of property FunctionPointer-PT-c008-LTLFireability-15 finished in 144655 ms.
FORMULA FunctionPointer-PT-c008-LTLFireability-15 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2025-06-02 06:08:04] [INFO ] Flatten gal took : 47 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1886929269057791374
[2025-06-02 06:08:04] [INFO ] Too many transitions (1854) to apply POR reductions. Disabling POR matrices.
[2025-06-02 06:08:04] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1886929269057791374
Running compilation step : cd /tmp/ltsmin1886929269057791374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-02 06:08:04] [INFO ] Applying decomposition
[2025-06-02 06:08:04] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16218645226244138947.txt' '-o' '/tmp/graph16218645226244138947.bin' '-w' '/tmp/graph16218645226244138947.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16218645226244138947.bin' '-l' '-1' '-v' '-w' '/tmp/graph16218645226244138947.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:08:04] [INFO ] Decomposing Gal with order
[2025-06-02 06:08:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:08:04] [INFO ] Removed a total of 3093 redundant transitions.
[2025-06-02 06:08:04] [INFO ] Flatten gal took : 110 ms
[2025-06-02 06:08:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 1480 labels/synchronizations in 65 ms.
[2025-06-02 06:08:05] [INFO ] Time to serialize gal into /tmp/LTLFireability16281557106867663521.gal : 17 ms
[2025-06-02 06:08:05] [INFO ] Time to serialize properties into /tmp/LTLFireability4103505508471139725.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16281557106867663521.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4103505508471139725.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i28.i0.u2.s1>=1)&&(i26.i1.u191.l1979>=1))")||(G("((i1.i0.u1.s0<1)||(i0.u188.l2079<1))"))))))
Formula 0 simplified : G(F!"((i1.i0.u1.s0<1)||(i0.u188.l2079<1))" & FG!"((i28.i0.u2.s1>=1)&&(i26.i1.u191.l1979>=1))")
Compilation finished in 6357 ms.
Running link step : cd /tmp/ltsmin1886929269057791374;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin1886929269057791374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-02 06:36:21] [INFO ] Flatten gal took : 149 ms
[2025-06-02 06:36:21] [INFO ] Time to serialize gal into /tmp/LTLFireability3103086715126650352.gal : 35 ms
[2025-06-02 06:36:21] [INFO ] Time to serialize properties into /tmp/LTLFireability1225278081949828118.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3103086715126650352.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1225278081949828118.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G(F(("((s1>=1)&&(l1979>=1))")||(G("((s0<1)||(l2079<1))"))))))
Formula 0 simplified : G(F!"((s0<1)||(l2079<1))" & FG!"((s1>=1)&&(l1979>=1))")
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin1886929269057791374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 28800 s
Running LTSmin : cd /tmp/ltsmin1886929269057791374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-c008"
export BK_EXAMINATION="LTLFireability"
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-c008, examination is LTLFireability"
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-174867007400132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c008.tgz
mv FunctionPointer-PT-c008 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;