About the Execution of ITS-Tools for BusinessProcesses-PT-02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 625630.00 | 0.00 | 0.00 | TFTFFFFTFFFTTTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813100011.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 BusinessProcesses-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813100011
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K 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 3.7K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 59K 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 BusinessProcesses-PT-02-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-02-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748543864947
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-29 18:37:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 18:37:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:37:47] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2025-05-29 18:37:47] [INFO ] Transformed 262 places.
[2025-05-29 18:37:47] [INFO ] Transformed 219 transitions.
[2025-05-29 18:37:47] [INFO ] Found NUPN structural information;
[2025-05-29 18:37:47] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 296 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 17 places in 6 ms
Reduce places removed 17 places and 15 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA BusinessProcesses-PT-02-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 204/204 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 240 transition count 204
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 36 place count 209 transition count 173
Iterating global reduction 1 with 31 rules applied. Total rules applied 67 place count 209 transition count 173
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 82 place count 194 transition count 158
Iterating global reduction 1 with 15 rules applied. Total rules applied 97 place count 194 transition count 158
Applied a total of 97 rules in 90 ms. Remains 194 /245 variables (removed 51) and now considering 158/204 (removed 46) transitions.
// Phase 1: matrix 158 rows 194 cols
[2025-05-29 18:37:47] [INFO ] Computed 38 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:37:48] [INFO ] Implicit Places using invariants in 398 ms returned []
[2025-05-29 18:37:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:37:49] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2025-05-29 18:37:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 2/194 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:54] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:54] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:54] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:54] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:54] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:54] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:55] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:55] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:55] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:55] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:55] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:55] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:55] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:56] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:56] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:56] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:56] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:56] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:57] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:57] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:57] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:57] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:57] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:37:59] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 158/352 variables, 194/256 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:04] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:14] [INFO ] Deduced a trap along path composed of 3 places in 96 ms of which 22 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/352 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:17] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:17] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:17] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 17 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/352 variables, and 261 constraints, problems are : Problem set: 0 solved, 157 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 2/194 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 28/66 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:20] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:21] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:21] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:22] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:22] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:22] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:22] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:22] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:22] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:22] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:22] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:23] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:23] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:24] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:24] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:24] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:24] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:25] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:25] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:25] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:25] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:25] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 158/352 variables, 194/282 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 157/439 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:29] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:29] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:29] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:31] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 18 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 4/443 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:37] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:43] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:43] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 8 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 2/446 constraints. Problems are: Problem set: 0 solved, 157 unsolved
SMT process timed out in 60160ms, After SMT, problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Starting structural reductions in LTL mode, iteration 1 : 194/245 places, 158/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61439 ms. Remains : 194/245 places, 158/204 transitions.
Support contains 20 out of 194 places after structural reductions.
[2025-05-29 18:38:49] [INFO ] Flatten gal took : 62 ms
[2025-05-29 18:38:49] [INFO ] Flatten gal took : 26 ms
[2025-05-29 18:38:49] [INFO ] Input system was already deterministic with 158 transitions.
Support contains 18 out of 194 places (down from 20) after GAL structural reductions.
RANDOM walk for 40000 steps (539 resets) in 1562 ms. (25 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40002 steps (122 resets) in 456 ms. (87 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (92 resets) in 289 ms. (137 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (105 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (112 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (98 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
[2025-05-29 18:38:50] [INFO ] Invariant cache hit.
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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 41/48 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 104/152 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 22/174 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 139/313 variables, 174/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 29/342 variables, 13/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 10/352 variables, 7/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/352 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/352 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 232 constraints, problems are : Problem set: 0 solved, 4 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 41/48 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:50] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 104/152 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:50] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:51] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:51] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:51] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 22/174 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:51] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 139/313 variables, 174/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:51] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 13 (OVERLAPS) 29/342 variables, 13/232 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/342 variables, 3/235 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:51] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:51] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:51] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:51] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:52] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:52] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:52] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:52] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 11 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/342 variables, 8/243 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/342 variables, 0/243 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 10/352 variables, 7/250 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/352 variables, 0/250 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/352 variables, 0/250 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 250 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2160 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 194/194 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2483ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 1 properties in 767 ms.
Support contains 3 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 158/158 transitions.
Graph (trivial) has 93 edges and 194 vertex of which 6 / 194 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 375 edges and 189 vertex of which 183 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 183 transition count 121
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 50 place count 159 transition count 121
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 50 place count 159 transition count 84
Deduced a syphon composed of 37 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 81 rules applied. Total rules applied 131 place count 115 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 114 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 114 transition count 83
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 233 place count 63 transition count 34
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 234 place count 63 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 235 place count 62 transition count 33
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 236 place count 62 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 237 place count 61 transition count 32
Applied a total of 237 rules in 97 ms. Remains 61 /194 variables (removed 133) and now considering 32/158 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 61/194 places, 32/158 transitions.
RANDOM walk for 40000 steps (1737 resets) in 700 ms. (57 steps per ms) remains 1/2 properties
BEST_FIRST walk for 596 steps (5 resets) in 9 ms. (59 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-02-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
Computed a total of 187 stabilizing places and 149 stable transitions
Graph (complete) has 382 edges and 194 vertex of which 188 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 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(p0))&&F(!p1))||X(X(G(p0)))))'
Support contains 3 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 158/158 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 158
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 190 transition count 155
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 190 transition count 155
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 188 transition count 153
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 188 transition count 153
Applied a total of 11 rules in 29 ms. Remains 188 /194 variables (removed 6) and now considering 153/158 (removed 5) transitions.
// Phase 1: matrix 153 rows 188 cols
[2025-05-29 18:38:54] [INFO ] Computed 37 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:38:54] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-05-29 18:38:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:38:54] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2025-05-29 18:38:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:58] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:58] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:58] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:58] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:58] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:59] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:59] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:59] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:59] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:59] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:59] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:38:59] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:00] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:00] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:00] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:00] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:00] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:01] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:01] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:01] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:01] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:02] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:02] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:02] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:02] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:02] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:03] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:04] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:04] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:04] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:04] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:05] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:05] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:05] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:06] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:07] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:07] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:07] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:09] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:10] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 153/341 variables, 188/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:15] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:15] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:15] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 16 (OVERLAPS) 0/341 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 268 constraints, problems are : Problem set: 0 solved, 152 unsolved in 27952 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 43/80 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/341 variables, 188/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 152/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:28] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:29] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:29] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:30] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:30] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:37] [INFO ] Deduced a trap along path composed of 5 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:39] [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-05-29 18:39:39] [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-05-29 18:39:39] [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-05-29 18:39:40] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 5/430 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:45] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 431 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 58008ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 58011ms
Starting structural reductions in LTL mode, iteration 1 : 188/194 places, 153/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58687 ms. Remains : 188/194 places, 153/158 transitions.
Stuttering acceptance computed with spot in 641 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), true, p1]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-01
Stuttering criterion allowed to conclude after 69 steps with 1 reset in 47 ms.
FORMULA BusinessProcesses-PT-02-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLCardinality-01 finished in 59502 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(p0) U X((G(!p0)||X((!p1||G(F(p2))))))))'
Support contains 6 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 158/158 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 191 transition count 156
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 191 transition count 156
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 189 transition count 154
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 189 transition count 154
Applied a total of 9 rules in 35 ms. Remains 189 /194 variables (removed 5) and now considering 154/158 (removed 4) transitions.
// Phase 1: matrix 154 rows 189 cols
[2025-05-29 18:39:53] [INFO ] Computed 37 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:39:54] [INFO ] Implicit Places using invariants in 302 ms returned []
[2025-05-29 18:39:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:39:54] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2025-05-29 18:39:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:59] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:59] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:59] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:59] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:59] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:59] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:59] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:59] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:39:59] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:00] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:00] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:00] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:00] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:00] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:00] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:01] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:01] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:01] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:01] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:01] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:01] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:01] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:03] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:03] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:03] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:03] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:03] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:05] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:05] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:06] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:07] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:07] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:07] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:09] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:10] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:10] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:10] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:11] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 11 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:13] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:14] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:14] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:14] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:14] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 10 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:15] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/189 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 16 (OVERLAPS) 154/343 variables, 189/270 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:18] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:18] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/343 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/343 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 343/343 variables, and 272 constraints, problems are : Problem set: 0 solved, 153 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 46/83 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:26] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:26] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:26] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:26] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:26] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:26] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 6/89 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:27] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (OVERLAPS) 154/343 variables, 189/279 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 153/432 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:30] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:30] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:31] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:32] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 4/436 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:37] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:38] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:38] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:38] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:38] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:38] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:38] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:39] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:39] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:40] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 10/446 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:49] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:52] [INFO ] Deduced a trap along path composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/343 variables, and 448 constraints, problems are : Problem set: 0 solved, 153 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in LTL mode, iteration 1 : 189/194 places, 154/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60831 ms. Remains : 189/194 places, 154/158 transitions.
Stuttering acceptance computed with spot in 861 ms :[(AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) p0 p1), (AND (NOT p2) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1 p0), false, (AND (NOT p2) p0 p1)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-03
Product exploration explored 100000 steps with 1359 reset in 332 ms.
Product exploration explored 100000 steps with 1366 reset in 294 ms.
Computed a total of 182 stabilizing places and 145 stable transitions
Graph (complete) has 376 edges and 189 vertex of which 186 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Computed a total of 182 stabilizing places and 145 stable transitions
Detected a total of 182/189 stabilizing places and 145/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 1600 ms. Reduced automaton from 18 states, 41 edges and 3 AP (stutter sensitive) to 14 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 681 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) p0 p1), (AND (NOT p2) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1 p0), false, (AND (NOT p2) p0 p1)]
RANDOM walk for 40000 steps (533 resets) in 1229 ms. (32 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (113 resets) in 419 ms. (95 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (112 resets) in 242 ms. (164 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (119 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (116 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (101 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (103 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (96 resets) in 169 ms. (235 steps per ms) remains 6/8 properties
[2025-05-29 18:40:59] [INFO ] Invariant cache hit.
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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 39/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 103/148 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 22/170 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 136/306 variables, 170/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 27/333 variables, 12/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 10/343 variables, 7/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/343 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 226 constraints, problems are : Problem set: 0 solved, 6 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 39/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 103/148 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:59] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:59] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:40:59] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:00] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 22/170 variables, 9/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 136/306 variables, 170/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:00] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:00] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:00] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 27/333 variables, 12/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 6/232 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:00] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:00] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:00] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:01] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:01] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 13 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/333 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:01] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/333 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/333 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 10/343 variables, 7/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/343 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/343 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 245 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2386 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2901ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 4 properties in 787 ms.
Support contains 6 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 154/154 transitions.
Graph (trivial) has 86 edges and 189 vertex of which 6 / 189 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 369 edges and 184 vertex of which 181 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 181 transition count 121
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 46 place count 159 transition count 121
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 46 place count 159 transition count 86
Deduced a syphon composed of 35 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 77 rules applied. Total rules applied 123 place count 117 transition count 86
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 223 place count 66 transition count 37
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 224 place count 66 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 225 place count 65 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 226 place count 64 transition count 35
Applied a total of 226 rules in 19 ms. Remains 64 /189 variables (removed 125) and now considering 35/154 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 64/189 places, 35/154 transitions.
RANDOM walk for 40000 steps (1406 resets) in 228 ms. (174 steps per ms) remains 2/2 properties
BEST_FIRST walk for 2515 steps (25 resets) in 13 ms. (179 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) p0 p2))), (F (NOT (OR p0 p2))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p1) p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 7791 ms. Reduced automaton from 14 states, 29 edges and 3 AP (stutter sensitive) to 14 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 802 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) p0 p1), (AND (NOT p2) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1 p0), false, (AND (NOT p2) p0 p1)]
Stuttering acceptance computed with spot in 777 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) p0 p1), (AND (NOT p2) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1 p0), false, (AND (NOT p2) p0 p1)]
Support contains 6 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 154/154 transitions.
Applied a total of 0 rules in 4 ms. Remains 189 /189 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2025-05-29 18:41:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:41:12] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-05-29 18:41:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:41:13] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2025-05-29 18:41:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:17] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:17] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:17] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:17] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:18] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:18] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:18] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:18] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:18] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:18] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:18] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:18] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:19] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:19] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:19] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:19] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:19] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:19] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:20] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:20] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:20] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:20] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:22] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:22] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:22] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:22] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:22] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:24] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:25] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:25] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:27] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:27] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:27] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:29] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:30] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:31] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:31] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:32] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 12 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:35] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:35] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:35] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:35] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:35] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 11 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:36] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/189 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 16 (OVERLAPS) 154/343 variables, 189/270 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:40] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:41] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/343 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 153 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 343/343 variables, and 272 constraints, problems are : Problem set: 0 solved, 153 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 46/83 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:44] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:45] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:45] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:45] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:45] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:45] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 6/89 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:46] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (OVERLAPS) 154/343 variables, 189/279 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 153/432 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:50] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:50] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:51] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:53] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 4/436 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:59] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:59] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:59] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:59] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:59] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:41:59] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:00] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:00] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:01] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:01] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 10/446 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:12] [INFO ] Deduced a trap along path composed of 5 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/343 variables, and 447 constraints, problems are : Problem set: 0 solved, 153 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Finished structural reductions in LTL mode , in 1 iterations and 60704 ms. Remains : 189/189 places, 154/154 transitions.
Computed a total of 182 stabilizing places and 145 stable transitions
Graph (complete) has 376 edges and 189 vertex of which 186 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 182 stabilizing places and 145 stable transitions
Detected a total of 182/189 stabilizing places and 145/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 1479 ms. Reduced automaton from 14 states, 29 edges and 3 AP (stutter sensitive) to 14 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 710 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) p0 p1), (AND (NOT p2) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1 p0), false, (AND (NOT p2) p0 p1)]
RANDOM walk for 40000 steps (526 resets) in 270 ms. (147 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (96 resets) in 108 ms. (367 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40004 steps (113 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (113 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (110 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (115 resets) in 128 ms. (310 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (103 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (106 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (103 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
[2025-05-29 18:42:15] [INFO ] Invariant cache hit.
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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 39/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 103/148 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 22/170 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 136/306 variables, 170/207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 27/333 variables, 12/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 10/343 variables, 7/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/343 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 226 constraints, problems are : Problem set: 0 solved, 7 unsolved in 672 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 189/189 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 39/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:16] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 103/148 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:16] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:16] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:16] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:16] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:16] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:16] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 22/170 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:16] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 136/306 variables, 170/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 27/333 variables, 12/227 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/333 variables, 7/234 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:17] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/333 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:17] [INFO ] Deduced a trap along path composed of 5 places in 52 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/333 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:18] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:18] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:18] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 8 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/333 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/333 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 10/343 variables, 7/246 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/343 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/343 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 246 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2539 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3218ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 910 ms.
Support contains 6 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 154/154 transitions.
Graph (trivial) has 86 edges and 189 vertex of which 6 / 189 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 369 edges and 184 vertex of which 181 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 181 transition count 121
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 46 place count 159 transition count 121
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 46 place count 159 transition count 86
Deduced a syphon composed of 35 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 77 rules applied. Total rules applied 123 place count 117 transition count 86
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 223 place count 66 transition count 37
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 224 place count 66 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 225 place count 65 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 226 place count 64 transition count 35
Applied a total of 226 rules in 25 ms. Remains 64 /189 variables (removed 125) and now considering 35/154 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 64/189 places, 35/154 transitions.
RANDOM walk for 40000 steps (1397 resets) in 167 ms. (238 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (437 resets) in 62 ms. (634 steps per ms) remains 2/6 properties
BEST_FIRST walk for 1410 steps (9 resets) in 5 ms. (235 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p2))), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F (NOT p0)), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 6391 ms. Reduced automaton from 14 states, 29 edges and 3 AP (stutter sensitive) to 14 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 641 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) p0 p1), (AND (NOT p2) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1 p0), false, (AND (NOT p2) p0 p1)]
Stuttering acceptance computed with spot in 670 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) p0 p1), (AND (NOT p2) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1 p0), false, (AND (NOT p2) p0 p1)]
Stuttering acceptance computed with spot in 629 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) p0 p1), (AND (NOT p2) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1 p0), false, (AND (NOT p2) p0 p1)]
Product exploration explored 100000 steps with 1356 reset in 265 ms.
Product exploration explored 100000 steps with 1359 reset in 299 ms.
Applying partial POR strategy [false, false, true, true, true, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 629 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) p0 p1), (AND (NOT p2) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) p1 p0), false, (AND (NOT p2) p0 p1)]
Support contains 6 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 154/154 transitions.
Graph (trivial) has 86 edges and 189 vertex of which 6 / 189 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 370 edges and 184 vertex of which 181 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 181 transition count 145
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 27 Pre rules applied. Total rules applied 24 place count 181 transition count 162
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 51 place count 181 transition count 162
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 174 transition count 149
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 174 transition count 149
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 1 with 57 rules applied. Total rules applied 122 place count 174 transition count 149
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 138 place count 158 transition count 133
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 154 place count 158 transition count 133
Deduced a syphon composed of 83 places in 0 ms
Applied a total of 154 rules in 55 ms. Remains 158 /189 variables (removed 31) and now considering 133/154 (removed 21) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 18:42:29] [INFO ] Redundant transitions in 32 ms returned []
Running 132 sub problems to find dead transitions.
// Phase 1: matrix 133 rows 158 cols
[2025-05-29 18:42:29] [INFO ] Computed 37 invariants in 8 ms
[2025-05-29 18:42:29] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 5 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 3 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 3 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 20/57 constraints. Problems are: Problem set: 57 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 3 ms to minimize.
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 3 ms to minimize.
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 8 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 3 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Problem TDEAD108 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
Problem TDEAD115 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
Problem TDEAD119 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 18/75 constraints. Problems are: Problem set: 89 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/75 constraints. Problems are: Problem set: 89 solved, 43 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD80 is UNSAT
At refinement iteration 7 (OVERLAPS) 132/290 variables, 158/233 constraints. Problems are: Problem set: 94 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 5/238 constraints. Problems are: Problem set: 94 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/238 constraints. Problems are: Problem set: 94 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 1/291 variables, 1/239 constraints. Problems are: Problem set: 94 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 0/239 constraints. Problems are: Problem set: 94 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/291 variables, 0/239 constraints. Problems are: Problem set: 94 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 239 constraints, problems are : Problem set: 94 solved, 38 unsolved in 10844 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 158/158 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 94 solved, 38 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 94 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 70/144 variables, 24/24 constraints. Problems are: Problem set: 94 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 2/26 constraints. Problems are: Problem set: 94 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 38/64 constraints. Problems are: Problem set: 94 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:41] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:41] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:41] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 3/67 constraints. Problems are: Problem set: 94 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/67 constraints. Problems are: Problem set: 94 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 10/154 variables, 11/78 constraints. Problems are: Problem set: 94 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/78 constraints. Problems are: Problem set: 94 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 132/286 variables, 154/232 constraints. Problems are: Problem set: 94 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 5/237 constraints. Problems are: Problem set: 94 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 38/275 constraints. Problems are: Problem set: 94 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:44] [INFO ] Deduced a trap along path composed of 4 places in 55 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 1/276 constraints. Problems are: Problem set: 94 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 0/276 constraints. Problems are: Problem set: 94 solved, 38 unsolved
At refinement iteration 13 (OVERLAPS) 4/290 variables, 4/280 constraints. Problems are: Problem set: 94 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:42:49] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 10 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/290 variables, 1/281 constraints. Problems are: Problem set: 94 solved, 38 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/290 variables, 0/281 constraints. Problems are: Problem set: 94 solved, 38 unsolved
At refinement iteration 16 (OVERLAPS) 1/291 variables, 1/282 constraints. Problems are: Problem set: 94 solved, 38 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/291 variables, 0/282 constraints. Problems are: Problem set: 94 solved, 38 unsolved
At refinement iteration 18 (OVERLAPS) 0/291 variables, 0/282 constraints. Problems are: Problem set: 94 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 282 constraints, problems are : Problem set: 94 solved, 38 unsolved in 21340 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 158/158 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 38/132 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 32251ms problems are : Problem set: 94 solved, 38 unsolved
Search for dead transitions found 94 dead transitions in 32255ms
Found 94 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 94 transitions
Dead transitions reduction (with SMT) removed 94 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 158/189 places, 39/154 transitions.
Graph (complete) has 267 edges and 158 vertex of which 75 are kept as prefixes of interest. Removing 83 places using SCC suffix rule.1 ms
Discarding 83 places :
Also discarding 0 output transitions
Ensure Unique test removed 9 places
Applied a total of 1 rules in 8 ms. Remains 66 /158 variables (removed 92) and now considering 39/39 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/189 places, 39/154 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32361 ms. Remains : 66/189 places, 39/154 transitions.
Built C files in :
/tmp/ltsmin15911313217027025797
[2025-05-29 18:43:02] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15911313217027025797
Running compilation step : cd /tmp/ltsmin15911313217027025797;'/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'
Compilation finished in 929 ms.
Running link step : cd /tmp/ltsmin15911313217027025797;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 87 ms.
Running LTSmin : cd /tmp/ltsmin15911313217027025797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4704202120467572035.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 154/154 transitions.
Applied a total of 0 rules in 7 ms. Remains 189 /189 variables (removed 0) and now considering 154/154 (removed 0) transitions.
// Phase 1: matrix 154 rows 189 cols
[2025-05-29 18:43:17] [INFO ] Computed 37 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:43:17] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-05-29 18:43:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:43:17] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2025-05-29 18:43:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:22] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:22] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:22] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:22] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:22] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:22] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:22] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:23] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:23] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:23] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:23] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:23] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:23] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:23] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:23] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:24] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:24] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:24] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:24] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:24] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:25] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:25] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:26] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:26] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:26] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:26] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:27] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:28] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:29] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:29] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:31] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:31] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:31] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:33] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:34] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:34] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:34] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:35] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:37] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:37] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:37] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:38] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:38] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 10 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:39] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/189 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 16 (OVERLAPS) 154/343 variables, 189/270 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:43] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:43] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/343 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/343 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 343/343 variables, and 272 constraints, problems are : Problem set: 0 solved, 153 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 46/83 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:49] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:49] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:50] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:50] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:50] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:50] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 6/89 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:51] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (OVERLAPS) 154/343 variables, 189/279 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 153/432 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:55] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:56] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:56] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:43:58] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 4/436 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:04] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:04] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:04] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:04] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:04] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:04] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:05] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:05] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:06] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:06] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 10/446 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:44:17] [INFO ] Deduced a trap along path composed of 5 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/343 variables, and 447 constraints, problems are : Problem set: 0 solved, 153 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Finished structural reductions in LTL mode , in 1 iterations and 60535 ms. Remains : 189/189 places, 154/154 transitions.
Built C files in :
/tmp/ltsmin7655615993367171471
[2025-05-29 18:44:17] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7655615993367171471
Running compilation step : cd /tmp/ltsmin7655615993367171471;'/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'
Compilation finished in 598 ms.
Running link step : cd /tmp/ltsmin7655615993367171471;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7655615993367171471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12849612269500865946.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 18:44:33] [INFO ] Flatten gal took : 15 ms
[2025-05-29 18:44:33] [INFO ] Flatten gal took : 15 ms
[2025-05-29 18:44:33] [INFO ] Time to serialize gal into /tmp/LTL8989922507286257565.gal : 6 ms
[2025-05-29 18:44:33] [INFO ] Time to serialize properties into /tmp/LTL11028873586748430314.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/LTL8989922507286257565.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17697289714572728238.hoa' '-atoms' '/tmp/LTL11028873586748430314.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/LTL11028873586748430314.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17697289714572728238.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t21, t26, t31, t32, t34, t37, t40, t43, t46, t49, t52, t55, t58, t67, t70, t75, t77, t80,...341
Computing Next relation with stutter on 41 deadlock states
Detected timeout of ITS tools.
[2025-05-29 18:44:48] [INFO ] Flatten gal took : 19 ms
[2025-05-29 18:44:48] [INFO ] Flatten gal took : 19 ms
[2025-05-29 18:44:48] [INFO ] Time to serialize gal into /tmp/LTL4405669120153828354.gal : 5 ms
[2025-05-29 18:44:48] [INFO ] Time to serialize properties into /tmp/LTL1152504753060618752.ltl : 14 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/LTL4405669120153828354.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1152504753060618752.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 : !(((G("((p46==0)||(p164==1))"))U(X((G(!("((p46==0)||(p164==1))")))||(X((!("((p34==0)||(p260==1))"))||(G(F("((p192==0)||(p93==1))")))))...159
Formula 0 simplified : F!"((p46==0)||(p164==1))" R X(F"((p46==0)||(p164==1))" & X("((p34==0)||(p260==1))" & FG!"((p192==0)||(p93==1))"))
Reverse transition relation is NOT exact ! Due to transitions t2, t21, t26, t31, t32, t34, t37, t40, t43, t46, t49, t52, t55, t58, t67, t70, t75, t77, t80,...341
Computing Next relation with stutter on 41 deadlock states
Detected timeout of ITS tools.
[2025-05-29 18:45:03] [INFO ] Flatten gal took : 14 ms
[2025-05-29 18:45:03] [INFO ] Applying decomposition
[2025-05-29 18:45:03] [INFO ] Flatten gal took : 12 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/graph6415973667636148272.txt' '-o' '/tmp/graph6415973667636148272.bin' '-w' '/tmp/graph6415973667636148272.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6415973667636148272.bin' '-l' '-1' '-v' '-w' '/tmp/graph6415973667636148272.weights' '-q' '0' '-e' '0.001'
[2025-05-29 18:45:03] [INFO ] Decomposing Gal with order
[2025-05-29 18:45:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 18:45:03] [INFO ] Removed a total of 31 redundant transitions.
[2025-05-29 18:45:03] [INFO ] Flatten gal took : 67 ms
[2025-05-29 18:45:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 14 ms.
[2025-05-29 18:45:03] [INFO ] Time to serialize gal into /tmp/LTL15225758247712384955.gal : 6 ms
[2025-05-29 18:45:03] [INFO ] Time to serialize properties into /tmp/LTL16067544219150854462.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/LTL15225758247712384955.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16067544219150854462.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...256
Read 1 LTL properties
Checking formula 0 : !(((G("((i6.u16.p46==0)||(i14.u47.p164==1))"))U(X((G(!("((i6.u16.p46==0)||(i14.u47.p164==1))")))||(X((!("((i11.i0.u11.p34==0)||(i16.u6...226
Formula 0 simplified : F!"((i6.u16.p46==0)||(i14.u47.p164==1))" R X(F"((i6.u16.p46==0)||(i14.u47.p164==1))" & X("((i11.i0.u11.p34==0)||(i16.u67.p260==1))" ...203
Reverse transition relation is NOT exact ! Due to transitions t97, t101, t113, t117, i0.u50.t40, i0.u51.t37, i0.u52.t34, i1.i1.u30.t80, i2.u26.t88, i2.u28....569
Computing Next relation with stutter on 41 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
222 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.27168,92328,1,0,164442,955,2595,220495,273,3080,400628
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-02-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BusinessProcesses-PT-02-LTLCardinality-03 finished in 312658 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((G(F(p0)) U G((!p1&&X((!p1 U (!p0||G(!p1))))))))))'
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 158/158 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 157
Applied a total of 2 rules in 9 ms. Remains 193 /194 variables (removed 1) and now considering 157/158 (removed 1) transitions.
// Phase 1: matrix 157 rows 193 cols
[2025-05-29 18:45:06] [INFO ] Computed 38 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:45:06] [INFO ] Implicit Places using invariants in 218 ms returned []
[2025-05-29 18:45:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:45:07] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2025-05-29 18:45:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 2/193 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:11] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:12] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:12] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:12] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:12] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:12] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:12] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:12] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:12] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:13] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:13] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:13] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:13] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:13] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:14] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 157/350 variables, 193/246 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:19] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:19] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:25] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 7 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/350 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (OVERLAPS) 0/350 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 249 constraints, problems are : Problem set: 0 solved, 156 unsolved in 29674 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 2/193 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:38] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:38] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:39] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:39] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:39] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:39] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:39] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:40] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 157/350 variables, 193/257 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 156/413 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:45] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:46] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:46] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:46] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:49] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:45:57] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:04] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:06] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 11 ms to minimize.
SMT process timed out in 59707ms, After SMT, problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 59708ms
Starting structural reductions in LTL mode, iteration 1 : 193/194 places, 157/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60436 ms. Remains : 193/194 places, 157/158 transitions.
Stuttering acceptance computed with spot in 350 ms :[p1, p1, p1, (NOT p0), (AND (NOT p0) (NOT p1)), (AND p1 p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-05
Product exploration explored 100000 steps with 19954 reset in 278 ms.
Stack based approach found an accepted trace after 5999 steps with 1207 reset with depth 6 and stack size 6 in 25 ms.
FORMULA BusinessProcesses-PT-02-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-02-LTLCardinality-05 finished in 61123 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(G(p0)))'
Support contains 1 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 158/158 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 158
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 190 transition count 155
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 190 transition count 155
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 188 transition count 153
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 188 transition count 153
Applied a total of 11 rules in 34 ms. Remains 188 /194 variables (removed 6) and now considering 153/158 (removed 5) transitions.
// Phase 1: matrix 153 rows 188 cols
[2025-05-29 18:46:07] [INFO ] Computed 37 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:46:07] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-05-29 18:46:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:46:08] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2025-05-29 18:46:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:13] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:13] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:13] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:13] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:13] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:13] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:13] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:14] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:14] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:14] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:14] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:14] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:14] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:15] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:15] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:15] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:15] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:16] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:16] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:17] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:17] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:17] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:18] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:18] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:18] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:18] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:18] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:20] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:20] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:20] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:21] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:21] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:21] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:22] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:23] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:23] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:23] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:23] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:26] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:27] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 153/341 variables, 188/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:31] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:31] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:31] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 16 (OVERLAPS) 0/341 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 268 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 43/80 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/341 variables, 188/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 152/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:44] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:44] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:44] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:45] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:45] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:51] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:53] [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-05-29 18:46:53] [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-05-29 18:46: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-05-29 18:46:54] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 5/430 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:46:59] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 431 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Starting structural reductions in LTL mode, iteration 1 : 188/194 places, 153/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60934 ms. Remains : 188/194 places, 153/158 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-06
Product exploration explored 100000 steps with 1341 reset in 217 ms.
Product exploration explored 100000 steps with 1366 reset in 263 ms.
Computed a total of 181 stabilizing places and 144 stable transitions
Graph (complete) has 375 edges and 188 vertex of which 185 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 181 stabilizing places and 144 stable transitions
Detected a total of 181/188 stabilizing places and 144/153 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (526 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (105 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 825 steps, run visited all 1 properties in 17 ms. (steps per millisecond=48 )
Probabilistic random walk after 825 steps, saw 683 distinct states, run finished after 26 ms. (steps per millisecond=31 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-02-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-02-LTLCardinality-06 finished in 62059 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(F(p0)))'
Support contains 2 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 158/158 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 158
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 190 transition count 155
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 190 transition count 155
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 188 transition count 153
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 188 transition count 153
Applied a total of 11 rules in 20 ms. Remains 188 /194 variables (removed 6) and now considering 153/158 (removed 5) transitions.
[2025-05-29 18:47:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:47:09] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-05-29 18:47:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:47:10] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2025-05-29 18:47:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:14] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:14] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:14] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:15] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:15] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:15] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:15] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:15] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:15] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:15] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:15] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:16] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:16] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:16] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:16] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:16] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:16] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:17] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:18] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:18] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:18] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:19] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:19] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:19] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:19] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:19] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:20] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:21] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:21] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:21] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:22] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:22] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:22] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:23] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:24] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:24] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:24] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:24] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:27] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:28] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 153/341 variables, 188/265 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:32] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:32] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:32] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 16 (OVERLAPS) 0/341 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 268 constraints, problems are : Problem set: 0 solved, 152 unsolved in 29966 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 43/80 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/341 variables, 188/268 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 152/420 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:46] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:46] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:46] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:47] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:47] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47:54] [INFO ] Deduced a trap along path composed of 5 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:47: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-05-29 18:47:56] [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-05-29 18:47:56] [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-05-29 18:47:57] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 5/430 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:48:03] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 431 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 59994ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 59995ms
Starting structural reductions in LTL mode, iteration 1 : 188/194 places, 153/158 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60527 ms. Remains : 188/194 places, 153/158 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Computed a total of 181 stabilizing places and 144 stable transitions
Graph (complete) has 375 edges and 188 vertex of which 185 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 181 stabilizing places and 144 stable transitions
Detected a total of 181/188 stabilizing places and 144/153 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-02-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-02-LTLCardinality-07 finished in 60962 ms.
All properties solved by simple procedures.
Total runtime 623305 ms.
BK_STOP 1748544490577
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="BusinessProcesses-PT-02"
export BK_EXAMINATION="LTLCardinality"
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 BusinessProcesses-PT-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-smll-174853813100011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-02.tgz
mv BusinessProcesses-PT-02 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;