About the Execution of ITS-Tools for RefineWMG-PT-100100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FTFFFFFFF?FFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r170-smll-174889233800356.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 RefineWMG-PT-100100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-174889233800356
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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 5.9K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K 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 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 218K 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 RefineWMG-PT-100100-LTLFireability-00
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-01
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-02
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-03
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-04
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-05
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-06
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-07
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-08
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-09
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-10
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-11
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-12
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-13
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-14
FORMULA_NAME RefineWMG-PT-100100-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749031090649
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-100100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-04 09:58:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 09:58:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 09:58:13] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2025-06-04 09:58:13] [INFO ] Transformed 504 places.
[2025-06-04 09:58:13] [INFO ] Transformed 403 transitions.
[2025-06-04 09:58:13] [INFO ] Parsed PT model containing 504 places and 403 transitions and 1208 arcs in 451 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 3 formulas.
FORMULA RefineWMG-PT-100100-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100100-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 122 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Running 302 sub problems to find dead transitions.
// Phase 1: matrix 403 rows 504 cols
[2025-06-04 09:58:14] [INFO ] Computed 202 invariants in 24 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 2.0)
(s3 3.0)
(s4 0.0)
(s5 99.0)
(s6 1.0)
(s7 99.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 99.0)
(s12 1.0)
(s13 99.0)
(s14 0.0)
(s15 99.0)
(s16 1.0)
(s17 1.0)
(s18 99.0)
(s19 0.0)
(s20 99.0)
(s21 1.0)
(s22 99.0)
(s23 1.0)
(s24 0.0)
(s25 99.0)
(s26 1.0)
(s27 99.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 99.0)
(s32 1.0)
(s33 99.0)
(s34 0.0)
(s35 1.0)
(s36 99.0)
(s37 1.0)
(s38 99.0)
(s39 0.0)
(s40 1.0)
(s41 99.0)
(s42 99.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 99.0)
(s47 99.0)
(s48 1.0)
(s49 0.0)
(s50 99.0)
(s51 1.0)
(s52 1.0)
(s53 99.0)
(s54 0.0)
(s55 1.0)
(s56 99.0)
(s57 99.0)
(s58 1.0)
(s59 0.0)
(s60 99.0)
(s61 1.0)
(s62 1.0)
(s63 99.0)
(s64 0.0)
(s65 99.0)
(s66 1.0)
(s67 1.0)
(s68 99.0)
(s69 0.0)
(s70 99.0)
(s71 1.0)
(s72 1.0)
(s73 99.0)
(s74 0.0)
(s75 99.0)
(s76 1.0)
(s77 1.0)
(s78 99.0)
(s79 1.0)
(s80 1.0)
(s81 99.0)
(s82 99.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 99.0)
(s87 99.0)
(s88 1.0)
(s89 0.0)
(s90 99.0)
(s91 1.0)
(s92 99.0)
(s93 1.0)
(s94 1.0)
(s95 99.0)
(s96 1.0)
(s97 99.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 99.0)
(s102 99.0)
(s103 1.0)
(s104 0.0)
(s105 99.0)
(s106 1.0)
(s107 99.0)
(s108 1.0)
(s109 0.0)
(s110 99.0)
(s111 1.0)
(s112 99.0)
(s113 1.0)
(s114 0.0)
(s115 99.0)
(s116 1.0)
(s117 1.0)
(s118 99.0)
(s119 1.0)
(s120 99.0)
(s121 1.0)
(s122 1.0)
(s123 99.0)
(s124 0.0)
(s125 99.0)
(s126 1.0)
(s127 99.0)
(s128 1.0)
(s129 0.0)
(s130 99.0)
(s131 1.0)
(s132 99.0)
(s133 1.0)
(s134 1.0)
(s135 99.0)
(s136 1.0)
(s137 1.0)
(s138 99.0)
(s139 0.0)
(s140 1.0)
(s141 99.0)
(s142 99.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 99.0)
(s147 99.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 99.0)
(s152 1.0)
(s153 99.0)
(s154 1.0)
(s155 99.0)
(s156 1.0)
(s157 1.0)
(s158 99.0)
(s159 0.0)
(s160 99.0)
(s161 1.0)
(s162 99.0)
(s163 1.0)
(s164 0.0)
(s165 99.0)
(s166 1.0)
(s167 1.0)
(s168 99.0)
(s169 0.0)
(s170 1.0)
(s171 99.0)
(s172 99.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 99.0)
(s177 99.0)
(s178 1.0)
(s179 0.0)
(s180 99.0)
(s181 1.0)
(s182 1.0)
(s183 99.0)
(s184 0.0)
(s185 99.0)
(s186 1.0)
(s187 1.0)
(s188 99.0)
(s189 0.0)
(s190 99.0)
(s191 1.0)
(s192 99.0)
(s193 1.0)
(s194 0.0)
(s195 99.0)
(s196 1.0)
(s197 99.0)
(s198 1.0)
(s199 0.0)
(s200 99.0)
(s201 1.0)
(s202 99.0)
(s203 1.0)
(s204 0.0)
(s205 99.0)
(s206 1.0)
(s207 99.0)
(s208 1.0)
(s209 0.0)
(s210 99.0)
(s211 1.0)
(s212 1.0)
(s213 99.0)
(s214 0.0)
(s215 1.0)
(s216 99.0)
(s217 99.0)
(s218 1.0)
(s219 0.0)
(s220 1.0)
(s221 99.0)
(s222 1.0)
(s223 99.0)
(s224 0.0)
(s225 1.0)
(s226 99.0)
(s227 1.0)
(s228 99.0)
(s229 0.0)
(s230 1.0)
(s231 99.0)
(s232 1.0)
(s233 99.0)
(s234 0.0)
(s235 99.0)
(s236 1.0)
(s237 1.0)
(s238 99.0)
(s239 0.0)
(s240 99.0)
(s241 1.0)
(s242 99.0)
(s243 1.0)
(s244 0.0)
(s245 99.0)
(s246 1.0)
(s247 99.0)
(s248 1.0)
(s249 0.0)
(s250 1.0)
(s251 99.0)
(s252 99.0)
(s253 1.0)
(s254 0.0)
(s255 1.0)
(s256 99.0)
(s257 1.0)
(s258 99.0)
(s259 0.0)
(s260 99.0)
(s261 1.0)
(s262 1.0)
(s263 99.0)
(s264 0.0)
(s265 1.0)
(s266 99.0)
(s267 1.0)
(s268 99.0)
(s269 0.0)
(s270 99.0)
(s271 1.0)
(s272 1.0)
(s273 99.0)
(s274 0.0)
(s275 99.0)
(s276 1.0)
(s277 1.0)
(s278 99.0)
(s279 0.0)
(s280 1.0)
(s281 99.0)
(s282 99.0)
(s283 1.0)
(s284 0.0)
(s285 1.0)
(s286 99.0)
(s287 99.0)
(s288 1.0)
(s289 0.0)
(s290 1.0)
(s291 99.0)
(s292 1.0)
(s293 99.0)
(s294 0.0)
(s295 99.0)
(s296 1.0)
(s297 99.0)
(s298 1.0)
(s299 0.0)
(s300 1.0)
(s301 99.0)
(s302 99.0)
(s303 1.0)
(s304 0.0)
(s305 99.0)
(s306 1.0)
(s307 99.0)
(s308 1.0)
(s309 0.0)
(s310 1.0)
(s311 99.0)
(s312 1.0)
(s313 99.0)
(s314 0.0)
(s315 1.0)
(s316 99.0)
(s317 99.0)
(s318 1.0)
(s319 0.0)
(s320 99.0)
(s321 1.0)
(s322 1.0)
(s323 99.0)
(s324 0.0)
(s325 99.0)
(s326 1.0)
(s327 1.0)
(s328 99.0)
(s329 0.0)
(s330 1.0)
(s331 99.0)
(s332 1.0)
(s333 99.0)
(s334 0.0)
(s335 1.0)
(s336 99.0)
(s337 1.0)
(s338 99.0)
(s339 0.0)
(s340 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/907 variables, and 202 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20103 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
(s5 99timeout
^^^^^^^^^
(error "Invalid token: 99timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 2)
(s3 3)
(s4 0)
(s5 99timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/907 variables, and 202 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 0/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40380ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 40439ms
[2025-06-04 09:58:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 09:58:55] [INFO ] Implicit Places using invariants in 693 ms returned []
[2025-06-04 09:58:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 09:58:56] [INFO ] Implicit Places using invariants and state equation in 995 ms returned []
Implicit Place search using SMT with State Equation took 1698 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2025-06-04 09:58:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
SMT process timed out in 30087ms, After SMT, problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 30092ms
Finished structural reductions in LTL mode , in 1 iterations and 72457 ms. Remains : 504/504 places, 403/403 transitions.
Support contains 39 out of 504 places after structural reductions.
[2025-06-04 09:59:26] [INFO ] Flatten gal took : 143 ms
[2025-06-04 09:59:26] [INFO ] Flatten gal took : 69 ms
[2025-06-04 09:59:27] [INFO ] Input system was already deterministic with 403 transitions.
Support contains 37 out of 504 places (down from 39) after GAL structural reductions.
RANDOM walk for 40042 steps (8 resets) in 803 ms. (49 steps per ms) remains 13/29 properties
BEST_FIRST walk for 40004 steps (8 resets) in 642 ms. (62 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 514 ms. (77 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 442 ms. (90 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 563 ms. (70 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 464 ms. (86 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 373 ms. (106 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 359 ms. (111 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 394 ms. (101 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 354 ms. (112 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 12/12 properties
[2025-06-04 09:59:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 114/136 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 125/261 variables, 136/154 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 646/907 variables, 368/522 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/907 variables, 184/706 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/907 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/907 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 907/907 variables, and 706 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2588 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 114/136 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 125/261 variables, 136/154 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 646/907 variables, 368/522 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/907 variables, 184/706 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/907 variables, 12/718 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/907 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/907 variables, and 718 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7620ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 277 edges and 504 vertex of which 188 / 504 are part of one of the 94 SCC in 10 ms
Free SCC test removed 94 places
Drop transitions (Empty/Sink Transition effects.) removed 188 transitions
Reduce isomorphic transitions removed 188 transitions.
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 316 transition count 215
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 1 with 267 rules applied. Total rules applied 362 place count 138 transition count 126
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 1 with 74 rules applied. Total rules applied 436 place count 138 transition count 52
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 2 with 74 rules applied. Total rules applied 510 place count 64 transition count 52
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 510 place count 64 transition count 42
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 530 place count 54 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 532 place count 53 transition count 41
Applied a total of 532 rules in 100 ms. Remains 53 /504 variables (removed 451) and now considering 41/403 (removed 362) transitions.
Running 34 sub problems to find dead transitions.
// Phase 1: matrix 41 rows 53 cols
[2025-06-04 09:59:36] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 2/53 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 41/94 variables, 53/72 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 0/94 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 72 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1380 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 2/53 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 41/94 variables, 53/72 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 34/106 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/94 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 106 constraints, problems are : Problem set: 0 solved, 34 unsolved in 2336 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3742ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 3743ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3852 ms. Remains : 53/504 places, 41/403 transitions.
RANDOM walk for 40181 steps (8 resets) in 129 ms. (309 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/7 properties
BEST_FIRST walk for 39250 steps (8 resets) in 95 ms. (408 steps per ms) remains 0/1 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||X(X((X(p2)||p1)))))'
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 19 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Running 302 sub problems to find dead transitions.
// Phase 1: matrix 403 rows 504 cols
[2025-06-04 09:59:41] [INFO ] Computed 202 invariants in 6 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/907 variables, and 202 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
SMT process timed out in 40105ms, After SMT, problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 40109ms
[2025-06-04 10:00:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:00:21] [INFO ] Implicit Places using invariants in 601 ms returned []
[2025-06-04 10:00:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:00:22] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1463 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2025-06-04 10:00:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 907/907 variables, and 706 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/907 variables, 302/1008 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/907 variables, and 1008 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Finished structural reductions in LTL mode , in 1 iterations and 101668 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 702 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 1755 ms.
Product exploration explored 100000 steps with 25000 reset in 1368 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 124 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
RANDOM walk for 40041 steps (8 resets) in 391 ms. (102 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 508 ms. (78 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 569 ms. (70 steps per ms) remains 2/2 properties
[2025-06-04 10:01:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 105/110 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 109/219 variables, 110/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 688/907 variables, 394/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/907 variables, 197/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/907 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/907 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 907/907 variables, and 706 constraints, problems are : Problem set: 0 solved, 2 unsolved in 613 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 105/110 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 109/219 variables, 110/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 688/907 variables, 394/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/907 variables, 197/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/907 variables, 2/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/907 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/907 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 907/907 variables, and 708 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1385 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2011ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 11755 steps, including 0 resets, run visited all 2 properties in 257 ms. (steps per millisecond=45 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 276 ms.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p0), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F p1), (F (NOT p2)), (F (NOT (OR p1 (NOT p0) p2))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 8 factoid took 449 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 294 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 37 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Running 302 sub problems to find dead transitions.
[2025-06-04 10:01:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/907 variables, and 202 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/907 variables, and 1008 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40107ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 40111ms
[2025-06-04 10:02:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:02:11] [INFO ] Implicit Places using invariants in 487 ms returned []
[2025-06-04 10:02:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:02:12] [INFO ] Implicit Places using invariants and state equation in 991 ms returned []
Implicit Place search using SMT with State Equation took 1480 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2025-06-04 10:02:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
SMT process timed out in 30056ms, After SMT, problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 30059ms
Finished structural reductions in LTL mode , in 1 iterations and 71691 ms. Remains : 504/504 places, 403/403 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40031 steps (8 resets) in 360 ms. (110 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 472 ms. (84 steps per ms) remains 1/1 properties
[2025-06-04 10:02:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 103/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 105/211 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 696/907 variables, 398/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/907 variables, 199/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/907 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/907 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 907/907 variables, and 706 constraints, problems are : Problem set: 0 solved, 1 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 103/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 105/211 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 696/907 variables, 398/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/907 variables, 199/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/907 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/907 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/907 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 907/907 variables, and 707 constraints, problems are : Problem set: 0 solved, 1 unsolved in 845 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1536ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 424 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=47 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2)]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 1 factoid took 297 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 292 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 289 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 25000 reset in 1283 ms.
Product exploration explored 100000 steps with 25000 reset in 1200 ms.
Applying partial POR strategy [true, true, false, false, true, false]
Stuttering acceptance computed with spot in 249 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 293 edges and 504 vertex of which 194 / 504 are part of one of the 97 SCC in 2 ms
Free SCC test removed 97 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 310 transition count 210
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 99 places in 0 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 196 place count 310 transition count 210
Deduced a syphon composed of 99 places in 1 ms
Applied a total of 196 rules in 107 ms. Remains 310 /504 variables (removed 194) and now considering 210/403 (removed 193) transitions.
Running 205 sub problems to find dead transitions.
// Phase 1: matrix 210 rows 310 cols
[2025-06-04 10:02:49] [INFO ] Computed 105 invariants in 7 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 2/310 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 205 unsolved
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 TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 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 TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
At refinement iteration 4 (OVERLAPS) 209/519 variables, 310/415 constraints. Problems are: Problem set: 99 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/415 constraints. Problems are: Problem set: 99 solved, 106 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 519/520 variables, and 415 constraints, problems are : Problem set: 99 solved, 106 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 105/105 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 99 solved, 106 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 4/4 constraints. Problems are: Problem set: 99 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/209 variables, 0/4 constraints. Problems are: Problem set: 99 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 101/310 variables, 101/105 constraints. Problems are: Problem set: 99 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/105 constraints. Problems are: Problem set: 99 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 209/519 variables, 310/415 constraints. Problems are: Problem set: 99 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 106/521 constraints. Problems are: Problem set: 99 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/521 constraints. Problems are: Problem set: 99 solved, 106 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/520 variables, and 521 constraints, problems are : Problem set: 99 solved, 106 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 105/105 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 106/205 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40066ms problems are : Problem set: 99 solved, 106 unsolved
Search for dead transitions found 99 dead transitions in 40069ms
Found 99 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 99 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 99 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 10:03:29] [INFO ] Redundant transitions in 27 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 310/504 places, 111/403 transitions.
Graph (complete) has 425 edges and 310 vertex of which 211 are kept as prefixes of interest. Removing 99 places using SCC suffix rule.3 ms
Discarding 99 places :
Also discarding 0 output transitions
Reduce places removed 99 places and 0 transitions.
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 112 transition count 111
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 95 place count 112 transition count 111
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 112 transition count 111
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 190 place count 19 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 93 rules applied. Total rules applied 283 place count 19 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 284 place count 19 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 285 place count 18 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 286 place count 18 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 286 rules in 30 ms. Remains 18 /310 variables (removed 292) and now considering 17/111 (removed 94) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/504 places, 17/403 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40245 ms. Remains : 18/504 places, 17/403 transitions.
Built C files in :
/tmp/ltsmin8312804829385711948
[2025-06-04 10:03:29] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8312804829385711948
Running compilation step : cd /tmp/ltsmin8312804829385711948;'/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 1649 ms.
Running link step : cd /tmp/ltsmin8312804829385711948;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin8312804829385711948;'/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/stateBased15138984235977775099.hoa' '--buchi-type=spotba'
LTSmin run took 5121 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RefineWMG-PT-100100-LTLFireability-01 finished in 235203 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&&(p1 U p2)))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 295 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 1 with 297 rules applied. Total rules applied 395 place count 110 transition count 109
Drop transitions (Trivial Post-Agglo cleanup.) removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 1 with 93 rules applied. Total rules applied 488 place count 110 transition count 16
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 2 with 93 rules applied. Total rules applied 581 place count 17 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 581 place count 17 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 587 place count 14 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 589 place count 13 transition count 12
Applied a total of 589 rules in 22 ms. Remains 13 /504 variables (removed 491) and now considering 12/403 (removed 391) transitions.
Running 8 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 13 cols
[2025-06-04 10:03:36] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/13 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 11/24 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/25 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/13 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 11/24 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/25 variables, and 26 constraints, problems are : Problem set: 0 solved, 8 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 275ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 275ms
[2025-06-04 10:03:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:03:36] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-04 10:03:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:03:36] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 10:03:36] [INFO ] Redundant transitions in 21 ms returned []
Running 8 sub problems to find dead transitions.
[2025-06-04 10:03:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/13 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 11/24 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/25 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/13 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 11/24 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/25 variables, and 26 constraints, problems are : Problem set: 0 solved, 8 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 410ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 410ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/504 places, 12/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 814 ms. Remains : 13/504 places, 12/403 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-02 finished in 950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0&&F(p1)) U G(p2)))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 20 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Running 302 sub problems to find dead transitions.
// Phase 1: matrix 403 rows 504 cols
[2025-06-04 10:03:37] [INFO ] Computed 202 invariants in 4 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/907 variables, and 202 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
SMT process timed out in 40091ms, After SMT, problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 40093ms
[2025-06-04 10:04:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:04:17] [INFO ] Implicit Places using invariants in 585 ms returned []
[2025-06-04 10:04:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:04:18] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1489 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2025-06-04 10:04: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/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 5.0)
(s4 5.0)
(s5 5.0)
(s6 95.0)
(s7 99.0)
(s8 1.0)
(s9 1.0)
(s10 6.0)
(s11 94.0)
(s12 1.0)
(s13 99.0)
(s14 0.0)
(s15 6.0)
(s16 94.0)
(s17 99.0)
(s18 1.0)
(s19 0.0)
(s20 6.0)
(s21 94.0)
(s22 99.0)
(s23 1.0)
(s24 0.0)
(s25 6.0)
(s26 94.0)
(s27 99.0)
(s28 1.0)
(s29 0.0)
(s30 6.0)
(s31 94.0)
(s32 99.0)
(s33 1.0)
(s34 0.0)
(s35 6.0)
(s36 94.0)
(s37 99.0)
(s38 1.0)
(s39 1.0)
(s40 7.0)
(s41 93.0)
(s42 99.0)
(s43 1.0)
(s44 0.0)
(s45 7.0)
(s46 93.0)
(s47 99.0)
(s48 1.0)
(s49 0.0)
(s50 7.0)
(s51 93.0)
(s52 1.0)
(s53 99.0)
(s54 0.0)
(s55 7.0)
(s56 93.0)
(s57 99.0)
(s58 1.0)
(s59 0.0)
(s60 7.0)
(s61 93.0)
(s62 99.0)
(s63 1.0)
(s64 0.0)
(s65 7.0)
(s66 93.0)
(s67 1.0)
(s68 99.0)
(s69 0.0)
(s70 7.0)
(s71 93.0)
(s72 99.0)
(s73 1.0)
(s74 0.0)
(s75 7.0)
(s76 93.0)
(s77 99.0)
(s78 1.0)
(s79 0.0)
(s80 7.0)
(s81 93.0)
(s82 1.0)
(s83 99.0)
(s84 0.0)
(s85 7.0)
(s86 93.0)
(s87 1.0)
(s88 99.0)
(s89 0.0)
(s90 7.0)
(s91 93.0)
(s92 99.0)
(s93 1.0)
(s94 0.0)
(s95 7.0)
(s96 93.0)
(s97 99.0)
(s98 1.0)
(s99 0.0)
(s100 7.0)
(s101 93.0)
(s102 1.0)
(s103 99.0)
(s104 0.0)
(s105 7.0)
(s106 93.0)
(s107 99.0)
(s108 1.0)
(s109 0.0)
(s110 7.0)
(s111 93.0)
(s112 1.0)
(s113 99.0)
(s114 0.0)
(s115 7.0)
(s116 93.0)
(s117 1.0)
(s118 99.0)
(s119 0.0)
(s120 7.0)
(s121 93.0)
(s122 1.0)
(s123 99.0)
(s124 0.0)
(s125 7.0)
(s126 93.0)
(s127 1.0)
(s128 99.0)
(s129 0.0)
(s130 7.0)
(s131 93.0)
(s132 1.0)
(s133 99.0)
(s134 0.0)
(s135 7.0)
(s136 93.0)
(s137 1.0)
(s138 99.0)
(s139 0.0)
(s140 7.0)
(s141 93.0)
(s142 99.0)
(s143 1.0)
(s144 0.0)
(s145 7.0)
(s146 93.0)
(s147 1.0)
(s148 99.0)
(s149 0.0)
(s150 7.0)
(s151 93.0)
(s152 99.0)
(s153 1.0)
(s154 0.0)
(s155 7.0)
(s156 93.0)
(s157 1.0)
(s158 99.0)
(s159 0.0)
(s160 7.0)
(s161 93.0)
(s162 99.0)
(s163 1.0)
(s164 0.0)
(s165 7.0)
(s166 93.0)
(s167 99.0)
(s168 1.0)
(s169 0.0)
(s170 7.0)
(s171 93.0)
(s172 1.0)
(s173 99.0)
(s174 0.0)
(s175 7.0)
(s176 93.0)
(s177 99.0)
(s178 1.0)
(s179 0.0)
(s180 7.0)
(s181 93.0)
(s182 1.0)
(s183 99.0)
(s184 0.0)
(s185 7.0)
(s186 93.0)
(s187 99.0)
(s188 1.0)
(s189 0.0)
(s190 7.0)
(s191 93.0)
(s192 99.0)
(s193 1.0)
(s194 0.0)
(s195 7.0)
(s196 93.0)
(s197 1.0)
(s198 99.0)
(s199 0.0)
(s200 7.0)
(s201 93.0)
(s202 99.0)
(s203 1.0)
(s204 0.0)
(s205 7.0)
(s206 93.0)
(s207 99.0)
(s208 1.0)
(s209 0.0)
(s210 7.0)
(s211 93.0)
(s212 1.0)
(s213 99.0)
(s214 0.0)
(s215 7.0)
(s216 93.0)
(s217 1.0)
(s218 99.0)
(s219 0.0)
(s220 7.0)
(s221 93.0)
(s222 1.0)
(s223 99.0)
(s224 0.0)
(s225 7.0)
(s226 93.0)
(s227 1.0)
(s228 99.0)
(s229 0.0)
(s230 7.0)
(s231 93.0)
(s232 99.0)
(s233 1.0)
(s234 0.0)
(s235 7.0)
(s236 93.0)
(s237 99.0)
(s238 1.0)
(s239 0.0)
(s240 7.0)
(s241 93.0)
(s242 1.0)
(s243 99.0)
(s244 0.0)
(s245 7.0)
(s246 93.0)
(s247 1.0)
(s248 99.0)
(s249 0.0)
(s250 7.0)
(s251 93.0)
(s252 99.0)
(s253 1.0)
(s254 0.0)
(s255 7.0)
(s256 93.0)
(s257 1.0)
(s258 99.0)
(s259 0.0)
(s260 7.0)
(s261 93.0)
(s262 99.0)
(s263 1.0)
(s264 0.0)
(s265 7.0)
(s266 93.0)
(s267 1.0)
(s268 99.0)
(s269 0.0)
(s270 7.0)
(s271 93.0)
(s272 1.0)
(s273 99.0)
(s274 0.0)
(s275 7.0)
(s276 93.0)
(s277 99.0)
(s278 1.0)
(s279 0.0)
(s280 7.0)
(s281 93.0)
(s282 99.0)
(s283 1.0)
(s284 0.0)
(s285 7.0)
(s286 93.0)
(s287 99.0)
(s288 1.0)
(s289 0.0)
(s290 7.0)
(s291 93.0)
(s292 99.0)
(s293 1.0)
(s294 0.0)
(s295 7.0)
(s296 93.0)
(s297 99.0)
(s298 1.0)
(s299 0.0)
(s300 7.0)
(s301 93.0)
(s302 1.0)
(s303 99.0)
(s304 0.0)
(s305 7.0)
(s306 93.0)
(s307 1.0)
(s308 99.0)
(s309 0.0)
(s310 7.0)
(s311 93.0)
(s312 1.0)
(s313 99.0)
(s314 0.0)
(s315 7.0)
(s316 93.0)
(s317 99.0)
(s318 1.0)
(s319 0.0)
(s320 7.0)
(s321 93.0)
(s322 1.0)
(s323 99.0)
(s324 0.0)
(s325 7.0)
(s326 93.0)
(s327 1.0)
(s328 99.0)
(s329 0.0)
(s330 7.0)
(s331 93.0)
(s332 1.0)
(s333 99.0)
(s334 0.0)
(s335 7.0)
(s336 93.0)
(s337 1.0)
(s338 99.0)
(s339 0.0)
(s340 7.0)
(s341 93.0)
(s342 1.0)
(s343 99.0)
(s344 0.0)
(s345 7.0)
(s346 93.0)
(s347 1.0)
(s348 99.0)
(s349 0.0)
(s350 7.0)
(s351 93.0)
(s352 99.0)
(s353 1.0)
(s354 0.0)
(s355 7.0)
(s356 93.0)
(s357 1.0)
(s358 99.0)
(s359 0.0)
(s360 7.0)
(s361 93.0)
(s362 99.0)
(s363 1.0)
(s364 0.0)
(s365 7.0)
(s366 93.0)
(s367 99.0)
(s368 1.0)
(s369 0.0)
(s370 7.0)
(s371 93.0)
(s372 99.0)
(s373 1.0)
(s374 0.0)
(s375 7.0)
(s376 93.0)
(s377 99.0)
(s378 1.0)
(s379 0.0)
(s380 7.0)
(s381 93.0)
(s382 1.0)
(s383 99.0)
(s384 0.0)
(s385 7.0)
(s386 93.0)
(s387 99.0)
(s388 1.0)
(s389 0.0)
(s390 7.0)
(s391 93.0)
(s392 99.0)
(s393 1.0)
(s394 0.0)
(s395 7.0)
(s396 93.0)
(s397 99.0)
(s398 1.0)
(s399 0.0)
(s400 7.0)
(s401 93.0)
(s402 1.0)
(s403 99.0)
(s404 0.0)
(s405 7.0)
(s406 93.0)
(s407 1.0)
(s408 99.0)
(s409 0.0)
(s410 7.0)
(s411 93.0)
(s412 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 907/907 variables, and 706 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/907 variables, 302/1008 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/907 variables, and 1008 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Finished structural reductions in LTL mode , in 1 iterations and 101687 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-03 finished in 101930 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(F(p0))&&(p0||(p1 U p2)))))'
Support contains 1 out of 504 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 296 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 1 with 294 rules applied. Total rules applied 393 place count 110 transition count 108
Drop transitions (Trivial Post-Agglo cleanup.) removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 1 with 93 rules applied. Total rules applied 486 place count 110 transition count 15
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 2 with 93 rules applied. Total rules applied 579 place count 17 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 579 place count 17 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 585 place count 14 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 587 place count 13 transition count 11
Applied a total of 587 rules in 20 ms. Remains 13 /504 variables (removed 491) and now considering 11/403 (removed 392) transitions.
Running 8 sub problems to find dead transitions.
// Phase 1: matrix 11 rows 13 cols
[2025-06-04 10:05:19] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/13 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 10/23 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/24 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/13 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 10/23 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/24 variables, and 26 constraints, problems are : Problem set: 0 solved, 8 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 320ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 320ms
[2025-06-04 10:05:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:05:19] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-04 10:05:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:05:19] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 10:05:19] [INFO ] Redundant transitions in 12 ms returned []
Running 8 sub problems to find dead transitions.
[2025-06-04 10:05:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/13 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 10/23 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/24 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/13 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 10/23 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/24 variables, and 26 constraints, problems are : Problem set: 0 solved, 8 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 264ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 264ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/504 places, 11/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 701 ms. Remains : 13/504 places, 11/403 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-04 finished in 782 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)&&X(!p1))) U (p0&&(p2 U p3))))'
Support contains 8 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 8 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Running 302 sub problems to find dead transitions.
// Phase 1: matrix 403 rows 504 cols
[2025-06-04 10:05:19] [INFO ] Computed 202 invariants in 2 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/907 variables, and 202 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/907 variables, and 706 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 0/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40060ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 40062ms
[2025-06-04 10:06:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:06:00] [INFO ] Implicit Places using invariants in 565 ms returned []
[2025-06-04 10:06:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:06:01] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1475 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2025-06-04 10:06:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 907/907 variables, and 706 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/907 variables, 302/1008 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/907 variables, and 1008 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Finished structural reductions in LTL mode , in 1 iterations and 101618 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 378 ms :[(OR (NOT p3) (NOT p0)), (OR (NOT p0) p1), (NOT p3), true, (AND p0 p1), (NOT p0), (NOT p3), (AND p0 p1 (NOT p3))]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 2458 ms.
Product exploration explored 100000 steps with 0 reset in 2675 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT p3)), (X (OR (NOT p0) (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X p0), (X (AND p0 (NOT p3) (NOT p2))), (X (NOT (AND p0 (NOT p3) p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (OR (NOT p0) (AND (NOT p3) (NOT p2))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 141 ms. Reduced automaton from 8 states, 21 edges and 4 AP (stutter sensitive) to 8 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) p1), (NOT p3), true, (AND p0 p1), (NOT p0), (NOT p3), (AND p0 p1 (NOT p3))]
RANDOM walk for 40030 steps (8 resets) in 519 ms. (76 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 473 ms. (84 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 360 ms. (110 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 331 ms. (120 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 637 ms. (62 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 447 ms. (89 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 11/11 properties
[2025-06-04 10:07:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 106/114 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 111/225 variables, 114/121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 682/907 variables, 390/511 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/907 variables, 195/706 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/907 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/907 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 907/907 variables, and 706 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1256 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 106/114 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 111/225 variables, 114/121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 682/907 variables, 390/511 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/907 variables, 195/706 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/907 variables, 11/717 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/907 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/907 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 907/907 variables, and 717 constraints, problems are : Problem set: 0 solved, 11 unsolved in 3924 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5194ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Finished Parikh walk after 719725 steps, including 60 resets, run visited all 11 properties in 7439 ms. (steps per millisecond=96 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 11 properties in 7444 ms.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT p3)), (X (OR (NOT p0) (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X p0), (X (AND p0 (NOT p3) (NOT p2))), (X (NOT (AND p0 (NOT p3) p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p3) p2 p1)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (OR (NOT p0) (AND (NOT p3) (NOT p2))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p2) (NOT p3)) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR p2 p3 p0))), (F (NOT (OR (NOT p2) p3 (NOT p0)))), (F (NOT (OR p2 p3 (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p3) p0))), (F (NOT (OR (NOT p2) p3 (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) p3))), (F p3), (F (NOT (OR (NOT p2) p3 p0))), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p2 p3 p0)))
Knowledge based reduction with 23 factoid took 404 ms. Reduced automaton from 8 states, 21 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-100100-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-100100-LTLFireability-06 finished in 122151 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 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 298 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 399 place count 106 transition count 106
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 1 with 97 rules applied. Total rules applied 496 place count 106 transition count 9
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 2 with 97 rules applied. Total rules applied 593 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 593 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 595 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 597 place count 7 transition count 7
Applied a total of 597 rules in 15 ms. Remains 7 /504 variables (removed 497) and now considering 7/403 (removed 396) transitions.
Running 4 sub problems to find dead transitions.
// Phase 1: matrix 7 rows 7 cols
[2025-06-04 10:07:22] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 14 constraints, problems are : Problem set: 0 solved, 4 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 288ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 288ms
[2025-06-04 10:07:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:07:22] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-04 10:07:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:07:22] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 10:07:22] [INFO ] Redundant transitions in 18 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-04 10:07:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 14 constraints, problems are : Problem set: 0 solved, 4 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 264ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 264ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/504 places, 7/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 674 ms. Remains : 7/504 places, 7/403 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-07 finished in 738 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 1 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 298 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 399 place count 106 transition count 106
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 1 with 97 rules applied. Total rules applied 496 place count 106 transition count 9
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 2 with 97 rules applied. Total rules applied 593 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 593 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 595 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 597 place count 7 transition count 7
Applied a total of 597 rules in 41 ms. Remains 7 /504 variables (removed 497) and now considering 7/403 (removed 396) transitions.
Running 4 sub problems to find dead transitions.
[2025-06-04 10:07:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 14 constraints, problems are : Problem set: 0 solved, 4 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 259ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 259ms
[2025-06-04 10:07:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:07:23] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-04 10:07:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:07:23] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 10:07:23] [INFO ] Redundant transitions in 13 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-04 10:07:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 14 constraints, problems are : Problem set: 0 solved, 4 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 200ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 201ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/504 places, 7/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 577 ms. Remains : 7/504 places, 7/403 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-08 finished in 640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(X(X(p0))) U G(p1))||G(p2))))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 8 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Running 302 sub problems to find dead transitions.
// Phase 1: matrix 403 rows 504 cols
[2025-06-04 10:07:23] [INFO ] Computed 202 invariants in 4 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/907 variables, and 202 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
SMT process timed out in 40059ms, After SMT, problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 40060ms
[2025-06-04 10:08:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:08:04] [INFO ] Implicit Places using invariants in 596 ms returned []
[2025-06-04 10:08:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:08:04] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 1337 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2025-06-04 10:08:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 907/907 variables, and 706 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/907 variables, 302/1008 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/907 variables, and 1008 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Finished structural reductions in LTL mode , in 1 iterations and 101480 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 833 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 2409 ms.
Product exploration explored 100000 steps with 0 reset in 2505 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X p1), (X (NOT p1)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 7 factoid took 611 ms. Reduced automaton from 19 states, 47 edges and 3 AP (stutter sensitive) to 19 states, 47 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 973 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Reduction of identical properties reduced properties to check from 21 to 13
RANDOM walk for 40044 steps (8 resets) in 401 ms. (99 steps per ms) remains 6/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 441 ms. (90 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 471 ms. (84 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 374 ms. (106 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 4/4 properties
[2025-06-04 10:09:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
Problem apf6 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 2/907 variables, and 0 constraints, problems are : Problem set: 4 solved, 0 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 0/202 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (OR (NOT p1) (NOT p2) p0)), (G (OR p1 p2 (NOT p0))), (G (OR p1 (NOT p0))), (G (OR p1 (NOT p2) (NOT p0))), (G (OR (NOT p1) p2 (NOT p0)))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X p1), (X (NOT p1)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT (AND p2 (NOT p0)))), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p0), (F (NOT (OR p1 p2 p0))), (F (NOT (AND (NOT p1) p2 (NOT p0)))), (F (NOT (OR p1 p2))), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1)]
Knowledge based reduction with 12 factoid took 2463 ms. Reduced automaton from 19 states, 47 edges and 3 AP (stutter sensitive) to 17 states, 38 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 844 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 843 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 15 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Running 302 sub problems to find dead transitions.
[2025-06-04 10:09:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/907 variables, and 202 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/907 variables, and 1008 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40086ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 40088ms
[2025-06-04 10:09:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:09:57] [INFO ] Implicit Places using invariants in 574 ms returned []
[2025-06-04 10:09:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:09:58] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1467 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2025-06-04 10:09:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 907/907 variables, and 706 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/907 variables, 302/1008 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/907 variables, and 1008 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Finished structural reductions in LTL mode , in 1 iterations and 101631 ms. Remains : 504/504 places, 403/403 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 623 ms. Reduced automaton from 17 states, 38 edges and 2 AP (stutter sensitive) to 17 states, 38 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 834 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p2)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 39221 steps (8 resets) in 326 ms. (119 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p1) p2))), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 1046 ms. Reduced automaton from 17 states, 38 edges and 2 AP (stutter sensitive) to 17 states, 38 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 823 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 819 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 823 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 2450 ms.
Product exploration explored 100000 steps with 0 reset in 2688 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, false, true, true, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 683 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 296 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 198 place count 308 transition count 208
Deduced a syphon composed of 100 places in 0 ms
Applied a total of 198 rules in 37 ms. Remains 308 /504 variables (removed 196) and now considering 208/403 (removed 195) transitions.
Running 204 sub problems to find dead transitions.
// Phase 1: matrix 208 rows 308 cols
[2025-06-04 10:11:10] [INFO ] Computed 104 invariants in 3 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 2/308 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 204 unsolved
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 TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 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 TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
At refinement iteration 4 (OVERLAPS) 207/515 variables, 308/412 constraints. Problems are: Problem set: 100 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 0/412 constraints. Problems are: Problem set: 100 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 0/515 variables, 0/412 constraints. Problems are: Problem set: 100 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 515/516 variables, and 412 constraints, problems are : Problem set: 100 solved, 104 unsolved in 20011 ms.
Refiners :[Positive P Invariants (semi-flows): 104/104 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 100 solved, 104 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 2/2 constraints. Problems are: Problem set: 100 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 0/2 constraints. Problems are: Problem set: 100 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 102/308 variables, 102/104 constraints. Problems are: Problem set: 100 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/104 constraints. Problems are: Problem set: 100 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 207/515 variables, 308/412 constraints. Problems are: Problem set: 100 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 104/516 constraints. Problems are: Problem set: 100 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/516 constraints. Problems are: Problem set: 100 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/515 variables, 0/516 constraints. Problems are: Problem set: 100 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 515/516 variables, and 516 constraints, problems are : Problem set: 100 solved, 104 unsolved in 20009 ms.
Refiners :[Positive P Invariants (semi-flows): 104/104 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 104/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40038ms problems are : Problem set: 100 solved, 104 unsolved
Search for dead transitions found 100 dead transitions in 40039ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 100 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 10:11:50] [INFO ] Redundant transitions in 31 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 308/504 places, 108/403 transitions.
Graph (complete) has 418 edges and 308 vertex of which 208 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.1 ms
Discarding 100 places :
Also discarding 0 output transitions
Reduce places removed 100 places and 0 transitions.
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 95 rules applied. Total rules applied 96 place count 108 transition count 108
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 96 place count 108 transition count 108
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 108 transition count 108
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 192 place count 14 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 94 rules applied. Total rules applied 286 place count 14 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 287 place count 14 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 288 place count 13 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 289 place count 13 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 289 rules in 16 ms. Remains 13 /308 variables (removed 295) and now considering 13/108 (removed 95) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/504 places, 13/403 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40134 ms. Remains : 13/504 places, 13/403 transitions.
Built C files in :
/tmp/ltsmin274600951940315200
[2025-06-04 10:11:50] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin274600951940315200
Running compilation step : cd /tmp/ltsmin274600951940315200;'/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 1297 ms.
Running link step : cd /tmp/ltsmin274600951940315200;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin274600951940315200;'/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/stateBased5272468319739144549.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 8 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Running 302 sub problems to find dead transitions.
// Phase 1: matrix 403 rows 504 cols
[2025-06-04 10:12:05] [INFO ] Computed 202 invariants in 2 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/907 variables, and 202 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 2)
(s3 3)
(s4 0)
(s5 99)
(s6 1)
(s7 99)
(s8 1)
(s9 0)
(s10 1)
(s11 99)
(s12 1)
(s13 99)
(s14 0)
(s15 99)
(s16 1)
(s17 1)
(s18 99)
(s19 0)
(s20 99)
(s21 1)
(s22 99)
(s23 1)
(s24 0)
(s25 99)
(s26 1)
(s27 99)
(s28 1)
(s29 0)
(s30 1)
(s31 99)
(s32 1)
(s33 99)
(s34 0)
(s35 1)
(s36 99)
(s37 1)
(s38 99)
(s39 0)
(s40 1)
(s41 99)
(s42 99)
(s43 1)
(s44 0)
(s45 1)
(s46 99)
(s47 99)
(s48 1)
(s49 0)
(s50 99)
(s51 1)
(s52 1)
(s53 99)
(s54 0)
(s55 1)
(s56 99)
(s57 99)
(s58 1)
(s59 0)
(s60 99)
(s61 1)
(s62 1)
(s63 99)
(s64 0)
(s65 99)
(s66 1)
(s67 1)
(s68 99)
(s69 0)
(s70 99)
(s71 1)
(s72 1)
(s73 99)
(s74 0)
(s75 99)
(s76 1)
(s77 1)
(s78 99)
(s79 0)
(s80 1)
(s81 99)
(s82 99)
(s83 1)
(s84 0)
(s85 1)
(s86 99)
(s87 99)
(s88 1)
(s89 0)
(s90 99)
(s91 1)
(s92 99)
(s93 1)
(s94 0)
(s95 99)
(s96 1)
(s97 99)
(s98 1)
(s99 0)
(s100 1)
(s101 99)
(s102 99)
(s103 1)
(s104 0)
(s105 99)
(s106 1)
(s107 99)
(s108 1)
(s109 0)
(s110 99)
(s111 1)
(s112 99)
(s113 1)
(s114 0)
(s115 99)
(s116 1)
(s117 1)
(s118 99)
(s119 0)
(s120 99)
(s121 1)
(s122 1)
(s123 99)
(s124 0)
(s125 99)
(s126 1)
(s127 99)
(s128 1)
(s129 0)
(s130 99)
(s131 1)
(s132 99)
(s133 1)
(s134 0)
(s135 99)
(s136 1)
(s137 1)
(s138 99)
(s139 0)
(s140 1)
(s141 99)
(s142 99)
(s143 1)
(s144 0)
(s145 1)
(s146 99)
(s147 99)
(s148 1)
(s149 0)
(s150 1)
(s151 99)
(s152 1)
(s153 99)
(s154 0)
(s155 99)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/907 variables, and 202 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 0/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40066ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 40066ms
[2025-06-04 10:12:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:12:46] [INFO ] Implicit Places using invariants in 587 ms returned []
[2025-06-04 10:12:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:12:46] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2025-06-04 10:12:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 907/907 variables, and 706 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/907 variables, 302/1008 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/907 variables, and 1008 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Finished structural reductions in LTL mode , in 1 iterations and 101709 ms. Remains : 504/504 places, 403/403 transitions.
Built C files in :
/tmp/ltsmin10220169279432414529
[2025-06-04 10:13:47] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10220169279432414529
Running compilation step : cd /tmp/ltsmin10220169279432414529;'/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 1164 ms.
Running link step : cd /tmp/ltsmin10220169279432414529;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10220169279432414529;'/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/stateBased10788912183923576773.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 10:14:02] [INFO ] Flatten gal took : 30 ms
[2025-06-04 10:14:02] [INFO ] Flatten gal took : 30 ms
[2025-06-04 10:14:02] [INFO ] Time to serialize gal into /tmp/LTL4689378931497905678.gal : 6 ms
[2025-06-04 10:14:02] [INFO ] Time to serialize properties into /tmp/LTL867674862643307875.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4689378931497905678.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9738428245779841753.hoa' '-atoms' '/tmp/LTL867674862643307875.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL867674862643307875.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9738428245779841753.hoa
Detected timeout of ITS tools.
[2025-06-04 10:14:17] [INFO ] Flatten gal took : 27 ms
[2025-06-04 10:14:17] [INFO ] Flatten gal took : 24 ms
[2025-06-04 10:14:17] [INFO ] Time to serialize gal into /tmp/LTL16159578468425195719.gal : 5 ms
[2025-06-04 10:14:17] [INFO ] Time to serialize properties into /tmp/LTL10309201754572792912.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16159578468425195719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10309201754572792912.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(((X(X(X("((p139>=1)&&(p405>=1))"))))U(G("(p405>=1)")))||(G("(p139>=1)")))))
Formula 0 simplified : X((XXX!"((p139>=1)&&(p405>=1))" R F!"(p405>=1)") & F!"(p139>=1)")
Detected timeout of ITS tools.
[2025-06-04 10:14:32] [INFO ] Flatten gal took : 23 ms
[2025-06-04 10:14:32] [INFO ] Applying decomposition
[2025-06-04 10:14:32] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph994515582706040108.txt' '-o' '/tmp/graph994515582706040108.bin' '-w' '/tmp/graph994515582706040108.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph994515582706040108.bin' '-l' '-1' '-v' '-w' '/tmp/graph994515582706040108.weights' '-q' '0' '-e' '0.001'
[2025-06-04 10:14:32] [INFO ] Decomposing Gal with order
[2025-06-04 10:14:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 10:14:32] [INFO ] Flatten gal took : 86 ms
[2025-06-04 10:14:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-06-04 10:14:32] [INFO ] Time to serialize gal into /tmp/LTL14461650190365268242.gal : 12 ms
[2025-06-04 10:14:32] [INFO ] Time to serialize properties into /tmp/LTL12712978495077269085.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14461650190365268242.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12712978495077269085.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(((X(X(X("((i8.u66.p139>=1)&&(i27.u193.p405>=1))"))))U(G("(i27.u193.p405>=1)")))||(G("(i8.u66.p139>=1)")))))
Formula 0 simplified : X((XXX!"((i8.u66.p139>=1)&&(i27.u193.p405>=1))" R F!"(i27.u193.p405>=1)") & F!"(i8.u66.p139>=1)")
Detected timeout of ITS tools.
Treatment of property RefineWMG-PT-100100-LTLFireability-09 finished in 444517 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||G(p1))))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 7 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Running 302 sub problems to find dead transitions.
[2025-06-04 10:14:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/907 variables, and 202 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/907 variables, and 1008 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40084ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 40086ms
[2025-06-04 10:15:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:15:28] [INFO ] Implicit Places using invariants in 576 ms returned []
[2025-06-04 10:15:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:15:29] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2025-06-04 10:15:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 907/907 variables, and 706 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/907 variables, 302/1008 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/907 variables, and 1008 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Finished structural reductions in LTL mode , in 1 iterations and 101360 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-10
Entered a terminal (fully accepting) state of product in 55 steps with 27 reset in 0 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-10 finished in 101551 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 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 298 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 0 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 399 place count 106 transition count 106
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 1 with 97 rules applied. Total rules applied 496 place count 106 transition count 9
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 2 with 97 rules applied. Total rules applied 593 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 593 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 595 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 597 place count 7 transition count 7
Applied a total of 597 rules in 27 ms. Remains 7 /504 variables (removed 497) and now considering 7/403 (removed 396) transitions.
Running 4 sub problems to find dead transitions.
// Phase 1: matrix 7 rows 7 cols
[2025-06-04 10:16:29] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 14 constraints, problems are : Problem set: 0 solved, 4 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 228ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 228ms
[2025-06-04 10:16:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:16:29] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-04 10:16:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:16:29] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 10:16:29] [INFO ] Redundant transitions in 18 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-04 10:16:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/7 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/13 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 14 constraints, problems are : Problem set: 0 solved, 4 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 238ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 239ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/504 places, 7/403 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 586 ms. Remains : 7/504 places, 7/403 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-11 finished in 650 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||(p0 U X(p1))||G(p2)) U X(p1))))'
Support contains 7 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 12 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Running 302 sub problems to find dead transitions.
// Phase 1: matrix 403 rows 504 cols
[2025-06-04 10:16:30] [INFO ] Computed 202 invariants in 3 ms
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
SMT process timed out in 20048ms, After SMT, problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 20049ms
[2025-06-04 10:16:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:16:50] [INFO ] Implicit Places using invariants in 385 ms returned []
[2025-06-04 10:16:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:16:51] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 1031 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2025-06-04 10:16:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 907/907 variables, and 706 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/907 variables, 302/1008 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/907 variables, and 1008 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Finished structural reductions in LTL mode , in 1 iterations and 81155 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-12 finished in 81416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 7 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Running 302 sub problems to find dead transitions.
[2025-06-04 10:17:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/907 variables, and 202 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/907 variables, and 1008 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40092ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 40093ms
[2025-06-04 10:18:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:18:32] [INFO ] Implicit Places using invariants in 601 ms returned []
[2025-06-04 10:18:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:18:33] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1617 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2025-06-04 10:18:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 907/907 variables, and 706 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/907 variables, 302/1008 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/907 variables, and 1008 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60071ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Finished structural reductions in LTL mode , in 1 iterations and 101792 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-14
Product exploration explored 100000 steps with 679 reset in 1935 ms.
Stack based approach found an accepted trace after 80 steps with 1 reset with depth 6 and stack size 6 in 1 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-14 finished in 103816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(X(p1)))))))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 8 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Running 302 sub problems to find dead transitions.
[2025-06-04 10:19:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/907 variables, and 202 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 0/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/907 variables, and 706 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 0/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40056ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 40057ms
[2025-06-04 10:20:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:20:16] [INFO ] Implicit Places using invariants in 520 ms returned []
[2025-06-04 10:20:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 10:20:16] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1398 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2025-06-04 10:20:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 907/907 variables, and 706 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 2/504 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 403/907 variables, 504/706 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/907 variables, 302/1008 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/907 variables, and 1008 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 202/202 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Finished structural reductions in LTL mode , in 1 iterations and 101532 ms. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : RefineWMG-PT-100100-LTLFireability-15
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100100-LTLFireability-15 finished in 101823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(X(X(p0))) U G(p1))||G(p2))))'
[2025-06-04 10:21:17] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2336136602892528262
[2025-06-04 10:21:17] [INFO ] Computing symmetric may disable matrix : 403 transitions.
[2025-06-04 10:21:17] [INFO ] Applying decomposition
[2025-06-04 10:21:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 10:21:17] [INFO ] Computing symmetric may enable matrix : 403 transitions.
[2025-06-04 10:21:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 10:21:17] [INFO ] Flatten gal took : 27 ms
[2025-06-04 10:21:17] [INFO ] Computing Do-Not-Accords matrix : 403 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1348586730769919005.txt' '-o' '/tmp/graph1348586730769919005.bin' '-w' '/tmp/graph1348586730769919005.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1348586730769919005.bin' '-l' '-1' '-v' '-w' '/tmp/graph1348586730769919005.weights' '-q' '0' '-e' '0.001'
[2025-06-04 10:21:17] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 10:21:17] [INFO ] Decomposing Gal with order
[2025-06-04 10:21:17] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2336136602892528262
Running compilation step : cd /tmp/ltsmin2336136602892528262;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-04 10:21:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 10:21:17] [INFO ] Flatten gal took : 50 ms
[2025-06-04 10:21:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2025-06-04 10:21:17] [INFO ] Time to serialize gal into /tmp/LTLFireability13659514324237503693.gal : 13 ms
[2025-06-04 10:21:17] [INFO ] Time to serialize properties into /tmp/LTLFireability13174451529366421798.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13659514324237503693.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13174451529366421798.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(((X(X(X("((i8.u67.p139>=1)&&(i27.u197.p405>=1))"))))U(G("(i27.u197.p405>=1)")))||(G("(i8.u67.p139>=1)")))))
Formula 0 simplified : X((XXX!"((i8.u67.p139>=1)&&(i27.u197.p405>=1))" R F!"(i27.u197.p405>=1)") & F!"(i8.u67.p139>=1)")
Compilation finished in 1520 ms.
Running link step : cd /tmp/ltsmin2336136602892528262;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2336136602892528262;'/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' '--ltl' 'X(((X(X(X((LTLAPp0==true)))) U []((LTLAPp1==true)))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: LTL layer: formula: X(((X(X(X((LTLAPp0==true)))) U []((LTLAPp1==true)))||[]((LTLAPp2==true))))
pins2lts-mc-linux64( 6/ 8), 0.027: "X(((X(X(X((LTLAPp0==true)))) U []((LTLAPp1==true)))||[]((LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.027: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.076: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.182: There are 407 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.182: State length is 505, there are 454 groups
pins2lts-mc-linux64( 0/ 8), 0.182: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.182: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.182: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.182: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 1.103: [Blue] ~120 levels ~960 states ~100896 transitions
pins2lts-mc-linux64( 2/ 8), 1.710: [Blue] ~240 levels ~1920 states ~206224 transitions
pins2lts-mc-linux64( 0/ 8), 2.491: [Blue] ~480 levels ~3840 states ~406656 transitions
pins2lts-mc-linux64( 2/ 8), 3.290: [Blue] ~960 levels ~7680 states ~825296 transitions
pins2lts-mc-linux64( 3/ 8), 3.837: [Blue] ~1920 levels ~15360 states ~1612408 transitions
pins2lts-mc-linux64( 0/ 8), 4.507: [Blue] ~3840 levels ~30720 states ~3268800 transitions
pins2lts-mc-linux64( 0/ 8), 6.134: [Blue] ~7680 levels ~61440 states ~6566480 transitions
pins2lts-mc-linux64( 0/ 8), 9.438: [Blue] ~15360 levels ~122880 states ~13190824 transitions
pins2lts-mc-linux64( 4/ 8), 16.515: [Blue] ~30720 levels ~245760 states ~25756432 transitions
pins2lts-mc-linux64( 4/ 8), 30.274: [Blue] ~61440 levels ~491520 states ~51777688 transitions
pins2lts-mc-linux64( 1/ 8), 59.266: [Blue] ~122880 levels ~983040 states ~103032016 transitions
pins2lts-mc-linux64( 7/ 8), 99.535: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 101.270:
pins2lts-mc-linux64( 0/ 8), 101.270: Explored 1344669 states 144515215 transitions, fanout: 107.473
pins2lts-mc-linux64( 0/ 8), 101.270: Total exploration time 101.080 sec (99.610 sec minimum, 100.338 sec on average)
pins2lts-mc-linux64( 0/ 8), 101.270: States per second: 13303, Transitions per second: 1429711
pins2lts-mc-linux64( 0/ 8), 101.270:
pins2lts-mc-linux64( 0/ 8), 101.270: State space has 134217578 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 101.270: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 101.270: blue states: 1344669 (1.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 101.270: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 101.270: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 101.270:
pins2lts-mc-linux64( 0/ 8), 101.270: Total memory used for local state coloring: 20.5MB
pins2lts-mc-linux64( 0/ 8), 101.270:
pins2lts-mc-linux64( 0/ 8), 101.270: Queue width: 8B, total height: 1344669, memory: 10.26MB
pins2lts-mc-linux64( 0/ 8), 101.270: Tree memory: 1138.4MB, 8.9 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 101.270: Tree fill ratio (roots/leafs): 99.0%/44.0%
pins2lts-mc-linux64( 0/ 8), 101.270: Stored 405 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 101.270: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 101.270: Est. total memory use: 1148.7MB (~1034.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2336136602892528262;'/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' '--ltl' 'X(((X(X(X((LTLAPp0==true)))) U []((LTLAPp1==true)))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2336136602892528262;'/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' '--ltl' 'X(((X(X(X((LTLAPp0==true)))) U []((LTLAPp1==true)))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-04 10:48:58] [INFO ] Flatten gal took : 17 ms
[2025-06-04 10:48:58] [INFO ] Time to serialize gal into /tmp/LTLFireability6340794146012121947.gal : 4 ms
[2025-06-04 10:48:58] [INFO ] Time to serialize properties into /tmp/LTLFireability17398305114680374805.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6340794146012121947.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17398305114680374805.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(((X(X(X("((p139>=1)&&(p405>=1))"))))U(G("(p405>=1)")))||(G("(p139>=1)")))))
Formula 0 simplified : X((XXX!"((p139>=1)&&(p405>=1))" R F!"(p405>=1)") & F!"(p139>=1)")
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-100100"
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 RefineWMG-PT-100100, 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 r170-smll-174889233800356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-100100.tgz
mv RefineWMG-PT-100100 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 ;