About the Execution of ITS-Tools for BusinessProcesses-PT-01
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 718581.00 | 0.00 | 0.00 | TTFFFFTFTFTFTFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813100003.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-01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813100003
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 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 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K 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 47K 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-01-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-01-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748542181756
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-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-29 18:09:44] [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:09:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:09:44] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2025-05-29 18:09:44] [INFO ] Transformed 200 places.
[2025-05-29 18:09:44] [INFO ] Transformed 178 transitions.
[2025-05-29 18:09:44] [INFO ] Found NUPN structural information;
[2025-05-29 18:09:44] [INFO ] Parsed PT model containing 200 places and 178 transitions and 487 arcs in 380 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-01-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 177/177 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 197 transition count 177
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 29 place count 170 transition count 150
Iterating global reduction 1 with 27 rules applied. Total rules applied 56 place count 170 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 170 transition count 149
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 70 place count 157 transition count 136
Iterating global reduction 2 with 13 rules applied. Total rules applied 83 place count 157 transition count 136
Applied a total of 83 rules in 133 ms. Remains 157 /199 variables (removed 42) and now considering 136/177 (removed 41) transitions.
// Phase 1: matrix 136 rows 157 cols
[2025-05-29 18:09:45] [INFO ] Computed 28 invariants in 42 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:09:45] [INFO ] Implicit Places using invariants in 671 ms returned []
[2025-05-29 18:09:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:09:47] [INFO ] Implicit Places using invariants and state equation in 1637 ms returned []
Implicit Place search using SMT with State Equation took 2386 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2025-05-29 18:09:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:50] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:50] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:50] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:51] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:51] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:51] [INFO ] Deduced a trap composed of 30 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:09:51] [INFO ] Deduced a trap composed of 29 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:09:51] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:51] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:51] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:51] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:51] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:51] [INFO ] Deduced a trap composed of 15 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:09:52] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:52] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:52] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:52] [INFO ] Deduced a trap composed of 20 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:09:52] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:52] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:52] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:53] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:53] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:54] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:54] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:54] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:54] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:54] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:54] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:55] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:55] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:55] [INFO ] Deduced a trap composed of 22 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:09:55] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:55] [INFO ] Deduced a trap composed of 19 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:09:55] [INFO ] Deduced a trap composed of 14 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:09:55] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 18 ms to minimize.
Problem TDEAD111 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:56] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 18 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:56] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 18 ms to minimize.
Problem TDEAD118 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:56] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 18/66 constraints. Problems are: Problem set: 4 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:56] [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:09:57] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:57] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:57] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:57] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:57] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:57] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:57] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:58] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:58] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 10/76 constraints. Problems are: Problem set: 4 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:59] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:09:59] [INFO ] Deduced a trap composed of 31 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:09:59] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 3/79 constraints. Problems are: Problem set: 4 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:00] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:00] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:00] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:00] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:01] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:01] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 6/85 constraints. Problems are: Problem set: 4 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:01] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:02] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 2/87 constraints. Problems are: Problem set: 4 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:02] [INFO ] Deduced a trap composed of 21 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:10:03] [INFO ] Deduced a trap composed of 13 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:10:03] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 3/90 constraints. Problems are: Problem set: 4 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:05] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 1/91 constraints. Problems are: Problem set: 4 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:06] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:06] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 2/93 constraints. Problems are: Problem set: 4 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:07] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 1/94 constraints. Problems are: Problem set: 4 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:08] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/157 variables, 1/95 constraints. Problems are: Problem set: 4 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:09] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:09] [INFO ] Deduced a trap composed of 14 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:10:10] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:10] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 20 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/157 variables, 4/99 constraints. Problems are: Problem set: 4 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:11] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:11] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:11] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/157 variables, 3/102 constraints. Problems are: Problem set: 4 solved, 131 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/157 variables, 0/102 constraints. Problems are: Problem set: 4 solved, 131 unsolved
At refinement iteration 17 (OVERLAPS) 136/293 variables, 157/259 constraints. Problems are: Problem set: 4 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:14] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:14] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:14] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 11 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/293 variables, 3/262 constraints. Problems are: Problem set: 4 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 293/293 variables, and 262 constraints, problems are : Problem set: 4 solved, 131 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 131 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 9/9 constraints. Problems are: Problem set: 4 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 19/28 constraints. Problems are: Problem set: 4 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 77/105 constraints. Problems are: Problem set: 4 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:18] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 1/106 constraints. Problems are: Problem set: 4 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/106 constraints. Problems are: Problem set: 4 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 136/293 variables, 157/263 constraints. Problems are: Problem set: 4 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 131/394 constraints. Problems are: Problem set: 4 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:22] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:22] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:22] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:23] [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:10:24] [INFO ] Deduced a trap composed of 21 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:10:24] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 6/400 constraints. Problems are: Problem set: 4 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:28] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 1/401 constraints. Problems are: Problem set: 4 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:37] [INFO ] Deduced a trap along path composed of 3 places in 43 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:41] [INFO ] Deduced a trap along path composed of 11 places in 45 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 2/403 constraints. Problems are: Problem set: 4 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:46] [INFO ] Deduced a trap composed of 19 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:10:47] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 293/293 variables, and 405 constraints, problems are : Problem set: 4 solved, 131 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 131/135 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60154ms problems are : Problem set: 4 solved, 131 unsolved
Search for dead transitions found 4 dead transitions in 60175ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 157/199 places, 132/177 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 155 transition count 132
Applied a total of 2 rules in 12 ms. Remains 155 /157 variables (removed 2) and now considering 132/132 (removed 0) transitions.
// Phase 1: matrix 132 rows 155 cols
[2025-05-29 18:10:47] [INFO ] Computed 28 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:10:47] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-05-29 18:10:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:10:48] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 155/199 places, 132/177 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63182 ms. Remains : 155/199 places, 132/177 transitions.
Support contains 27 out of 155 places after structural reductions.
[2025-05-29 18:10:48] [INFO ] Flatten gal took : 60 ms
[2025-05-29 18:10:48] [INFO ] Flatten gal took : 26 ms
[2025-05-29 18:10:48] [INFO ] Input system was already deterministic with 132 transitions.
Support contains 25 out of 155 places (down from 27) after GAL structural reductions.
RANDOM walk for 16890 steps (198 resets) in 725 ms. (23 steps per ms) remains 0/15 properties
FORMULA BusinessProcesses-PT-01-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 130 stabilizing places and 108 stable transitions
Graph (complete) has 316 edges and 155 vertex of which 154 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 132/132 transitions.
Graph (trivial) has 80 edges and 155 vertex of which 6 / 155 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 309 edges and 150 vertex of which 149 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 148 transition count 104
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 128 transition count 104
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 42 place count 128 transition count 77
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 102 place count 95 transition count 77
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 108 place count 89 transition count 71
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 89 transition count 71
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 114 place count 89 transition count 68
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 120 place count 86 transition count 68
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 190 place count 50 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 192 place count 49 transition count 37
Applied a total of 192 rules in 63 ms. Remains 49 /155 variables (removed 106) and now considering 37/132 (removed 95) transitions.
// Phase 1: matrix 37 rows 49 cols
[2025-05-29 18:10:49] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:10:49] [INFO ] Implicit Places using invariants in 100 ms returned [4, 7, 8, 9, 13]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 103 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/155 places, 37/132 transitions.
Applied a total of 0 rules in 7 ms. Remains 44 /44 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 174 ms. Remains : 44/155 places, 37/132 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-00
Product exploration explored 100000 steps with 14508 reset in 610 ms.
Product exploration explored 100000 steps with 14632 reset in 272 ms.
Computed a total of 37 stabilizing places and 30 stable transitions
Computed a total of 37 stabilizing places and 30 stable transitions
Detected a total of 37/44 stabilizing places and 30/37 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 based reduction with 4 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 98 steps (19 resets) in 4 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 37/37 transitions.
Applied a total of 0 rules in 4 ms. Remains 44 /44 variables (removed 0) and now considering 37/37 (removed 0) transitions.
// Phase 1: matrix 37 rows 44 cols
[2025-05-29 18:10:51] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:10:51] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-05-29 18:10:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:10:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-29 18:10:51] [INFO ] Implicit Places using invariants and state equation in 175 ms returned [1, 6, 10, 11, 15, 17, 19, 21, 23, 25, 27]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 289 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/44 places, 37/37 transitions.
Graph (complete) has 82 edges and 33 vertex of which 31 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 31 transition count 31
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 26 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 25 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 25 transition count 29
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 20 place count 21 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 20 transition count 25
Applied a total of 22 rules in 9 ms. Remains 20 /33 variables (removed 13) and now considering 25/37 (removed 12) transitions.
// Phase 1: matrix 25 rows 20 cols
[2025-05-29 18:10:51] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:10:51] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-05-29 18:10:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:10:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-29 18:10:51] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/44 places, 25/37 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 431 ms. Remains : 20/44 places, 25/37 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 60 edges and 20 vertex of which 18 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Detected a total of 13/20 stabilizing places and 18/25 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 based reduction with 4 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 54 steps (9 resets) in 5 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15343 reset in 188 ms.
Product exploration explored 100000 steps with 15359 reset in 349 ms.
Built C files in :
/tmp/ltsmin11629572040679826754
[2025-05-29 18:10:53] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2025-05-29 18:10:53] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 18:10:53] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2025-05-29 18:10:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 18:10:53] [INFO ] Computing Do-Not-Accords matrix : 25 transitions.
[2025-05-29 18:10:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 18:10:53] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11629572040679826754
Running compilation step : cd /tmp/ltsmin11629572040679826754;'/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 502 ms.
Running link step : cd /tmp/ltsmin11629572040679826754;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin11629572040679826754;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16323340940674262086.hoa' '--buchi-type=spotba'
LTSmin run took 175 ms.
FORMULA BusinessProcesses-PT-01-LTLCardinality-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-01-LTLCardinality-00 finished in 4640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((!p0&&X(F(p1)))||G(F(p1)))))))'
Support contains 3 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 132/132 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 149 transition count 126
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 149 transition count 126
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 146 transition count 123
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 146 transition count 123
Applied a total of 18 rules in 11 ms. Remains 146 /155 variables (removed 9) and now considering 123/132 (removed 9) transitions.
// Phase 1: matrix 123 rows 146 cols
[2025-05-29 18:10:53] [INFO ] Computed 28 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:10:54] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-05-29 18:10:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:10:54] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2025-05-29 18:10: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/145 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:56] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:56] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:56] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:56] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:56] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:57] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:57] [INFO ] Deduced a trap composed of 20 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:10:57] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:57] [INFO ] Deduced a trap composed of 11 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:10:57] [INFO ] Deduced a trap composed of 20 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:10:57] [INFO ] Deduced a trap composed of 17 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:10:57] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:58] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:58] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:10:58] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 15/43 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/269 variables, 146/189 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:00] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:00] [INFO ] Deduced a trap composed of 8 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:11:01] [INFO ] Deduced a trap composed of 9 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:11:01] [INFO ] Deduced a trap composed of 11 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:11:01] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 5/194 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:04] [INFO ] Deduced a trap along path composed of 5 places in 51 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:05] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:06] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:11] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:11] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:11] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 6 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/269 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:13] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:18] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 10 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/269 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:21] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/269 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/269 variables, and 203 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:24] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:25] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:26] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:26] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:27] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:27] [INFO ] Deduced a trap composed of 14 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:11:27] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:27] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:27] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 123/269 variables, 146/209 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 122/331 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:29] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:29] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:29] [INFO ] Deduced a trap composed of 21 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:11:30] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:30] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:30] [INFO ] Deduced a trap composed of 14 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:11:31] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 7/338 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:32] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:34] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:36] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:36] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:40] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:44] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:44] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:44] [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:11:45] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 13 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 4/347 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:50] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/269 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 122 unsolved
SMT process timed out in 60059ms, After SMT, problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in LTL mode, iteration 1 : 146/155 places, 123/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60559 ms. Remains : 146/155 places, 123/132 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-01
Product exploration explored 100000 steps with 4381 reset in 133 ms.
Product exploration explored 100000 steps with 4354 reset in 219 ms.
Computed a total of 123 stabilizing places and 101 stable transitions
Graph (complete) has 303 edges and 146 vertex of which 145 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 123 stabilizing places and 101 stable transitions
Detected a total of 123/146 stabilizing places and 101/123 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 186 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 9672 steps (119 resets) in 40 ms. (235 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 345 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Applied a total of 0 rules in 5 ms. Remains 146 /146 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2025-05-29 18:11:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:11:56] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-05-29 18:11:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:11:56] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2025-05-29 18:11:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:58] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:58] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:58] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:58] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:58] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:58] [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:11:58] [INFO ] Deduced a trap composed of 20 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:11:59] [INFO ] Deduced a trap composed of 17 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:11:59] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:59] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:59] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:59] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:59] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:59] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:11:59] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 15/43 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/269 variables, 146/189 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:01] [INFO ] Deduced a trap composed of 27 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:12:01] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:02] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:02] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:02] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 5/194 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:04] [INFO ] Deduced a trap along path composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:05] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:06] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:09] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:10] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:10] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 13 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/269 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:12] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:17] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 12 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/269 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:19] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/269 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:24] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/269 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 (/ 1.0 4.0))
(s88 (/ 3.0 4.0))
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 timeout
0.0 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 269/269 variables, and 204 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:27] [INFO ] Deduced a trap composed of 30 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:12:27] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:28] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:28] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:29] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:29] [INFO ] Deduced a trap composed of 14 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:12:29] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:29] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:29] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 123/269 variables, 146/209 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 122/331 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:32] [INFO ] Deduced a trap composed of 12 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:12:32] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:32] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:33] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:33] [INFO ] Deduced a trap composed of 32 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:12:33] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:34] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 7/338 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:36] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:39] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:40] [INFO ] Deduced a trap composed of 19 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:12:40] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:44] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:48] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:48] [INFO ] Deduced a trap composed of 21 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:12:49] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:49] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 11 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 4/347 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:12:55] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/269 variables, and 348 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/4 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Finished structural reductions in LTL mode , in 1 iterations and 60423 ms. Remains : 146/146 places, 123/123 transitions.
Computed a total of 123 stabilizing places and 101 stable transitions
Graph (complete) has 303 edges and 146 vertex of which 145 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 123 stabilizing places and 101 stable transitions
Detected a total of 123/146 stabilizing places and 101/123 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 244 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 8310 steps (87 resets) in 101 ms. (81 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 518 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 4372 reset in 196 ms.
Product exploration explored 100000 steps with 4354 reset in 218 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Graph (trivial) has 70 edges and 146 vertex of which 6 / 146 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 296 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 140 transition count 116
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 16 place count 140 transition count 134
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 38 place count 140 transition count 134
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 135 transition count 125
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 135 transition count 125
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 92 place count 135 transition count 125
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 125 transition count 115
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 125 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 125 transition count 130
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 123 transition count 126
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 123 transition count 126
Deduced a syphon composed of 64 places in 1 ms
Applied a total of 117 rules in 60 ms. Remains 123 /146 variables (removed 23) and now considering 126/123 (removed -3) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 18:12:59] [INFO ] Redundant transitions in 6 ms returned []
Running 124 sub problems to find dead transitions.
// Phase 1: matrix 126 rows 123 cols
[2025-05-29 18:12:59] [INFO ] Computed 28 invariants in 3 ms
[2025-05-29 18:12:59] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:01] [INFO ] Deduced a trap composed of 2 places in 154 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:01] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:01] [INFO ] Deduced a trap composed of 3 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:13:01] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:01] [INFO ] Deduced a trap composed of 3 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:13:01] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:01] [INFO ] Deduced a trap composed of 7 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:13:01] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:02] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 6 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:02] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 5 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:13:02] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 4 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:02] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 3 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:02] [INFO ] Deduced a trap composed of 3 places in 37 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:13:02] [INFO ] Deduced a trap composed of 3 places in 38 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:13:02] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 4 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:02] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 4 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:02] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 4 ms to minimize.
Problem TDEAD27 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 TDEAD35 is UNSAT
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:02] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 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 TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 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 TDEAD35 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 20/48 constraints. Problems are: Problem set: 83 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:03] [INFO ] Deduced a trap composed of 15 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:13:03] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:03] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:03] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 8 ms to minimize.
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:03] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 8 ms to minimize.
Problem TDEAD74 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 5/53 constraints. Problems are: Problem set: 85 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/53 constraints. Problems are: Problem set: 85 solved, 39 unsolved
Problem TDEAD38 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 6 (OVERLAPS) 125/248 variables, 123/176 constraints. Problems are: Problem set: 87 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 10/186 constraints. Problems are: Problem set: 87 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/186 constraints. Problems are: Problem set: 87 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 1/249 variables, 1/187 constraints. Problems are: Problem set: 87 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/187 constraints. Problems are: Problem set: 87 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 0/249 variables, 0/187 constraints. Problems are: Problem set: 87 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 187 constraints, problems are : Problem set: 87 solved, 37 unsolved in 6776 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 123/123 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 87 solved, 37 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 87 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 53/111 variables, 18/18 constraints. Problems are: Problem set: 87 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 25/43 constraints. Problems are: Problem set: 87 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:06] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:06] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:06] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:06] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 4/47 constraints. Problems are: Problem set: 87 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/47 constraints. Problems are: Problem set: 87 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 10/121 variables, 10/57 constraints. Problems are: Problem set: 87 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/57 constraints. Problems are: Problem set: 87 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 125/246 variables, 121/178 constraints. Problems are: Problem set: 87 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 10/188 constraints. Problems are: Problem set: 87 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 37/225 constraints. Problems are: Problem set: 87 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/225 constraints. Problems are: Problem set: 87 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 2/248 variables, 2/227 constraints. Problems are: Problem set: 87 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 0/227 constraints. Problems are: Problem set: 87 solved, 37 unsolved
At refinement iteration 13 (OVERLAPS) 1/249 variables, 1/228 constraints. Problems are: Problem set: 87 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:12] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 1/229 constraints. Problems are: Problem set: 87 solved, 37 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 0/229 constraints. Problems are: Problem set: 87 solved, 37 unsolved
At refinement iteration 16 (OVERLAPS) 0/249 variables, 0/229 constraints. Problems are: Problem set: 87 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 229 constraints, problems are : Problem set: 87 solved, 37 unsolved in 11849 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 123/123 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 37/124 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18687ms problems are : Problem set: 87 solved, 37 unsolved
Search for dead transitions found 87 dead transitions in 18690ms
Found 87 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 87 transitions
Dead transitions reduction (with SMT) removed 87 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 123/146 places, 39/123 transitions.
Graph (complete) has 222 edges and 123 vertex of which 59 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.1 ms
Discarding 64 places :
Also discarding 0 output transitions
Ensure Unique test removed 8 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 6 ms. Remains 51 /123 variables (removed 72) and now considering 41/39 (removed -2) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/146 places, 41/123 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18771 ms. Remains : 51/146 places, 41/123 transitions.
Built C files in :
/tmp/ltsmin18217924636845987407
[2025-05-29 18:13:18] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18217924636845987407
Running compilation step : cd /tmp/ltsmin18217924636845987407;'/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 307 ms.
Running link step : cd /tmp/ltsmin18217924636845987407;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin18217924636845987407;'/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/stateBased15247693693165617863.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 146 cols
[2025-05-29 18:13:33] [INFO ] Computed 28 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:13:33] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-05-29 18:13:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:13:33] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2025-05-29 18:13:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:35] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:35] [INFO ] Deduced a trap composed of 28 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:13:35] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:35] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:35] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:36] [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:13:36] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:36] [INFO ] Deduced a trap composed of 17 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:13:36] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:36] [INFO ] Deduced a trap composed of 20 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:13:36] [INFO ] Deduced a trap composed of 17 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:13:36] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:36] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:37] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:37] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 15/43 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/269 variables, 146/189 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:39] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:39] [INFO ] Deduced a trap composed of 8 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:13:39] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:39] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:40] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 5/194 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:42] [INFO ] Deduced a trap along path composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:44] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:44] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:48] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:49] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:49] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/269 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:51] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:56] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 9 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/269 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:13:59] [INFO ] Deduced a trap along path composed of 3 places in 49 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/269 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:03] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/269 variables, and 204 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:04] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:04] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:05] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:05] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:06] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:06] [INFO ] Deduced a trap composed of 14 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:14:06] [INFO ] Deduced a trap composed of 24 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:14:06] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:06] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 123/269 variables, 146/209 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 122/331 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:09] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:09] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:09] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:09] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:10] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:10] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:10] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 7/338 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:12] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:15] [INFO ] Deduced a trap composed of 23 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:14:16] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:16] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:19] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:23] [INFO ] Deduced a trap composed of 22 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:14:23] [INFO ] Deduced a trap composed of 21 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:14:23] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:24] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 14 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 4/347 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:14:29] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/269 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 122 unsolved
SMT process timed out in 60048ms, After SMT, problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Finished structural reductions in LTL mode , in 1 iterations and 60338 ms. Remains : 146/146 places, 123/123 transitions.
Built C files in :
/tmp/ltsmin11656881589853601262
[2025-05-29 18:14:33] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11656881589853601262
Running compilation step : cd /tmp/ltsmin11656881589853601262;'/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 326 ms.
Running link step : cd /tmp/ltsmin11656881589853601262;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11656881589853601262;'/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/stateBased8904266791046099452.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 18:14:48] [INFO ] Flatten gal took : 12 ms
[2025-05-29 18:14:48] [INFO ] Flatten gal took : 12 ms
[2025-05-29 18:14:48] [INFO ] Time to serialize gal into /tmp/LTL7665849363633373811.gal : 5 ms
[2025-05-29 18:14:48] [INFO ] Time to serialize properties into /tmp/LTL2299374785410868613.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/LTL7665849363633373811.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12957733341050726545.hoa' '-atoms' '/tmp/LTL2299374785410868613.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2299374785410868613.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12957733341050726545.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t12, t26, t29, t33, t34, t36, t40, t43, t46, t49, t52, t58, t61, t64, t68, t69, t72, ...316
Computing Next relation with stutter on 105 deadlock states
Detected timeout of ITS tools.
[2025-05-29 18:15:03] [INFO ] Flatten gal took : 11 ms
[2025-05-29 18:15:03] [INFO ] Flatten gal took : 10 ms
[2025-05-29 18:15:03] [INFO ] Time to serialize gal into /tmp/LTL13548252136512052015.gal : 3 ms
[2025-05-29 18:15:03] [INFO ] Time to serialize properties into /tmp/LTL4104327094022028039.ltl : 6 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/LTL13548252136512052015.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4104327094022028039.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...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F("(p166!=1)")))||(("((p130!=0)&&(p31!=1))")&&(X(F("(p166!=1)")))))))))
Formula 0 simplified : XXG(FG!"(p166!=1)" & (!"((p130!=0)&&(p31!=1))" | XG!"(p166!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t12, t26, t29, t33, t34, t36, t40, t43, t46, t49, t52, t58, t61, t64, t68, t69, t72, ...316
Computing Next relation with stutter on 105 deadlock states
Detected timeout of ITS tools.
[2025-05-29 18:15:18] [INFO ] Flatten gal took : 10 ms
[2025-05-29 18:15:18] [INFO ] Applying decomposition
[2025-05-29 18:15:18] [INFO ] Flatten gal took : 9 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/graph7868691630444461583.txt' '-o' '/tmp/graph7868691630444461583.bin' '-w' '/tmp/graph7868691630444461583.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7868691630444461583.bin' '-l' '-1' '-v' '-w' '/tmp/graph7868691630444461583.weights' '-q' '0' '-e' '0.001'
[2025-05-29 18:15:19] [INFO ] Decomposing Gal with order
[2025-05-29 18:15:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 18:15:19] [INFO ] Removed a total of 29 redundant transitions.
[2025-05-29 18:15:19] [INFO ] Flatten gal took : 95 ms
[2025-05-29 18:15:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-05-29 18:15:19] [INFO ] Time to serialize gal into /tmp/LTL1950317903736817692.gal : 10 ms
[2025-05-29 18:15:19] [INFO ] Time to serialize properties into /tmp/LTL9340451673740869331.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1950317903736817692.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9340451673740869331.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F("(i14.u41.p166!=1)")))||(("((i12.u37.p130!=0)&&(i4.u10.p31!=1))")&&(X(F("(i14.u41.p166!=1)")))))))))
Formula 0 simplified : XXG(FG!"(i14.u41.p166!=1)" & (!"((i12.u37.p130!=0)&&(i4.u10.p31!=1))" | XG!"(i14.u41.p166!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t73, t77, t81, t92, t122, i0.u23.t61, i1.t69, i1.u6.t95, i1.u16.t72, i2.u4.t100, i4.t87, i4.u...504
Computing Next relation with stutter on 105 deadlock states
4 unique states visited
0 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
83 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,0.871206,39112,1,0,50361,336,2031,66554,218,751,121905
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-01-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-01-LTLCardinality-01 finished in 266328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(((F(p1) U X(G(p2))) U X(p3)))))'
Support contains 7 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 132/132 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 149 transition count 126
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 149 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 147 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 147 transition count 124
Applied a total of 16 rules in 9 ms. Remains 147 /155 variables (removed 8) and now considering 124/132 (removed 8) transitions.
// Phase 1: matrix 124 rows 147 cols
[2025-05-29 18:15:20] [INFO ] Computed 28 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:15:20] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-05-29 18:15:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:15:20] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2025-05-29 18:15:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:22] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:22] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:22] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:22] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:22] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:22] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:22] [INFO ] Deduced a trap composed of 19 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:15:22] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:23] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:23] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:23] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:23] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:23] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:24] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:25] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:25] [INFO ] Deduced a trap composed of 20 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:15:25] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:26] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 21 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 124/271 variables, 147/193 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:29] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:29] [INFO ] Deduced a trap composed of 8 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:15:29] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:29] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:29] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:29] [INFO ] Deduced a trap composed of 18 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:15:30] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:30] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 8/201 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:32] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:32] [INFO ] Deduced a trap along path composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 0/271 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 203 constraints, problems are : Problem set: 0 solved, 123 unsolved in 18075 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 124/271 variables, 147/201 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 123/324 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:41] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:43] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:43] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:44] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:45] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:48] [INFO ] Deduced a trap composed of 19 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:15:48] [INFO ] Deduced a trap composed of 20 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:15:48] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:49] [INFO ] Deduced a trap composed of 21 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:15:49] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 5/334 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:15:59] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:07] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:07] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 271/271 variables, and 339 constraints, problems are : Problem set: 0 solved, 123 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 48103ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 48104ms
Starting structural reductions in LTL mode, iteration 1 : 147/155 places, 124/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48415 ms. Remains : 147/155 places, 124/132 transitions.
Stuttering acceptance computed with spot in 412 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), false, (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-04
Stuttering criterion allowed to conclude after 59 steps with 3 reset in 1 ms.
FORMULA BusinessProcesses-PT-01-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLCardinality-04 finished in 48865 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(G(p0)) U p1)))'
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 132/132 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 147 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 147 transition count 124
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 144 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 144 transition count 121
Applied a total of 22 rules in 14 ms. Remains 144 /155 variables (removed 11) and now considering 121/132 (removed 11) transitions.
// Phase 1: matrix 121 rows 144 cols
[2025-05-29 18:16:09] [INFO ] Computed 28 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:16:09] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-05-29 18:16:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:16:09] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2025-05-29 18:16:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:11] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:11] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:11] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:11] [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:16:11] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:11] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:12] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:12] [INFO ] Deduced a trap composed of 24 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:16:12] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:12] [INFO ] Deduced a trap composed of 30 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:16:12] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:12] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:13] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:13] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:13] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:13] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 16/44 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:14] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:15] [INFO ] Deduced a trap composed of 17 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:16:15] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:15] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:16] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:16] [INFO ] Deduced a trap composed of 34 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:16:16] [INFO ] Deduced a trap composed of 26 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:16:16] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:17] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 121/265 variables, 144/197 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:19] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:19] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:19] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:19] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:21] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:22] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:25] [INFO ] Deduced a trap along path composed of 8 places in 39 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:27] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:27] [INFO ] Deduced a trap along path composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:30] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 16 (OVERLAPS) 0/265 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 207 constraints, problems are : Problem set: 0 solved, 120 unsolved in 26613 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 31/59 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:36] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:37] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:37] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 121/265 variables, 144/206 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 120/326 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:39] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:39] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:39] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:40] [INFO ] Deduced a trap composed of 21 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:16:40] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:40] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 6/332 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:42] [INFO ] Deduced a trap composed of 20 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:16:42] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 4/338 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:16:47] [INFO ] Deduced a trap composed of 19 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:16:49] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:04] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/265 variables, and 341 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 56647ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 56648ms
Starting structural reductions in LTL mode, iteration 1 : 144/155 places, 121/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57128 ms. Remains : 144/155 places, 121/132 transitions.
Stuttering acceptance computed with spot in 303 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 449 ms.
Product exploration explored 100000 steps with 50000 reset in 332 ms.
Computed a total of 121 stabilizing places and 99 stable transitions
Graph (complete) has 297 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 121 stabilizing places and 99 stable transitions
Detected a total of 121/144 stabilizing places and 99/121 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 22 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-01-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-01-LTLCardinality-06 finished in 58280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(X(X(p0)))&&F(p1)))))))'
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 132/132 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 148 transition count 125
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 148 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 146 transition count 123
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 146 transition count 123
Applied a total of 18 rules in 9 ms. Remains 146 /155 variables (removed 9) and now considering 123/132 (removed 9) transitions.
// Phase 1: matrix 123 rows 146 cols
[2025-05-29 18:17:07] [INFO ] Computed 28 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:17:07] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-05-29 18:17:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:17:07] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2025-05-29 18:17: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/145 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:10] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:10] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:10] [INFO ] Deduced a trap composed of 27 places in 307 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:11] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:11] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:11] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:11] [INFO ] Deduced a trap composed of 15 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:17:11] [INFO ] Deduced a trap composed of 17 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:17:12] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:12] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:12] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:12] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:12] [INFO ] Deduced a trap composed of 17 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:17:12] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:13] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:13] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 16/44 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:14] [INFO ] Deduced a trap composed of 21 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:17:14] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:14] [INFO ] Deduced a trap composed of 20 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:17:15] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:15] [INFO ] Deduced a trap composed of 18 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:17:15] [INFO ] Deduced a trap composed of 20 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:17:16] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:16] [INFO ] Deduced a trap composed of 20 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:17:17] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:18] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:18] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:19] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:19] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:19] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:19] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:20] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:20] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:20] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:20] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:20] [INFO ] Deduced a trap composed of 32 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:17:21] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:21] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:22] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 19 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (OVERLAPS) 123/269 variables, 146/213 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:25] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:26] [INFO ] Deduced a trap composed of 11 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:17:26] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:26] [INFO ] Deduced a trap composed of 16 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:17:26] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 5/218 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:28] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:29] [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:17:30] [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:17:30] [INFO ] Deduced a trap along path composed of 10 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:30] [INFO ] Deduced a trap along path composed of 6 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:17:30] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/269 variables, 5/224 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/269 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:34] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 10 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/269 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:36] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 18 (INCLUDED_ONLY) 0/269 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/269 variables, and 226 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 47/75 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/269 variables, 146/221 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 122/343 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:41] [INFO ] Deduced a trap composed of 8 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:17:41] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:41] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:44] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:48] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 5/353 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:00] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:02] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/269 variables, and 355 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Starting structural reductions in LTL mode, iteration 1 : 146/155 places, 123/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60518 ms. Remains : 146/155 places, 123/132 transitions.
Stuttering acceptance computed with spot in 632 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-10
Product exploration explored 100000 steps with 14285 reset in 366 ms.
Product exploration explored 100000 steps with 14285 reset in 277 ms.
Computed a total of 121 stabilizing places and 99 stable transitions
Graph (complete) has 299 edges and 146 vertex of which 145 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 121 stabilizing places and 99 stable transitions
Detected a total of 121/146 stabilizing places and 99/123 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 11 states, 15 edges and 2 AP (stutter sensitive) to 11 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 600 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 169 steps (0 resets) in 8 ms. (18 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 2 factoid took 279 ms. Reduced automaton from 11 states, 15 edges and 2 AP (stutter sensitive) to 11 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 592 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 559 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2025-05-29 18:18:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:18:11] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-05-29 18:18:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:18:11] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2025-05-29 18:18:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:13] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:13] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:13] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:13] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:13] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:13] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:13] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:13] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:14] [INFO ] Deduced a trap composed of 21 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:18:14] [INFO ] Deduced a trap composed of 21 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:18:14] [INFO ] Deduced a trap composed of 12 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:18:14] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:14] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:14] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:14] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:15] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 16/44 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:16] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:16] [INFO ] Deduced a trap composed of 15 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:18:16] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:16] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:17] [INFO ] Deduced a trap composed of 18 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:18:17] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:17] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:18] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:18] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:19] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:19] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:20] [INFO ] Deduced a trap composed of 31 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:18:20] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:21] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:21] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:21] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:21] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:21] [INFO ] Deduced a trap composed of 14 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:18:21] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:22] [INFO ] Deduced a trap composed of 32 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:18:22] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:22] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:24] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 18 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (OVERLAPS) 123/269 variables, 146/213 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:27] [INFO ] Deduced a trap composed of 8 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:18:27] [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:18:27] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:27] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:28] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 5/218 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:29] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:31] [INFO ] Deduced a trap along path composed of 3 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:31] [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:18:31] [INFO ] Deduced a trap along path composed of 10 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:18:31] [INFO ] Deduced a trap along path composed of 6 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:18:32] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/269 variables, 5/224 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/269 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:36] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 9 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/269 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:37] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 5 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/269 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/269 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 20 (OVERLAPS) 0/269 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 226 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 47/75 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/269 variables, 146/221 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 122/343 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:45] [INFO ] Deduced a trap composed of 8 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:18:45] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:45] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 3/346 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:47] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:51] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 5/353 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:02] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:03] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/269 variables, and 355 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60044ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 60045ms
Finished structural reductions in LTL mode , in 1 iterations and 60450 ms. Remains : 146/146 places, 123/123 transitions.
Computed a total of 121 stabilizing places and 99 stable transitions
Graph (complete) has 299 edges and 146 vertex of which 145 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 121 stabilizing places and 99 stable transitions
Detected a total of 121/146 stabilizing places and 99/123 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 11 states, 15 edges and 2 AP (stutter sensitive) to 11 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 616 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 98 steps (0 resets) in 6 ms. (14 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 2 factoid took 284 ms. Reduced automaton from 11 states, 15 edges and 2 AP (stutter sensitive) to 11 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 639 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 616 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 617 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 14285 reset in 396 ms.
Product exploration explored 100000 steps with 14285 reset in 309 ms.
Applying partial POR strategy [false, false, false, false, false, true, false, false, false, false, true]
Stuttering acceptance computed with spot in 533 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 123/123 transitions.
Graph (trivial) has 68 edges and 146 vertex of which 6 / 146 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 292 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 140 transition count 116
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 24 Pre rules applied. Total rules applied 15 place count 140 transition count 133
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 39 place count 140 transition count 133
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 134 transition count 123
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 134 transition count 123
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 90 place count 134 transition count 123
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 97 place count 127 transition count 116
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 104 place count 127 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 127 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 126 transition count 119
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 126 transition count 119
Deduced a syphon composed of 63 places in 0 ms
Applied a total of 107 rules in 45 ms. Remains 126 /146 variables (removed 20) and now considering 119/123 (removed 4) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 18:19:16] [INFO ] Redundant transitions in 6 ms returned []
Running 118 sub problems to find dead transitions.
// Phase 1: matrix 119 rows 126 cols
[2025-05-29 18:19:16] [INFO ] Computed 28 invariants in 5 ms
[2025-05-29 18:19:16] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:18] [INFO ] Deduced a trap composed of 3 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:19:18] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:18] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 9 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:18] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:18] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 9 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:18] [INFO ] Deduced a trap composed of 4 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:19:19] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 9 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:19] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:19] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:19] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 4 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:19] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 3 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:19] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 4 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:19] [INFO ] Deduced a trap composed of 3 places in 38 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:19:19] [INFO ] Deduced a trap composed of 3 places in 41 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:19:19] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 4 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:19] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 3 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:19] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 10 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:19] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 4 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:19] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:19] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 4 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 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 TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 20/48 constraints. Problems are: Problem set: 70 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:20] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 3 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:20] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 4 ms to minimize.
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:20] [INFO ] Deduced a trap composed of 14 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:19:20] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 9 ms to minimize.
Problem TDEAD59 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:20] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:20] [INFO ] Deduced a trap composed of 14 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:19:20] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 7 ms to minimize.
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:20] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:20] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 5 ms to minimize.
Problem TDEAD81 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:21] [INFO ] Deduced a trap composed of 10 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:19:21] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 11/59 constraints. Problems are: Problem set: 75 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/59 constraints. Problems are: Problem set: 75 solved, 43 unsolved
Problem TDEAD41 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 6 (OVERLAPS) 118/244 variables, 126/185 constraints. Problems are: Problem set: 77 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 10/195 constraints. Problems are: Problem set: 77 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:22] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 1/196 constraints. Problems are: Problem set: 77 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:23] [INFO ] Deduced a trap along path composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 1/197 constraints. Problems are: Problem set: 77 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 0/197 constraints. Problems are: Problem set: 77 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 1/245 variables, 1/198 constraints. Problems are: Problem set: 77 solved, 41 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/198 constraints. Problems are: Problem set: 77 solved, 41 unsolved
At refinement iteration 13 (OVERLAPS) 0/245 variables, 0/198 constraints. Problems are: Problem set: 77 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 198 constraints, problems are : Problem set: 77 solved, 41 unsolved in 9362 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 126/126 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 77 solved, 41 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 77 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 52/114 variables, 18/18 constraints. Problems are: Problem set: 77 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 32/50 constraints. Problems are: Problem set: 77 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:25] [INFO ] Deduced a trap composed of 10 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:19:26] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:26] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:26] [INFO ] Deduced a trap composed of 14 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:19:26] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:26] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 6/56 constraints. Problems are: Problem set: 77 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/56 constraints. Problems are: Problem set: 77 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 10/124 variables, 10/66 constraints. Problems are: Problem set: 77 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/66 constraints. Problems are: Problem set: 77 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 118/242 variables, 124/190 constraints. Problems are: Problem set: 77 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 10/200 constraints. Problems are: Problem set: 77 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 41/241 constraints. Problems are: Problem set: 77 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:28] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 1/242 constraints. Problems are: Problem set: 77 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 1/243 constraints. Problems are: Problem set: 77 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:30] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 1/244 constraints. Problems are: Problem set: 77 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:32] [INFO ] Deduced a trap along path composed of 5 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:19:32] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 2/246 constraints. Problems are: Problem set: 77 solved, 41 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 0/246 constraints. Problems are: Problem set: 77 solved, 41 unsolved
At refinement iteration 15 (OVERLAPS) 2/244 variables, 2/248 constraints. Problems are: Problem set: 77 solved, 41 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/244 variables, 0/248 constraints. Problems are: Problem set: 77 solved, 41 unsolved
At refinement iteration 17 (OVERLAPS) 1/245 variables, 1/249 constraints. Problems are: Problem set: 77 solved, 41 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/245 variables, 0/249 constraints. Problems are: Problem set: 77 solved, 41 unsolved
At refinement iteration 19 (OVERLAPS) 0/245 variables, 0/249 constraints. Problems are: Problem set: 77 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 249 constraints, problems are : Problem set: 77 solved, 41 unsolved in 23552 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 126/126 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 41/118 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 32950ms problems are : Problem set: 77 solved, 41 unsolved
Search for dead transitions found 77 dead transitions in 32954ms
Found 77 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 77 transitions
Dead transitions reduction (with SMT) removed 77 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 126/146 places, 42/123 transitions.
Graph (complete) has 219 edges and 126 vertex of which 63 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.1 ms
Discarding 63 places :
Also discarding 0 output transitions
Ensure Unique test removed 8 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 55 transition count 44
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 5 ms. Remains 55 /126 variables (removed 71) and now considering 44/42 (removed -2) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/146 places, 44/123 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33018 ms. Remains : 55/146 places, 44/123 transitions.
Built C files in :
/tmp/ltsmin5892758558730098737
[2025-05-29 18:19:49] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5892758558730098737
Running compilation step : cd /tmp/ltsmin5892758558730098737;'/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 544 ms.
Running link step : cd /tmp/ltsmin5892758558730098737;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin5892758558730098737;'/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/stateBased1476272380301900073.hoa' '--buchi-type=spotba'
LTSmin run took 2685 ms.
FORMULA BusinessProcesses-PT-01-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-01-LTLCardinality-10 finished in 165299 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)))'
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 132/132 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 146 transition count 123
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 146 transition count 123
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 143 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 143 transition count 120
Applied a total of 24 rules in 6 ms. Remains 143 /155 variables (removed 12) and now considering 120/132 (removed 12) transitions.
// Phase 1: matrix 120 rows 143 cols
[2025-05-29 18:19:52] [INFO ] Computed 28 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:19:52] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-05-29 18:19:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:19:53] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2025-05-29 18:19:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:55] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:55] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:55] [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:19:55] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:55] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:55] [INFO ] Deduced a trap composed of 24 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:19:56] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:56] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:56] [INFO ] Deduced a trap composed of 34 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:19:56] [INFO ] Deduced a trap composed of 17 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:19:56] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:56] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:56] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:56] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 14/42 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:57] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:57] [INFO ] Deduced a trap composed of 20 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:19:57] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/263 variables, 143/188 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:00] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:00] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:00] [INFO ] Deduced a trap composed of 11 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:20:00] [INFO ] Deduced a trap composed of 11 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:20:01] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:01] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:01] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:02] [INFO ] Deduced a trap composed of 19 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:20:02] [INFO ] Deduced a trap composed of 16 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:20:02] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:02] [INFO ] Deduced a trap composed of 19 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:20:02] [INFO ] Deduced a trap composed of 33 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:20:02] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 7/201 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:04] [INFO ] Deduced a trap along path composed of 8 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:05] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/263 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 203 constraints, problems are : Problem set: 0 solved, 119 unsolved in 15941 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 30/58 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:09] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:10] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:10] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 120/263 variables, 143/204 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 119/323 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:13] [INFO ] Deduced a trap composed of 14 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:20:14] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:14] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 17 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:15] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:17] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:19] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:22] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:25] [INFO ] Deduced a trap composed of 13 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:20:25] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:26] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 3/333 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:35] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 9 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/263 variables, and 336 constraints, problems are : Problem set: 0 solved, 119 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 45974ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 45990ms
Starting structural reductions in LTL mode, iteration 1 : 143/155 places, 120/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46411 ms. Remains : 143/155 places, 120/132 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-12
Product exploration explored 100000 steps with 33333 reset in 72 ms.
Product exploration explored 100000 steps with 33333 reset in 84 ms.
Computed a total of 120 stabilizing places and 98 stable transitions
Graph (complete) has 296 edges and 143 vertex of which 142 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 120 stabilizing places and 98 stable transitions
Detected a total of 120/143 stabilizing places and 98/120 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [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 3 factoid took 20 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-01-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-01-LTLCardinality-12 finished in 46775 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((X(p0) U p1))))'
Support contains 2 out of 155 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 132/132 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 146 transition count 123
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 146 transition count 123
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 144 transition count 121
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 144 transition count 121
Applied a total of 22 rules in 7 ms. Remains 144 /155 variables (removed 11) and now considering 121/132 (removed 11) transitions.
// Phase 1: matrix 121 rows 144 cols
[2025-05-29 18:20:39] [INFO ] Computed 28 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:20:39] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-05-29 18:20:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:20:39] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2025-05-29 18:20:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:41] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:41] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:42] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:42] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:42] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:42] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:42] [INFO ] Deduced a trap composed of 10 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:20:42] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:42] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:42] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:43] [INFO ] Deduced a trap composed of 24 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:20:43] [INFO ] Deduced a trap composed of 20 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:20:43] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:43] [INFO ] Deduced a trap composed of 18 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:20:43] [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:20:43] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:43] [INFO ] Deduced a trap composed of 27 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:20:44] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:44] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:45] [INFO ] Deduced a trap composed of 14 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:20:45] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:45] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:46] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:46] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:47] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:47] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:47] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:47] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:47] [INFO ] Deduced a trap composed of 26 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:20:47] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:49] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:50] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:50] [INFO ] Deduced a trap composed of 34 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:20:50] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:51] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:51] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 121/265 variables, 144/208 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:54] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:54] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:56] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:56] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:57] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:57] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:58] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:58] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:59] [INFO ] Deduced a trap composed of 17 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:20:59] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:02] [INFO ] Deduced a trap along path composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/265 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:04] [INFO ] Deduced a trap composed of 11 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:21:04] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 8 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/265 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:06] [INFO ] Deduced a trap along path composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/265 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 120 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 265/265 variables, and 222 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 48/76 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/265 variables, 144/220 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 120/340 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:12] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:13] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:13] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:26] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 5 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/265 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:34] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/265 variables, and 347 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60043ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 60044ms
Starting structural reductions in LTL mode, iteration 1 : 144/155 places, 121/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60469 ms. Remains : 144/155 places, 121/132 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Computed a total of 121 stabilizing places and 99 stable transitions
Graph (complete) has 299 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 121 stabilizing places and 99 stable transitions
Detected a total of 121/144 stabilizing places and 99/121 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 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-01-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-01-LTLCardinality-14 finished in 60883 ms.
All properties solved by simple procedures.
Total runtime 716265 ms.
BK_STOP 1748542900337
--------------------
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-01"
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-01, 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-174853813100003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-01.tgz
mv BusinessProcesses-PT-01 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 ;