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 | 726190.00 | 0.00 | 0.00 | FFFFFFFFFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813100004.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813100004
=====================================================================
--------------------
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-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-01-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748542634065
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability PT
Running Version 202505121319
[2025-05-29 18:17:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 18:17:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:17:17] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2025-05-29 18:17:17] [INFO ] Transformed 200 places.
[2025-05-29 18:17:17] [INFO ] Transformed 178 transitions.
[2025-05-29 18:17:17] [INFO ] Found NUPN structural information;
[2025-05-29 18:17:17] [INFO ] Parsed PT model containing 200 places and 178 transitions and 487 arcs in 386 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-01-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 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 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 69 place count 158 transition count 137
Iterating global reduction 2 with 12 rules applied. Total rules applied 81 place count 158 transition count 137
Applied a total of 81 rules in 126 ms. Remains 158 /199 variables (removed 41) and now considering 137/177 (removed 40) transitions.
// Phase 1: matrix 137 rows 158 cols
[2025-05-29 18:17:17] [INFO ] Computed 28 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:17:18] [INFO ] Implicit Places using invariants in 508 ms returned []
[2025-05-29 18:17:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:17:18] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 1023 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2025-05-29 18:17:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 136 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 35 places in 193 ms of which 29 ms to minimize.
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 33 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:17:22] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 22 ms to minimize.
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 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:17:23] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:23] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:23] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:23] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:23] [INFO ] Deduced a trap composed of 14 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:17:24] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:24] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:24] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:24] [INFO ] Deduced a trap composed of 24 places in 118 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:24] [INFO ] Deduced a trap composed of 21 places in 76 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:24] [INFO ] Deduced a trap composed of 32 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:17:24] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:24] [INFO ] Deduced a trap composed of 35 places in 93 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:25] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 15 ms to minimize.
Problem TDEAD112 is UNSAT
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 16 places in 111 ms of which 14 ms to minimize.
Problem TDEAD115 is UNSAT
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 16 places in 112 ms of which 18 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 20/48 constraints. Problems are: Problem set: 4 solved, 132 unsolved
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 36 places in 103 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:26] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:26] [INFO ] Deduced a trap composed of 34 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:17:26] [INFO ] Deduced a trap composed of 35 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:17:27] [INFO ] Deduced a trap composed of 12 places in 177 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:27] [INFO ] Deduced a trap composed of 14 places in 152 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:27] [INFO ] Deduced a trap composed of 34 places in 149 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:27] [INFO ] Deduced a trap composed of 23 places in 128 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:28] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:28] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 20 ms to minimize.
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 20 places in 162 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:28] [INFO ] Deduced a trap composed of 37 places in 179 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:28] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 20 ms to minimize.
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 35 places in 118 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:29] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:29] [INFO ] Deduced a trap composed of 22 places in 86 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:29] [INFO ] Deduced a trap composed of 28 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:17:29] [INFO ] Deduced a trap composed of 23 places in 76 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:29] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:29] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 20/68 constraints. Problems are: Problem set: 4 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:30] [INFO ] Deduced a trap composed of 11 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:17:30] [INFO ] Deduced a trap composed of 31 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:17:31] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 3/71 constraints. Problems are: Problem set: 4 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:32] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 1/72 constraints. Problems are: Problem set: 4 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:33] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:33] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 2/74 constraints. Problems are: Problem set: 4 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/74 constraints. Problems are: Problem set: 4 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 137/295 variables, 158/232 constraints. Problems are: Problem set: 4 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:37] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:37] [INFO ] Deduced a trap composed of 31 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:37] [INFO ] Deduced a trap composed of 8 places in 93 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:38] [INFO ] Deduced a trap composed of 11 places in 115 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:38] [INFO ] Deduced a trap composed of 14 places in 142 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:38] [INFO ] Deduced a trap composed of 11 places in 119 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:38] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 7/239 constraints. Problems are: Problem set: 4 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:40] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:40] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:40] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 3/242 constraints. Problems are: Problem set: 4 solved, 132 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 12 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:17:41] [INFO ] Deduced a trap composed of 19 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:17:42] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 3/245 constraints. Problems are: Problem set: 4 solved, 132 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 19 places in 74 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:44] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/295 variables, 2/247 constraints. Problems are: Problem set: 4 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:46] [INFO ] Deduced a trap composed of 23 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:17:46] [INFO ] Deduced a trap composed of 26 places in 84 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:46] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 11 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/295 variables, 3/250 constraints. Problems are: Problem set: 4 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:47] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 3 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 15 (INCLUDED_ONLY) 0/295 variables, 1/251 constraints. Problems are: Problem set: 4 solved, 132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 295/295 variables, and 251 constraints, problems are : Problem set: 4 solved, 132 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 10/10 constraints. Problems are: Problem set: 4 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 18/28 constraints. Problems are: Problem set: 4 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 65/93 constraints. Problems are: Problem set: 4 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:50] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 1/94 constraints. Problems are: Problem set: 4 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:51] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 27 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 1/95 constraints. Problems are: Problem set: 4 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/95 constraints. Problems are: Problem set: 4 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 137/295 variables, 158/253 constraints. Problems are: Problem set: 4 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 132/385 constraints. Problems are: Problem set: 4 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:54] [INFO ] Deduced a trap composed of 18 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:17:54] [INFO ] Deduced a trap composed of 21 places in 58 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:54] [INFO ] Deduced a trap composed of 21 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:17:56] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 4/389 constraints. Problems are: Problem set: 4 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:17:59] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 1/390 constraints. Problems are: Problem set: 4 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:05] [INFO ] Deduced a trap composed of 28 places in 127 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:05] [INFO ] Deduced a trap composed of 29 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:07] [INFO ] Deduced a trap composed of 27 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:18:07] [INFO ] Deduced a trap composed of 28 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:18:09] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 5/395 constraints. Problems are: Problem set: 4 solved, 132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/295 variables, and 395 constraints, problems are : Problem set: 4 solved, 132 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 132/136 constraints, Known Traps: 77/77 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60181ms problems are : Problem set: 4 solved, 132 unsolved
Search for dead transitions found 4 dead transitions in 60206ms
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 : 158/199 places, 133/177 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 133
Applied a total of 1 rules in 7 ms. Remains 157 /158 variables (removed 1) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 157 cols
[2025-05-29 18:18:18] [INFO ] Computed 29 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:18:19] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-05-29 18:18:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:18:19] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 157/199 places, 133/177 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61819 ms. Remains : 157/199 places, 133/177 transitions.
Support contains 36 out of 157 places after structural reductions.
[2025-05-29 18:18:19] [INFO ] Flatten gal took : 66 ms
[2025-05-29 18:18:19] [INFO ] Flatten gal took : 25 ms
[2025-05-29 18:18:19] [INFO ] Input system was already deterministic with 133 transitions.
RANDOM walk for 14342 steps (156 resets) in 733 ms. (19 steps per ms) remains 0/28 properties
FORMULA BusinessProcesses-PT-01-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 129 stabilizing places and 106 stable transitions
Graph (complete) has 317 edges and 157 vertex of which 156 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||G((F(!p0)&&p1))))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 133/133 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 156 transition count 133
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 146 transition count 123
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 146 transition count 123
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 143 transition count 120
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 143 transition count 120
Applied a total of 27 rules in 19 ms. Remains 143 /157 variables (removed 14) and now considering 120/133 (removed 13) transitions.
// Phase 1: matrix 120 rows 143 cols
[2025-05-29 18:18:20] [INFO ] Computed 28 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:18:21] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-05-29 18:18:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:18:21] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2025-05-29 18:18:21] [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:18:23] [INFO ] Deduced a trap composed of 27 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:18:23] [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:18:23] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:23] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 15 ms to minimize.
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 9 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:18:24] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:24] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 13 ms to minimize.
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 30 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:18:24] [INFO ] Deduced a trap composed of 34 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:24] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:25] [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:18:25] [INFO ] Deduced a trap composed of 26 places in 107 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:25] [INFO ] Deduced a trap composed of 26 places in 102 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:25] [INFO ] Deduced a trap composed of 27 places in 107 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:18:26] [INFO ] Deduced a trap composed of 20 places in 93 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:26] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:27] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 11 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:18:30] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:30] [INFO ] Deduced a trap composed of 8 places in 82 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:30] [INFO ] Deduced a trap composed of 11 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:30] [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:18:31] [INFO ] Deduced a trap composed of 12 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:18:31] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 6 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:18:32] [INFO ] Deduced a trap composed of 15 places in 89 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:32] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 14 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 composed of 16 places in 95 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:32] [INFO ] Deduced a trap composed of 27 places in 94 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:32] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:32] [INFO ] Deduced a trap composed of 33 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:18:32] [INFO ] Deduced a trap composed of 36 places in 78 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:18:34] [INFO ] Deduced a trap along path composed of 8 places in 35 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:35] [INFO ] Deduced a trap along path composed of 3 places in 27 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 17900 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:18:40] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:40] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 19 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:18:41] [INFO ] Deduced a trap composed of 10 places in 43 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:18:44] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:44] [INFO ] Deduced a trap composed of 8 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:18:44] [INFO ] Deduced a trap composed of 14 places in 123 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:18:45] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 13 ms to minimize.
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 21 places in 46 ms of which 3 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:18:49] [INFO ] Deduced a trap composed of 19 places in 57 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:18:53] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 4 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:18:56] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:18:56] [INFO ] Deduced a trap composed of 21 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:57] [INFO ] Deduced a trap composed of 14 places in 58 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:19:06] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 6 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 47946ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 47948ms
Starting structural reductions in LTL mode, iteration 1 : 143/157 places, 120/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48418 ms. Remains : 143/157 places, 120/133 transitions.
Stuttering acceptance computed with spot in 477 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-01
Product exploration explored 100000 steps with 4804 reset in 656 ms.
Stack based approach found an accepted trace after 283 steps with 13 reset with depth 8 and stack size 8 in 2 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-01 finished in 49662 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)&&X(F(p1))))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 133/133 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 156 transition count 133
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 147 transition count 124
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 147 transition count 124
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 144 transition count 121
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 144 transition count 121
Applied a total of 25 rules in 10 ms. Remains 144 /157 variables (removed 13) and now considering 121/133 (removed 12) transitions.
// Phase 1: matrix 121 rows 144 cols
[2025-05-29 18:19:10] [INFO ] Computed 28 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:19:10] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-05-29 18:19:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:19:10] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2025-05-29 18:19:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/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:19:13] [INFO ] Deduced a trap composed of 30 places in 112 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:13] [INFO ] Deduced a trap composed of 28 places in 117 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:13] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:13] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:13] [INFO ] Deduced a trap composed of 28 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:19:13] [INFO ] Deduced a trap composed of 9 places in 85 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:14] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:14] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:14] [INFO ] Deduced a trap composed of 30 places in 91 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:14] [INFO ] Deduced a trap composed of 17 places in 95 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:14] [INFO ] Deduced a trap composed of 33 places in 95 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:14] [INFO ] Deduced a trap composed of 22 places in 123 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:15] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:15] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:15] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 15/43 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:19:16] [INFO ] Deduced a trap composed of 45 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:19:16] [INFO ] Deduced a trap composed of 21 places in 84 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:16] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:16] [INFO ] Deduced a trap composed of 20 places in 82 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:16] [INFO ] Deduced a trap composed of 13 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:19:16] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/265 variables, 144/193 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:19:19] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:19] [INFO ] Deduced a trap composed of 27 places in 97 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:20] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 3/196 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:19:22] [INFO ] Deduced a trap along path composed of 3 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:19:22] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:22] [INFO ] Deduced a trap along path composed of 8 places in 32 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 3/199 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:19:24] [INFO ] Deduced a trap along path composed of 4 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:19:24] [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/265 variables, 2/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:19:26] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 3 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:19:27] [INFO ] Deduced a trap composed of 15 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:19:28] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:28] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:28] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (OVERLAPS) 0/265 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 206 constraints, problems are : Problem set: 0 solved, 120 unsolved in 21370 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: 29/29 constraints, Known Traps Along Path: 5/5 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, 29/57 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:19:32] [INFO ] Deduced a trap composed of 20 places in 83 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:33] [INFO ] Deduced a trap composed of 26 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:19:33] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 3/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:19:33] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 1/61 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:19:34] [INFO ] Deduced a trap composed of 32 places in 102 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:34] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 121/265 variables, 144/207 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 120/327 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:19:37] [INFO ] Deduced a trap composed of 34 places in 109 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:37] [INFO ] Deduced a trap composed of 38 places in 123 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:37] [INFO ] Deduced a trap composed of 39 places in 122 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:37] [INFO ] Deduced a trap composed of 39 places in 130 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:37] [INFO ] Deduced a trap composed of 40 places in 119 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:37] [INFO ] Deduced a trap composed of 34 places in 122 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:38] [INFO ] Deduced a trap composed of 35 places in 123 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:38] [INFO ] Deduced a trap composed of 39 places in 119 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:38] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:38] [INFO ] Deduced a trap composed of 39 places in 92 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:38] [INFO ] Deduced a trap composed of 40 places in 126 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:38] [INFO ] Deduced a trap composed of 40 places in 136 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:38] [INFO ] Deduced a trap composed of 40 places in 115 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:38] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:39] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:39] [INFO ] Deduced a trap composed of 40 places in 116 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:39] [INFO ] Deduced a trap composed of 41 places in 103 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:39] [INFO ] Deduced a trap composed of 41 places in 102 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:39] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:39] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 20/347 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:19:40] [INFO ] Deduced a trap composed of 14 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:19:41] [INFO ] Deduced a trap composed of 36 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:19:41] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:41] [INFO ] Deduced a trap composed of 41 places in 126 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:41] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:41] [INFO ] Deduced a trap composed of 42 places in 119 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:41] [INFO ] Deduced a trap composed of 37 places in 130 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:41] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:41] [INFO ] Deduced a trap composed of 43 places in 84 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:42] [INFO ] Deduced a trap composed of 43 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:19:42] [INFO ] Deduced a trap composed of 44 places in 121 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:42] [INFO ] Deduced a trap composed of 38 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:19:42] [INFO ] Deduced a trap composed of 43 places in 79 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:42] [INFO ] Deduced a trap composed of 44 places in 101 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:42] [INFO ] Deduced a trap composed of 44 places in 99 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:42] [INFO ] Deduced a trap composed of 42 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:19:42] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:42] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:43] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:43] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 14 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 20/367 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:19:44] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:45] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:45] [INFO ] Deduced a trap composed of 44 places in 130 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:45] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:19:45] [INFO ] Deduced a trap composed of 45 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:19:45] [INFO ] Deduced a trap composed of 45 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:19:45] [INFO ] Deduced a trap composed of 46 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:19:46] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 8/375 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:19:49] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 1/376 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:19:55] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 15 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 1/377 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:19:58] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 120 unsolved
SMT process timed out in 51404ms, After SMT, problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 51407ms
Starting structural reductions in LTL mode, iteration 1 : 144/157 places, 121/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51777 ms. Remains : 144/157 places, 121/133 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-02
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-02 finished in 51944 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&&(p1 U G(p0))))||X(X(p1)))))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 133/133 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 156 transition count 133
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 146 transition count 123
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 146 transition count 123
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 143 transition count 120
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 143 transition count 120
Applied a total of 27 rules in 9 ms. Remains 143 /157 variables (removed 14) and now considering 120/133 (removed 13) transitions.
// Phase 1: matrix 120 rows 143 cols
[2025-05-29 18:20:02] [INFO ] Computed 28 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:20:02] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-05-29 18:20:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:20:02] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2025-05-29 18:20:02] [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:20:05] [INFO ] Deduced a trap composed of 27 places in 88 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:05] [INFO ] Deduced a trap composed of 27 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:20:05] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:05] [INFO ] Deduced a trap composed of 27 places in 100 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:05] [INFO ] Deduced a trap composed of 9 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:20:05] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:06] [INFO ] Deduced a trap composed of 19 places in 93 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:06] [INFO ] Deduced a trap composed of 30 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:20:06] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:06] [INFO ] Deduced a trap composed of 17 places in 84 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:06] [INFO ] Deduced a trap composed of 21 places in 109 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:06] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:06] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:06] [INFO ] Deduced a trap composed of 27 places in 103 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:20:08] [INFO ] Deduced a trap composed of 20 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:20:08] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:08] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 12 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:11] [INFO ] Deduced a trap composed of 26 places in 85 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:11] [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:20:11] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:12] [INFO ] Deduced a trap composed of 11 places in 43 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:12] [INFO ] Deduced a trap composed of 12 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:12] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 5 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:13] [INFO ] Deduced a trap composed of 15 places in 79 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:13] [INFO ] Deduced a trap composed of 19 places in 115 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:13] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:13] [INFO ] Deduced a trap composed of 27 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:20:13] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:13] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:13] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 9 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:16] [INFO ] Deduced a trap along path composed of 8 places in 28 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:16] [INFO ] Deduced a trap along path composed of 3 places in 29 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 16860 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:20] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:20] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 19 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:21] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 2 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:23] [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:20:23] [INFO ] Deduced a trap composed of 8 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:20:24] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 10 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:24] [INFO ] Deduced a trap composed of 31 places in 87 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:26] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 3 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:27] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 12 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:31] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 6 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:34] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:34] [INFO ] Deduced a trap composed of 21 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:20:35] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 9 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:44] [INFO ] Deduced a trap composed of 27 places in 83 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 30013 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 46897ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 46899ms
Starting structural reductions in LTL mode, iteration 1 : 143/157 places, 120/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47337 ms. Remains : 143/157 places, 120/133 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-03
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-03 finished in 47572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U (G(p0)||p1))) U (G(X((p0 U (p1||G(p0)))))||(G(p2)&&X((p0 U (p1||G(p0))))))))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 133/133 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 156 transition count 133
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 148 transition count 125
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 148 transition count 125
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 146 transition count 123
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 146 transition count 123
Applied a total of 21 rules in 16 ms. Remains 146 /157 variables (removed 11) and now considering 123/133 (removed 10) transitions.
// Phase 1: matrix 123 rows 146 cols
[2025-05-29 18:20:49] [INFO ] Computed 28 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:20:50] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-05-29 18:20:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:20:50] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2025-05-29 18:20:50] [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:20:52] [INFO ] Deduced a trap composed of 30 places in 104 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:52] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:52] [INFO ] Deduced a trap composed of 30 places in 93 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:53] [INFO ] Deduced a trap composed of 26 places in 96 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:53] [INFO ] Deduced a trap composed of 31 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:53] [INFO ] Deduced a trap composed of 26 places in 101 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:53] [INFO ] Deduced a trap composed of 28 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:20:53] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:53] [INFO ] Deduced a trap composed of 29 places in 106 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:53] [INFO ] Deduced a trap composed of 28 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:20:53] [INFO ] Deduced a trap composed of 9 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:20:54] [INFO ] Deduced a trap composed of 29 places in 107 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:54] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:54] [INFO ] Deduced a trap composed of 15 places in 101 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:54] [INFO ] Deduced a trap composed of 20 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:20:54] [INFO ] Deduced a trap composed of 20 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:20:54] [INFO ] Deduced a trap composed of 26 places in 83 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 30 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:55] [INFO ] Deduced a trap composed of 17 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:20:55] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 20/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:20:56] [INFO ] Deduced a trap composed of 11 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:56] [INFO ] Deduced a trap composed of 28 places in 91 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:56] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:56] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:56] [INFO ] Deduced a trap composed of 21 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:56] [INFO ] Deduced a trap composed of 24 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:56] [INFO ] Deduced a trap composed of 30 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:57] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:57] [INFO ] Deduced a trap composed of 13 places in 59 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:57] [INFO ] Deduced a trap composed of 17 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:20:57] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:57] [INFO ] Deduced a trap composed of 19 places in 83 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:57] [INFO ] Deduced a trap composed of 21 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:20:57] [INFO ] Deduced a trap composed of 27 places in 104 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:58] [INFO ] Deduced a trap composed of 26 places in 94 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:58] [INFO ] Deduced a trap composed of 29 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:20:58] [INFO ] Deduced a trap composed of 29 places in 112 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:58] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:20:58] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 19/67 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:20:59] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 123/269 variables, 146/214 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:21:01] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:02] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:02] [INFO ] Deduced a trap composed of 8 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:21:02] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:02] [INFO ] Deduced a trap composed of 11 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:21:02] [INFO ] Deduced a trap composed of 19 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:21:03] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:03] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:03] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:03] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:03] [INFO ] Deduced a trap composed of 36 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:21:03] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:03] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:04] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:04] [INFO ] Deduced a trap composed of 17 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:21:04] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 16/230 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:21:06] [INFO ] Deduced a trap along path composed of 8 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:06] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/232 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:21:11] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/269 variables, 1/233 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:21:13] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 14 (OVERLAPS) 0/269 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 234 constraints, problems are : Problem set: 0 solved, 122 unsolved in 29142 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: 56/56 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, 56/84 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:21:20] [INFO ] Deduced a trap composed of 24 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:21:20] [INFO ] Deduced a trap composed of 20 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:21:20] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/269 variables, 146/233 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 122/355 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:21:23] [INFO ] Deduced a trap composed of 21 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:21:24] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 4/361 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/361 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:21:41] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/269 variables, 1/362 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 362 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30011 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: 61/61 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 59175ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 59177ms
Starting structural reductions in LTL mode, iteration 1 : 146/157 places, 123/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59658 ms. Remains : 146/157 places, 123/133 transitions.
Stuttering acceptance computed with spot in 298 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-05
Product exploration explored 100000 steps with 1131 reset in 394 ms.
Product exploration explored 100000 steps with 1130 reset in 491 ms.
Computed a total of 123 stabilizing places and 101 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.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 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (AND p1 p2)), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND p0 (NOT p1) p2))), (X (OR (AND p0 p2) (AND p1 p2))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (AND p0 p2) (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 231 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 10 to 8
RANDOM walk for 40000 steps (464 resets) in 360 ms. (110 steps per ms) remains 1/8 properties
BEST_FIRST walk for 4832 steps (10 resets) in 26 ms. (178 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (AND p1 p2)), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND p0 (NOT p1) p2))), (X (OR (AND p0 p2) (AND p1 p2))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (AND p0 p2) (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND p1 p2) (AND p2 p0)))), (F (NOT (AND (OR (NOT p1) p2) (OR p2 (NOT p0))))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (NOT (OR p1 p0))), (F (NOT p0)), (F (NOT (OR p1 p2 p0))), (F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p2 p0)))
Knowledge based reduction with 20 factoid took 676 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-01-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-01-LTLFireability-05 finished in 62249 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(p0) U p1)||F(G(p0)))))))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 133/133 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 156 transition count 133
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 146 transition count 123
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 146 transition count 123
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 143 transition count 120
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 143 transition count 120
Applied a total of 27 rules in 11 ms. Remains 143 /157 variables (removed 14) and now considering 120/133 (removed 13) transitions.
// Phase 1: matrix 120 rows 143 cols
[2025-05-29 18:21:52] [INFO ] Computed 28 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:21:52] [INFO ] Implicit Places using invariants in 263 ms returned []
[2025-05-29 18:21:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:21:52] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2025-05-29 18:21:52] [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:21:54] [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:21:55] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:55] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:55] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:55] [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:21:55] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:55] [INFO ] Deduced a trap composed of 19 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:21:56] [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:21:56] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:56] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:56] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:56] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:56] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:56] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 16 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:21:58] [INFO ] Deduced a trap composed of 20 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:21:58] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:21:58] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 12 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:22:01] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:01] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:01] [INFO ] Deduced a trap composed of 11 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:22:01] [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:22:02] [INFO ] Deduced a trap composed of 12 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:22:02] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 5 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:22:03] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:03] [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:22:03] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:03] [INFO ] Deduced a trap composed of 27 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:22:03] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:03] [INFO ] Deduced a trap composed of 33 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:22:03] [INFO ] Deduced a trap composed of 36 places in 85 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:22:06] [INFO ] Deduced a trap along path composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:06] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 0 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 17509 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:22:11] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:11] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 21 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:22:12] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 3 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:22:14] [INFO ] Deduced a trap composed of 14 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:22:15] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:15] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 10 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:22:16] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:17] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 3 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:22:19] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 11 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:22:23] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 5 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:22:26] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:27] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:27] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 7 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:22:37] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 5 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 30018 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 47547ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 47549ms
Starting structural reductions in LTL mode, iteration 1 : 143/157 places, 120/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48134 ms. Remains : 143/157 places, 120/133 transitions.
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-06
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-06 finished in 48388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(F(p0) U X(X(!p1))))))'
Support contains 4 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 133/133 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 156 transition count 133
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 147 transition count 124
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 147 transition count 124
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 144 transition count 121
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 144 transition count 121
Applied a total of 25 rules in 13 ms. Remains 144 /157 variables (removed 13) and now considering 121/133 (removed 12) transitions.
// Phase 1: matrix 121 rows 144 cols
[2025-05-29 18:22:40] [INFO ] Computed 28 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:22:40] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-05-29 18:22:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:22:40] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2025-05-29 18:22:40] [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:22:42] [INFO ] Deduced a trap composed of 27 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:22:42] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:42] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:42] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:43] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:43] [INFO ] Deduced a trap composed of 8 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:22:43] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:43] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:43] [INFO ] Deduced a trap composed of 19 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:22:43] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:44] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:44] [INFO ] Deduced a trap composed of 33 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:22:44] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:44] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:44] [INFO ] Deduced a trap composed of 26 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:22:44] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 18 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:22:46] [INFO ] Deduced a trap composed of 28 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:22:46] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:46] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:46] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/265 variables, 144/192 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:22:49] [INFO ] Deduced a trap composed of 26 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:22:49] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:49] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:49] [INFO ] Deduced a trap composed of 21 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:22:50] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 5/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:22:51] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:51] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 2/199 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:22:52] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:52] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 2/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:22:56] [INFO ] Deduced a trap along path composed of 6 places in 45 ms of which 2 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:22:56] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:56] [INFO ] Deduced a trap composed of 11 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:22:57] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:22:57] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 11 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 4/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:22:59] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 1/207 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:23:01] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 15 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 1/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:23:03] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 11 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 1/209 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:23:04] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 1/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:23:06] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 9 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/265 variables, 1/211 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:23:08] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/265 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/265 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 265/265 variables, and 212 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: 37/37 constraints, Known Traps Along Path: 3/3 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, 37/65 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:23:11] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:11] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:12] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:12] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:12] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:12] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/265 variables, 144/215 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 120/335 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:23:16] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:16] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 2/337 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:23:18] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 1/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:23:22] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 1/339 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:23:25] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 14 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 1/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:23:31] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:31] [INFO ] Deduced a trap composed of 21 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:23:31] [INFO ] Deduced a trap composed of 24 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:23:33] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 11 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 120 unsolved
SMT process timed out in 60036ms, After SMT, problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 60037ms
Starting structural reductions in LTL mode, iteration 1 : 144/157 places, 121/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60416 ms. Remains : 144/157 places, 121/133 transitions.
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-07
Product exploration explored 100000 steps with 25012 reset in 129 ms.
Product exploration explored 100000 steps with 24931 reset in 148 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.6 ms
Computed a total of 121 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 122 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 7824 steps (88 resets) in 85 ms. (90 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 271 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 144 /144 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2025-05-29 18:23:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:23:43] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-05-29 18:23:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:23:43] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2025-05-29 18:23:43] [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:23:45] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:45] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:46] [INFO ] Deduced a trap composed of 27 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:23:46] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:46] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:46] [INFO ] Deduced a trap composed of 8 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:23:46] [INFO ] Deduced a trap composed of 15 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:23:46] [INFO ] Deduced a trap composed of 24 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:23:46] [INFO ] Deduced a trap composed of 19 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:23:47] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:47] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:47] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:47] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:47] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:47] [INFO ] Deduced a trap composed of 26 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:23:47] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 17 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:23:49] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:49] [INFO ] Deduced a trap composed of 34 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:23:49] [INFO ] Deduced a trap composed of 37 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:23:49] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/265 variables, 144/192 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:23:52] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:52] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:53] [INFO ] Deduced a trap composed of 11 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:23:53] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:53] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 5/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:23:54] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:23:54] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 2/199 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:23:55] [INFO ] Deduced a trap composed of 14 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:23:55] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 2/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:23:59] [INFO ] Deduced a trap along path composed of 6 places in 48 ms of which 3 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:24:00] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:00] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:00] [INFO ] Deduced a trap composed of 19 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:24:00] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 4/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:24:02] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 1/207 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:24:05] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 16 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 1/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:24:06] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 10 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 1/209 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:24:08] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 1/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:24:09] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 10 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/265 variables, 1/211 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:24:11] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/265 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 265/265 variables, and 212 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30022 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: 37/37 constraints, Known Traps Along Path: 3/3 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, 37/65 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:24:14] [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:24:14] [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:24:14] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:14] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:14] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:14] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/265 variables, 144/215 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 120/335 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:24:18] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:18] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 2/337 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:24:20] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 1/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:24:24] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 1/339 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:24:27] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 1/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:24:33] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:33] [INFO ] Deduced a trap composed of 21 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:24:33] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:36] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 120 unsolved
SMT process timed out in 60046ms, After SMT, problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 60047ms
Finished structural reductions in LTL mode , in 1 iterations and 60487 ms. Remains : 144/144 places, 121/121 transitions.
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
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 10054 steps (115 resets) in 47 ms. (209 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 255 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Product exploration explored 100000 steps with 25001 reset in 104 ms.
Product exploration explored 100000 steps with 25012 reset in 114 ms.
Applying partial POR strategy [false, false, true, false, false, true]
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 121/121 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.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 143 transition count 120
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 19 place count 143 transition count 138
Deduced a syphon composed of 39 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 40 place count 143 transition count 138
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 138 transition count 129
Deduced a syphon composed of 34 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 138 transition count 129
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 79 places in 1 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 95 place count 138 transition count 129
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 108 place count 125 transition count 116
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 121 place count 125 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 125 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 123 place count 125 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 124 transition count 115
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 124 transition count 115
Deduced a syphon composed of 66 places in 1 ms
Applied a total of 125 rules in 116 ms. Remains 124 /144 variables (removed 20) and now considering 115/121 (removed 6) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 18:24:46] [INFO ] Redundant transitions in 4 ms returned []
Running 114 sub problems to find dead transitions.
// Phase 1: matrix 115 rows 124 cols
[2025-05-29 18:24:46] [INFO ] Computed 28 invariants in 6 ms
[2025-05-29 18:24:46] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:48] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:48] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 11 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:48] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 9 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:48] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:48] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 8 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:48] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:48] [INFO ] Deduced a trap composed of 3 places in 38 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:24:48] [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:24:48] [INFO ] Deduced a trap composed of 3 places in 31 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:24:48] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 4 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:48] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:48] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 4 ms to minimize.
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:48] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 9 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:48] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 4 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:48] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 4 ms to minimize.
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:49] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 4 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:49] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:49] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 5 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:49] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 3 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:49] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 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 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 TDEAD34 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD110 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 20/48 constraints. Problems are: Problem set: 75 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:49] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:49] [INFO ] Deduced a trap composed of 15 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:24:49] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 9 ms to minimize.
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:49] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 7 ms to minimize.
Problem TDEAD78 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:50] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 7 ms to minimize.
Problem TDEAD80 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:50] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 7 ms to minimize.
Problem TDEAD92 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 6/54 constraints. Problems are: Problem set: 79 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/54 constraints. Problems are: Problem set: 79 solved, 35 unsolved
Problem TDEAD37 is UNSAT
Problem TDEAD73 is UNSAT
At refinement iteration 6 (OVERLAPS) 115/239 variables, 124/178 constraints. Problems are: Problem set: 81 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 1/179 constraints. Problems are: Problem set: 81 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/179 constraints. Problems are: Problem set: 81 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/239 variables, 0/179 constraints. Problems are: Problem set: 81 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 179 constraints, problems are : Problem set: 81 solved, 33 unsolved in 6028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 124/124 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 81 solved, 33 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 81 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 55/112 variables, 18/18 constraints. Problems are: Problem set: 81 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 26/44 constraints. Problems are: Problem set: 81 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:52] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:52] [INFO ] Deduced a trap composed of 11 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:24:52] [INFO ] Deduced a trap composed of 11 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:24:52] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:52] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:52] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 6/50 constraints. Problems are: Problem set: 81 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:24:53] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/51 constraints. Problems are: Problem set: 81 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/51 constraints. Problems are: Problem set: 81 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 10/122 variables, 10/61 constraints. Problems are: Problem set: 81 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/61 constraints. Problems are: Problem set: 81 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 115/237 variables, 122/183 constraints. Problems are: Problem set: 81 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 1/184 constraints. Problems are: Problem set: 81 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 33/217 constraints. Problems are: Problem set: 81 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 0/217 constraints. Problems are: Problem set: 81 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 2/239 variables, 2/219 constraints. Problems are: Problem set: 81 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/239 variables, 0/219 constraints. Problems are: Problem set: 81 solved, 33 unsolved
At refinement iteration 14 (OVERLAPS) 0/239 variables, 0/219 constraints. Problems are: Problem set: 81 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 219 constraints, problems are : Problem set: 81 solved, 33 unsolved in 8346 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 124/124 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/114 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14421ms problems are : Problem set: 81 solved, 33 unsolved
Search for dead transitions found 81 dead transitions in 14422ms
Found 81 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 81 transitions
Dead transitions reduction (with SMT) removed 81 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 124/144 places, 34/121 transitions.
Graph (complete) has 209 edges and 124 vertex of which 58 are kept as prefixes of interest. Removing 66 places using SCC suffix rule.1 ms
Discarding 66 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 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 36
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 8 ms. Remains 50 /124 variables (removed 74) and now considering 36/34 (removed -2) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/144 places, 36/121 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14562 ms. Remains : 50/144 places, 36/121 transitions.
Built C files in :
/tmp/ltsmin865808301237272622
[2025-05-29 18:25:00] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin865808301237272622
Running compilation step : cd /tmp/ltsmin865808301237272622;'/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 761 ms.
Running link step : cd /tmp/ltsmin865808301237272622;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin865808301237272622;'/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/stateBased12871455418862666131.hoa' '--buchi-type=spotba'
LTSmin run took 9855 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-01-LTLFireability-07 finished in 150867 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' '!(((p0 U X(p0))&&(G(p1)||X(p2))))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 133/133 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 156 transition count 133
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 147 transition count 124
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 147 transition count 124
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 144 transition count 121
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 144 transition count 121
Applied a total of 25 rules in 18 ms. Remains 144 /157 variables (removed 13) and now considering 121/133 (removed 12) transitions.
// Phase 1: matrix 121 rows 144 cols
[2025-05-29 18:25:11] [INFO ] Computed 28 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:25:11] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-05-29 18:25:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:25:11] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2025-05-29 18:25: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/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:25:14] [INFO ] Deduced a trap composed of 30 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:25:14] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:25:14] [INFO ] Deduced a trap composed of 28 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:25:14] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:25:14] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:25:14] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:25:14] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:25:15] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:25:15] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:25:15] [INFO ] Deduced a trap composed of 30 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:25:15] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:25:15] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:25:15] [INFO ] Deduced a trap composed of 22 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:25:15] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:25:16] [INFO ] Deduced a trap composed of 28 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:25:16] [INFO ] Deduced a trap composed of 28 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:25:16] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 17/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:25:17] [INFO ] Deduced a trap composed of 17 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:25:17] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:25:17] [INFO ] Deduced a trap composed of 31 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:25:17] [INFO ] Deduced a trap composed of 20 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:25:17] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 5/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:25:18] [INFO ] Deduced a trap composed of 14 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:25:18] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:25:18] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:25:19] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:25:19] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 121/265 variables, 144/199 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:25:21] [INFO ] Deduced a trap composed of 8 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:25:22] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:25:22] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 3/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:25:23] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:25:24] [INFO ] Deduced a trap along path composed of 8 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:25:24] [INFO ] Deduced a trap along path composed of 5 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 0/265 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 205 constraints, problems are : Problem set: 0 solved, 120 unsolved in 16519 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: 30/30 constraints, Known Traps Along Path: 3/3 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, 30/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:25:29] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:25:29] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/265 variables, 144/204 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 120/324 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:25:32] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:25:32] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 2/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:25:34] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:25:35] [INFO ] Deduced a trap composed of 8 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:25:35] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:25:35] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 4/330 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:25:37] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 3/334 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:25:47] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 1/335 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:25:57] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/265 variables, and 336 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30015 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: 39/39 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 46548ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 46550ms
Starting structural reductions in LTL mode, iteration 1 : 144/157 places, 121/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46967 ms. Remains : 144/157 places, 121/133 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p0), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-08 finished in 47305 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))'
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 133/133 transitions.
Graph (trivial) has 82 edges and 157 vertex of which 6 / 157 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 311 edges and 152 vertex of which 151 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
Ensure Unique test removed 1 places
Reduce places removed 2 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 149 transition count 105
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 129 transition count 105
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 42 place count 129 transition count 77
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 104 place count 95 transition count 77
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 113 place count 86 transition count 68
Iterating global reduction 2 with 9 rules applied. Total rules applied 122 place count 86 transition count 68
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 122 place count 86 transition count 66
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 126 place count 84 transition count 66
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 194 place count 49 transition count 33
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 196 place count 48 transition count 36
Applied a total of 196 rules in 47 ms. Remains 48 /157 variables (removed 109) and now considering 36/133 (removed 97) transitions.
// Phase 1: matrix 36 rows 48 cols
[2025-05-29 18:25:58] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:25:58] [INFO ] Implicit Places using invariants in 80 ms returned [1, 2, 8, 9, 13]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 83 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/157 places, 36/133 transitions.
Applied a total of 0 rules in 5 ms. Remains 43 /43 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 135 ms. Remains : 43/157 places, 36/133 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-09 finished in 185 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' '!(((!p0&&(p1 U X(p2))) U X((!p0 U X(p3)))))'
Support contains 8 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 133/133 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 148 transition count 124
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 148 transition count 124
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 145 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 145 transition count 121
Applied a total of 24 rules in 8 ms. Remains 145 /157 variables (removed 12) and now considering 121/133 (removed 12) transitions.
// Phase 1: matrix 121 rows 145 cols
[2025-05-29 18:25:58] [INFO ] Computed 29 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:25:59] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-05-29 18:25:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:25:59] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2025-05-29 18:25:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 18/29 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:26:01] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:01] [INFO ] Deduced a trap composed of 27 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:26:01] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:01] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:02] [INFO ] Deduced a trap composed of 14 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:26:02] [INFO ] Deduced a trap composed of 24 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:26:02] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:02] [INFO ] Deduced a trap composed of 30 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:26:02] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:02] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:02] [INFO ] Deduced a trap composed of 26 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:26:02] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:02] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:03] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:03] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 15/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:26:04] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:04] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:04] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:04] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/266 variables, 145/193 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:26:07] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:07] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:07] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 3/196 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:26:08] [INFO ] Deduced a trap composed of 9 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:26:08] [INFO ] Deduced a trap composed of 11 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:26:08] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 3/199 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:26:09] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:09] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:09] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 3/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:26:11] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/266 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:26:13] [INFO ] Deduced a trap along path composed of 4 places in 35 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:13] [INFO ] Deduced a trap along path composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 2/205 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:26:15] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (OVERLAPS) 0/266 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 206 constraints, problems are : Problem set: 0 solved, 120 unsolved in 19801 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 3/3 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/144 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 29/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:26:19] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:19] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:19] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 3/61 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:26:20] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/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:26:21] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:21] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:21] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 3/65 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:26:22] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 20 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/66 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:26:23] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 1/67 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:26:24] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 121/266 variables, 145/213 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 120/333 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:26:26] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:26] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:28] [INFO ] Deduced a trap composed of 14 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:26:28] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 11 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 4/337 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:26:29] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:29] [INFO ] Deduced a trap composed of 8 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:26:30] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 3/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:26:34] [INFO ] Deduced a trap composed of 16 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:26:35] [INFO ] Deduced a trap composed of 21 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:26:36] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 3/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:26:42] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:43] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/266 variables, 2/348 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 266/266 variables, and 348 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 49831ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 49832ms
Starting structural reductions in LTL mode, iteration 1 : 145/157 places, 121/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50158 ms. Remains : 145/157 places, 121/133 transitions.
Stuttering acceptance computed with spot in 874 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND p0 (NOT p2) (NOT p3)), (NOT p3), (NOT p3), true, (AND (NOT p2) (NOT p3)), (NOT p3), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-10
Stuttering criterion allowed to conclude after 72365 steps with 24207 reset in 139 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-10 finished in 51211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&G(p1)))||((p2 U p0)&&X(p3)))))'
Support contains 4 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 133/133 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 156 transition count 133
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 148 transition count 125
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 148 transition count 125
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 145 transition count 122
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 145 transition count 122
Applied a total of 23 rules in 9 ms. Remains 145 /157 variables (removed 12) and now considering 122/133 (removed 11) transitions.
// Phase 1: matrix 122 rows 145 cols
[2025-05-29 18:26:50] [INFO ] Computed 28 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:26:50] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-05-29 18:26:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:26:50] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2025-05-29 18:26:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:52] [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:26:53] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:53] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:53] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:53] [INFO ] Deduced a trap composed of 20 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:26:53] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:53] [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:26:53] [INFO ] Deduced a trap composed of 32 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:26:53] [INFO ] Deduced a trap composed of 9 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:26:54] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:54] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:54] [INFO ] Deduced a trap composed of 24 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:26:54] [INFO ] Deduced a trap composed of 19 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:26:54] [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:26:54] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:54] [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:26:54] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:55] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:55] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:55] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:56] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:56] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:56] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:56] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:56] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:57] [INFO ] Deduced a trap composed of 32 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:26:57] [INFO ] Deduced a trap composed of 21 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:26:57] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:57] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:57] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:57] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:57] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:58] [INFO ] Deduced a trap composed of 16 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:26:58] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:58] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:58] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:58] [INFO ] Deduced a trap composed of 27 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:26:58] [INFO ] Deduced a trap composed of 26 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:26:59] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:26:59] [INFO ] Deduced a trap composed of 14 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:26:59] [INFO ] Deduced a trap composed of 21 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:27:00] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:00] [INFO ] Deduced a trap composed of 13 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:27:00] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 122/267 variables, 145/217 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:02] [INFO ] Deduced a trap composed of 20 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:27:02] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:02] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:04] [INFO ] Deduced a trap composed of 11 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:27:05] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:07] [INFO ] Deduced a trap along path composed of 8 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:08] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:10] [INFO ] Deduced a trap composed of 17 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:27:10] [INFO ] Deduced a trap composed of 19 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:27:10] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 8 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:11] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:11] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/267 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 16 (OVERLAPS) 0/267 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 229 constraints, problems are : Problem set: 0 solved, 121 unsolved in 26370 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 55/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:17] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:18] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:18] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:18] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:19] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:20] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:21] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:21] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 22 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 122/267 variables, 145/236 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 121/357 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:23] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:26] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:27] [INFO ] Deduced a trap composed of 21 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:27:27] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:32] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 10 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/267 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:44] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/267 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/267 variables, and 364 constraints, problems are : Problem set: 0 solved, 121 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 68/68 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 56397ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 56398ms
Starting structural reductions in LTL mode, iteration 1 : 145/157 places, 122/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56845 ms. Remains : 145/157 places, 122/133 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-11
Stuttering criterion allowed to conclude after 84 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-11 finished in 57204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p0)))))'
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 133/133 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 156 transition count 133
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 147 transition count 124
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 147 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 145 transition count 122
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 145 transition count 122
Applied a total of 23 rules in 7 ms. Remains 145 /157 variables (removed 12) and now considering 122/133 (removed 11) transitions.
// Phase 1: matrix 122 rows 145 cols
[2025-05-29 18:27:47] [INFO ] Computed 28 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:27:47] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-05-29 18:27:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:27:47] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2025-05-29 18:27: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/144 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:49] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:50] [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:27:50] [INFO ] Deduced a trap composed of 29 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:27:50] [INFO ] Deduced a trap composed of 29 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:27:50] [INFO ] Deduced a trap composed of 24 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:27:50] [INFO ] Deduced a trap composed of 19 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:27:50] [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:27:50] [INFO ] Deduced a trap composed of 23 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:27:51] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:51] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:51] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:52] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/267 variables, 145/185 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:54] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:55] [INFO ] Deduced a trap composed of 8 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:27:55] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:55] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:55] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:56] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:56] [INFO ] Deduced a trap composed of 19 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:27:56] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:56] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:56] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 7/195 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:58] [INFO ] Deduced a trap along path composed of 3 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:58] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:27:58] [INFO ] Deduced a trap along path composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/267 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 198 constraints, problems are : Problem set: 0 solved, 121 unsolved in 14534 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 22/50 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/267 variables, 145/195 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 121/316 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:03] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:04] [INFO ] Deduced a trap composed of 14 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:28:04] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:04] [INFO ] Deduced a trap composed of 15 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:28:05] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 5/321 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:07] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:07] [INFO ] Deduced a trap composed of 20 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:28:07] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:08] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:10] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:12] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:14] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:15] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:15] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:16] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 4/331 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/267 variables, and 334 constraints, problems are : Problem set: 0 solved, 121 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 44562ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 44562ms
Starting structural reductions in LTL mode, iteration 1 : 145/157 places, 122/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44906 ms. Remains : 145/157 places, 122/133 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-12
Stuttering criterion allowed to conclude after 191 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-12 finished in 45037 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 133/133 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 156 transition count 133
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 146 transition count 123
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 146 transition count 123
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 143 transition count 120
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 143 transition count 120
Applied a total of 27 rules in 9 ms. Remains 143 /157 variables (removed 14) and now considering 120/133 (removed 13) transitions.
// Phase 1: matrix 120 rows 143 cols
[2025-05-29 18:28:32] [INFO ] Computed 28 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:28:32] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-05-29 18:28:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:28:32] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2025-05-29 18:28:32] [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:28:35] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:35] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:35] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:35] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:35] [INFO ] Deduced a trap composed of 9 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:28:35] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:35] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:36] [INFO ] Deduced a trap composed of 30 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:28:36] [INFO ] Deduced a trap composed of 34 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:28:36] [INFO ] Deduced a trap composed of 17 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:28:36] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:36] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:36] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:36] [INFO ] Deduced a trap composed of 27 places in 105 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:28:38] [INFO ] Deduced a trap composed of 20 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:28:38] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:38] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 12 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:28:41] [INFO ] Deduced a trap composed of 26 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:28:41] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:41] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:42] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:42] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:42] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 5 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:28:43] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:43] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:43] [INFO ] Deduced a trap composed of 16 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:28:43] [INFO ] Deduced a trap composed of 27 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:28:43] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:43] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:43] [INFO ] Deduced a trap composed of 36 places in 81 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:28:45] [INFO ] Deduced a trap along path composed of 8 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:46] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 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 17068 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:28:50] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:50] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 16 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:28:51] [INFO ] Deduced a trap composed of 10 places in 38 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:28:54] [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:28:54] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:54] [INFO ] Deduced a trap composed of 14 places in 108 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:28:55] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:28:57] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 5 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:28:59] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 8 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:29:03] [INFO ] Deduced a trap composed of 11 places in 52 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:29:06] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:29:06] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 18:29:07] [INFO ] Deduced a trap composed of 14 places in 52 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:29:15] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 7 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 30010 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 47092ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 47093ms
Starting structural reductions in LTL mode, iteration 1 : 143/157 places, 120/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47489 ms. Remains : 143/157 places, 120/133 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-13
Stuttering criterion allowed to conclude after 363 steps with 3 reset in 1 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-13 finished in 47644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 133/133 transitions.
Graph (trivial) has 82 edges and 157 vertex of which 6 / 157 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 311 edges and 152 vertex of which 151 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
Ensure Unique test removed 1 places
Reduce places removed 2 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 149 transition count 105
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 129 transition count 105
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 129 transition count 78
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 96 transition count 78
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 110 place count 88 transition count 70
Iterating global reduction 2 with 8 rules applied. Total rules applied 118 place count 88 transition count 70
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 118 place count 88 transition count 68
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 122 place count 86 transition count 68
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 190 place count 51 transition count 35
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 50 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 193 place count 49 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 194 place count 48 transition count 37
Applied a total of 194 rules in 26 ms. Remains 48 /157 variables (removed 109) and now considering 37/133 (removed 96) transitions.
// Phase 1: matrix 37 rows 48 cols
[2025-05-29 18:29:20] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 18:29:20] [INFO ] Implicit Places using invariants in 89 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 90 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/157 places, 37/133 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 119 ms. Remains : 46/157 places, 37/133 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-01-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-LTLFireability-15 finished in 177 ms.
All properties solved by simple procedures.
Total runtime 723430 ms.
BK_STOP 1748543360255
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-01"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-01, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-smll-174853813100004"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;