About the Execution of ITS-Tools for CloudReconfiguration-PT-401
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1750385.00 | 0.00 | 0.00 | TFFFFFTFFFFFFTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r044-tall-174854028300364.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 CloudReconfiguration-PT-401, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854028300364
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 912K 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 CloudReconfiguration-PT-401-LTLFireability-00
FORMULA_NAME CloudReconfiguration-PT-401-LTLFireability-01
FORMULA_NAME CloudReconfiguration-PT-401-LTLFireability-02
FORMULA_NAME CloudReconfiguration-PT-401-LTLFireability-03
FORMULA_NAME CloudReconfiguration-PT-401-LTLFireability-04
FORMULA_NAME CloudReconfiguration-PT-401-LTLFireability-05
FORMULA_NAME CloudReconfiguration-PT-401-LTLFireability-06
FORMULA_NAME CloudReconfiguration-PT-401-LTLFireability-07
FORMULA_NAME CloudReconfiguration-PT-401-LTLFireability-08
FORMULA_NAME CloudReconfiguration-PT-401-LTLFireability-09
FORMULA_NAME CloudReconfiguration-PT-401-LTLFireability-10
FORMULA_NAME CloudReconfiguration-PT-401-LTLFireability-11
FORMULA_NAME CloudReconfiguration-PT-401-LTLFireability-12
FORMULA_NAME CloudReconfiguration-PT-401-LTLFireability-13
FORMULA_NAME CloudReconfiguration-PT-401-LTLFireability-14
FORMULA_NAME CloudReconfiguration-PT-401-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748603064194
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-401
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 11:04:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 11:04:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:04:25] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2025-05-30 11:04:25] [INFO ] Transformed 3554 places.
[2025-05-30 11:04:25] [INFO ] Transformed 4263 transitions.
[2025-05-30 11:04:25] [INFO ] Found NUPN structural information;
[2025-05-30 11:04:25] [INFO ] Parsed PT model containing 3554 places and 4263 transitions and 8889 arcs in 282 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CloudReconfiguration-PT-401-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-401-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-401-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 3554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3554/3554 places, 4263/4263 transitions.
Discarding 717 places :
Symmetric choice reduction at 0 with 717 rule applications. Total rules 717 place count 2837 transition count 3546
Iterating global reduction 0 with 717 rules applied. Total rules applied 1434 place count 2837 transition count 3546
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 1472 place count 2837 transition count 3508
Discarding 327 places :
Symmetric choice reduction at 1 with 327 rule applications. Total rules 1799 place count 2510 transition count 3181
Iterating global reduction 1 with 327 rules applied. Total rules applied 2126 place count 2510 transition count 3181
Discarding 122 places :
Symmetric choice reduction at 1 with 122 rule applications. Total rules 2248 place count 2388 transition count 3059
Iterating global reduction 1 with 122 rules applied. Total rules applied 2370 place count 2388 transition count 3059
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 2395 place count 2388 transition count 3034
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 2458 place count 2325 transition count 2971
Iterating global reduction 2 with 63 rules applied. Total rules applied 2521 place count 2325 transition count 2971
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 2532 place count 2325 transition count 2960
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 2583 place count 2274 transition count 2902
Iterating global reduction 3 with 51 rules applied. Total rules applied 2634 place count 2274 transition count 2902
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 2670 place count 2238 transition count 2866
Iterating global reduction 3 with 36 rules applied. Total rules applied 2706 place count 2238 transition count 2866
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 2739 place count 2205 transition count 2833
Iterating global reduction 3 with 33 rules applied. Total rules applied 2772 place count 2205 transition count 2833
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 2805 place count 2172 transition count 2800
Iterating global reduction 3 with 33 rules applied. Total rules applied 2838 place count 2172 transition count 2800
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 2867 place count 2143 transition count 2753
Iterating global reduction 3 with 29 rules applied. Total rules applied 2896 place count 2143 transition count 2753
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2906 place count 2133 transition count 2736
Iterating global reduction 3 with 10 rules applied. Total rules applied 2916 place count 2133 transition count 2736
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2926 place count 2123 transition count 2722
Iterating global reduction 3 with 10 rules applied. Total rules applied 2936 place count 2123 transition count 2722
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2939 place count 2123 transition count 2719
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 2943 place count 2119 transition count 2715
Iterating global reduction 4 with 4 rules applied. Total rules applied 2947 place count 2119 transition count 2715
Applied a total of 2947 rules in 1891 ms. Remains 2119 /3554 variables (removed 1435) and now considering 2715/4263 (removed 1548) transitions.
// Phase 1: matrix 2715 rows 2119 cols
[2025-05-30 11:04:27] [INFO ] Computed 5 invariants in 52 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:04:28] [INFO ] Implicit Places using invariants in 613 ms returned []
[2025-05-30 11:04:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:04:29] [INFO ] Implicit Places using invariants and state equation in 1487 ms returned []
Implicit Place search using SMT with State Equation took 2137 ms to find 0 implicit places.
Running 2714 sub problems to find dead transitions.
[2025-05-30 11:04: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/2118 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2714 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2118/4834 variables, and 5 constraints, problems are : Problem set: 0 solved, 2714 unsolved in 30096 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2119 constraints, PredecessorRefiner: 2714/2714 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2714 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2118 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2714 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2118/4834 variables, and 5 constraints, problems are : Problem set: 0 solved, 2714 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2119 constraints, PredecessorRefiner: 0/2714 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61102ms problems are : Problem set: 0 solved, 2714 unsolved
Search for dead transitions found 0 dead transitions in 61124ms
Starting structural reductions in LTL mode, iteration 1 : 2119/3554 places, 2715/4263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65185 ms. Remains : 2119/3554 places, 2715/4263 transitions.
Support contains 38 out of 2119 places after structural reductions.
[2025-05-30 11:05:31] [INFO ] Flatten gal took : 147 ms
[2025-05-30 11:05:31] [INFO ] Flatten gal took : 84 ms
[2025-05-30 11:05:31] [INFO ] Input system was already deterministic with 2715 transitions.
RANDOM walk for 40000 steps (223 resets) in 2309 ms. (17 steps per ms) remains 28/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 97 ms. (40 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (8 resets) in 65 ms. (60 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (8 resets) in 117 ms. (33 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
[2025-05-30 11:05:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 2076/2106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 2703/4809 variables, 2106/2111 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4809 variables, 0/2111 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 2/4811 variables, 1/2112 constraints. Problems are: Problem set: 0 solved, 28 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 4811/4834 variables, and 2112 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5030 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2107/2119 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 2076/2106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 2703/4809 variables, 2106/2111 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4809 variables, 28/2139 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4809/4834 variables, and 2139 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5029 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2106/2119 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10094ms problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 2119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2119/2119 places, 2715/2715 transitions.
Graph (trivial) has 2527 edges and 2119 vertex of which 920 / 2119 are part of one of the 84 SCC in 8 ms
Free SCC test removed 836 places
Drop transitions (Empty/Sink Transition effects.) removed 1056 transitions
Reduce isomorphic transitions removed 1056 transitions.
Graph (complete) has 1890 edges and 1283 vertex of which 1271 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.4 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 672 transitions
Trivial Post-agglo rules discarded 672 transitions
Performed 672 trivial Post agglomeration. Transition count delta: 672
Iterating post reduction 0 with 681 rules applied. Total rules applied 683 place count 1271 transition count 972
Reduce places removed 672 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 1 with 740 rules applied. Total rules applied 1423 place count 599 transition count 904
Reduce places removed 44 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 59 rules applied. Total rules applied 1482 place count 555 transition count 889
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 1499 place count 540 transition count 887
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 77 Pre rules applied. Total rules applied 1499 place count 540 transition count 810
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 1653 place count 463 transition count 810
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 1666 place count 450 transition count 792
Iterating global reduction 4 with 13 rules applied. Total rules applied 1679 place count 450 transition count 792
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1681 place count 450 transition count 790
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1683 place count 448 transition count 790
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1691 place count 440 transition count 782
Iterating global reduction 6 with 8 rules applied. Total rules applied 1699 place count 440 transition count 782
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1707 place count 440 transition count 774
Performed 211 Post agglomeration using F-continuation condition with reduction of 125 identical transitions.
Deduced a syphon composed of 211 places in 0 ms
Reduce places removed 211 places and 0 transitions.
Iterating global reduction 7 with 422 rules applied. Total rules applied 2129 place count 229 transition count 438
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 7 with 30 rules applied. Total rules applied 2159 place count 229 transition count 408
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 2162 place count 226 transition count 405
Iterating global reduction 8 with 3 rules applied. Total rules applied 2165 place count 226 transition count 405
Performed 14 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 2193 place count 212 transition count 389
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 2213 place count 212 transition count 369
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 9 with 2 rules applied. Total rules applied 2215 place count 211 transition count 368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 2219 place count 211 transition count 364
Performed 54 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 10 with 108 rules applied. Total rules applied 2327 place count 157 transition count 404
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 10 with 42 rules applied. Total rules applied 2369 place count 157 transition count 362
Discarding 28 places :
Symmetric choice reduction at 11 with 28 rule applications. Total rules 2397 place count 129 transition count 306
Iterating global reduction 11 with 28 rules applied. Total rules applied 2425 place count 129 transition count 306
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 2437 place count 129 transition count 294
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 2443 place count 123 transition count 282
Iterating global reduction 12 with 6 rules applied. Total rules applied 2449 place count 123 transition count 282
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 2455 place count 123 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 13 with 10 rules applied. Total rules applied 2465 place count 123 transition count 266
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 2469 place count 121 transition count 264
Free-agglomeration rule applied 4 times.
Iterating global reduction 13 with 4 rules applied. Total rules applied 2473 place count 121 transition count 260
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 2477 place count 117 transition count 260
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 14 with 8 rules applied. Total rules applied 2485 place count 117 transition count 260
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 2488 place count 117 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 2489 place count 116 transition count 259
Applied a total of 2489 rules in 187 ms. Remains 116 /2119 variables (removed 2003) and now considering 259/2715 (removed 2456) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 116/2119 places, 259/2715 transitions.
RANDOM walk for 40000 steps (3141 resets) in 830 ms. (48 steps per ms) remains 1/28 properties
BEST_FIRST walk for 40003 steps (633 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
[2025-05-30 11:05:43] [INFO ] Flow matrix only has 247 transitions (discarded 12 similar events)
// Phase 1: matrix 247 rows 116 cols
[2025-05-30 11:05:43] [INFO ] Computed 4 invariants in 2 ms
[2025-05-30 11:05:43] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 106/147 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/241 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 96/337 variables, 43/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/350 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 8/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/350 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/362 variables, 12/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/362 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/363 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/363 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/363 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 129 constraints, problems are : Problem set: 0 solved, 1 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 9/9 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 106/147 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 94/241 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 96/337 variables, 43/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 5/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/350 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/350 variables, 8/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/362 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/362 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/363 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/363 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/363 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 130 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 291ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 864 steps, including 81 resets, run visited all 1 properties in 4 ms. (steps per millisecond=216 )
Parikh walk visited 1 properties in 12 ms.
FORMULA CloudReconfiguration-PT-401-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 34 stabilizing places and 37 stable transitions
Graph (complete) has 2953 edges and 2119 vertex of which 2107 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.28 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(F(p0))||G(p1)) U X((X(p2) U ((p3&&X(p2))||X(G(p2))))))))'
Support contains 4 out of 2119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2119/2119 places, 2715/2715 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 2105 transition count 2701
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 2105 transition count 2701
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 2105 transition count 2699
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 2099 transition count 2693
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 2099 transition count 2693
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 2094 transition count 2688
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 2094 transition count 2688
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 2094 transition count 2686
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 2091 transition count 2683
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 2091 transition count 2683
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 2088 transition count 2680
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 2088 transition count 2680
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 2085 transition count 2675
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 2085 transition count 2675
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 2083 transition count 2672
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 2083 transition count 2672
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 2081 transition count 2670
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 2081 transition count 2670
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 2081 transition count 2669
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 2080 transition count 2668
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 2080 transition count 2668
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 2079 transition count 2667
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 2079 transition count 2667
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 2078 transition count 2666
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 2078 transition count 2666
Applied a total of 87 rules in 1079 ms. Remains 2078 /2119 variables (removed 41) and now considering 2666/2715 (removed 49) transitions.
// Phase 1: matrix 2666 rows 2078 cols
[2025-05-30 11:05:45] [INFO ] Computed 5 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:05:45] [INFO ] Implicit Places using invariants in 370 ms returned []
[2025-05-30 11:05:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:05:47] [INFO ] Implicit Places using invariants and state equation in 1431 ms returned []
Implicit Place search using SMT with State Equation took 1803 ms to find 0 implicit places.
Running 2665 sub problems to find dead transitions.
[2025-05-30 11:05:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2077 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2077/4744 variables, and 5 constraints, problems are : Problem set: 0 solved, 2665 unsolved in 30050 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2078 constraints, PredecessorRefiner: 2665/2665 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2665 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2077 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2665 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 Int declared 2077/4744 variables, and 5 constraints, problems are : Problem set: 0 solved, 2665 unsolved in 30046 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2078 constraints, PredecessorRefiner: 0/2665 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60745ms problems are : Problem set: 0 solved, 2665 unsolved
Search for dead transitions found 0 dead transitions in 60752ms
Starting structural reductions in LTL mode, iteration 1 : 2078/2119 places, 2666/2715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63642 ms. Remains : 2078/2119 places, 2666/2715 transitions.
Stuttering acceptance computed with spot in 760 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-00
Product exploration explored 100000 steps with 28577 reset in 492 ms.
Product exploration explored 100000 steps with 28538 reset in 408 ms.
Computed a total of 34 stabilizing places and 37 stable transitions
Graph (complete) has 2901 edges and 2078 vertex of which 2067 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.13 ms
Computed a total of 34 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND p1 p3 p2 p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p3))), (X (X (AND p3 p2))), (X (X (NOT (AND p1 (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0) p2)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 145 ms. Reduced automaton from 12 states, 33 edges and 4 AP (stutter sensitive) to 12 states, 31 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 568 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (219 resets) in 628 ms. (63 steps per ms) remains 16/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
[2025-05-30 11:06:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1259/1263 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1263 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 802/2065 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2065 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 2654/4719 variables, 2065/2070 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4719 variables, 0/2070 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 2/4721 variables, 1/2071 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4721/4744 variables, and 2071 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5015 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2066/2078 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1259/1263 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1263 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 802/2065 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2065 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 2654/4719 variables, 2065/2070 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4719 variables, 16/2086 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4719 variables, 0/2086 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 2/4721 variables, 1/2087 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4721/4744 variables, and 2087 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5010 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2066/2078 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10046ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 2078 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2078/2078 places, 2666/2666 transitions.
Graph (trivial) has 2542 edges and 2078 vertex of which 977 / 2078 are part of one of the 88 SCC in 8 ms
Free SCC test removed 889 places
Drop transitions (Empty/Sink Transition effects.) removed 1128 transitions
Reduce isomorphic transitions removed 1128 transitions.
Graph (complete) has 1766 edges and 1189 vertex of which 1178 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 660 transitions
Trivial Post-agglo rules discarded 660 transitions
Performed 660 trivial Post agglomeration. Transition count delta: 660
Iterating post reduction 0 with 669 rules applied. Total rules applied 671 place count 1178 transition count 864
Reduce places removed 660 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 1 with 750 rules applied. Total rules applied 1421 place count 518 transition count 774
Reduce places removed 59 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 60 rules applied. Total rules applied 1481 place count 459 transition count 773
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1483 place count 458 transition count 772
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 66 Pre rules applied. Total rules applied 1483 place count 458 transition count 706
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 1615 place count 392 transition count 706
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1630 place count 377 transition count 684
Iterating global reduction 4 with 15 rules applied. Total rules applied 1645 place count 377 transition count 684
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 1649 place count 377 transition count 680
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1653 place count 373 transition count 680
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1663 place count 363 transition count 668
Iterating global reduction 6 with 10 rules applied. Total rules applied 1673 place count 363 transition count 668
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1681 place count 363 transition count 660
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1682 place count 362 transition count 654
Iterating global reduction 7 with 1 rules applied. Total rules applied 1683 place count 362 transition count 654
Performed 188 Post agglomeration using F-continuation condition with reduction of 126 identical transitions.
Deduced a syphon composed of 188 places in 0 ms
Reduce places removed 188 places and 0 transitions.
Iterating global reduction 7 with 376 rules applied. Total rules applied 2059 place count 174 transition count 340
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 2078 place count 174 transition count 321
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2082 place count 170 transition count 317
Iterating global reduction 8 with 4 rules applied. Total rules applied 2086 place count 170 transition count 317
Performed 17 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 2120 place count 153 transition count 296
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 2140 place count 153 transition count 276
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 9 with 2 rules applied. Total rules applied 2142 place count 152 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2144 place count 152 transition count 273
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 10 with 2 rules applied. Total rules applied 2146 place count 151 transition count 272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 2148 place count 151 transition count 270
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 11 with 2 rules applied. Total rules applied 2150 place count 150 transition count 269
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 2152 place count 150 transition count 267
Performed 44 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 12 with 88 rules applied. Total rules applied 2240 place count 106 transition count 301
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 12 with 56 rules applied. Total rules applied 2296 place count 106 transition count 245
Discarding 31 places :
Symmetric choice reduction at 13 with 31 rule applications. Total rules 2327 place count 75 transition count 199
Iterating global reduction 13 with 31 rules applied. Total rules applied 2358 place count 75 transition count 199
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 13 with 18 rules applied. Total rules applied 2376 place count 75 transition count 181
Discarding 8 places :
Symmetric choice reduction at 14 with 8 rule applications. Total rules 2384 place count 67 transition count 165
Iterating global reduction 14 with 8 rules applied. Total rules applied 2392 place count 67 transition count 165
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 2400 place count 67 transition count 157
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2402 place count 66 transition count 169
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 2404 place count 66 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 16 with 34 rules applied. Total rules applied 2438 place count 66 transition count 133
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 2440 place count 64 transition count 127
Iterating global reduction 16 with 2 rules applied. Total rules applied 2442 place count 64 transition count 127
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 2444 place count 62 transition count 125
Iterating global reduction 16 with 2 rules applied. Total rules applied 2446 place count 62 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 2448 place count 62 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 17 with 2 rules applied. Total rules applied 2450 place count 62 transition count 121
Free-agglomeration rule applied 5 times.
Iterating global reduction 17 with 5 rules applied. Total rules applied 2455 place count 62 transition count 116
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 2461 place count 57 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 2462 place count 57 transition count 114
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 2463 place count 57 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 2464 place count 56 transition count 113
Applied a total of 2464 rules in 126 ms. Remains 56 /2078 variables (removed 2022) and now considering 113/2666 (removed 2553) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 56/2078 places, 113/2666 transitions.
RANDOM walk for 40000 steps (578 resets) in 158 ms. (251 steps per ms) remains 5/16 properties
BEST_FIRST walk for 40001 steps (9 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (11 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (9 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
[2025-05-30 11:07:01] [INFO ] Flow matrix only has 106 transitions (discarded 7 similar events)
// Phase 1: matrix 106 rows 56 cols
[2025-05-30 11:07:01] [INFO ] Computed 5 invariants in 0 ms
[2025-05-30 11:07:01] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf3 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf10 is UNSAT
At refinement iteration 1 (OVERLAPS) 25/29 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/108 variables, 29/32 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/33 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/33 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 31/139 variables, 15/48 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 1/49 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/49 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/140 variables, 1/50 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 1/51 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/51 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 18/158 variables, 8/59 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 1/60 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 0/60 constraints. Problems are: Problem set: 4 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 3/161 variables, 1/61 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/161 variables, 1/62 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/161 variables, 0/62 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/162 variables, 2/64 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/162 variables, 0/64 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/162 variables, 0/64 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 64 constraints, problems are : Problem set: 4 solved, 1 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 56/56 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/108 variables, 29/32 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/33 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 1/34 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/34 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 31/139 variables, 15/49 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 1/50 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/50 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/140 variables, 1/51 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 1/52 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 0/52 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 18/158 variables, 8/60 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 1/61 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/158 variables, 0/61 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/161 variables, 1/62 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/161 variables, 1/63 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/161 variables, 0/63 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/162 variables, 2/65 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/162 variables, 0/65 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/162 variables, 0/65 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 65 constraints, problems are : Problem set: 4 solved, 1 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 56/56 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 200ms problems are : Problem set: 4 solved, 1 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 1 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p1 p3 p2 p0), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p3))), (X (X (AND p3 p2))), (X (X (NOT (AND p1 (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0) p2)))), (X (X p0)), (X (X p1)), (G (OR (NOT p1) p0 p2)), (G (OR p0 p2)), (G (OR p1 p0 p2)), (G (OR (NOT p1) p3 p0 p2))]
False Knowledge obtained : [(F (NOT (AND p3 p2))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p3 p2))), (F (NOT (OR p1 p3))), (F (NOT (OR (NOT p1) p3))), (F (NOT (AND p1 p3))), (F (NOT (OR p1 (NOT p3) p2))), (F (NOT (OR (NOT p1) p3 p2))), (F (NOT (OR (NOT p3) p2))), (F (NOT p2)), (F (NOT (OR p1 p0))), (F (NOT (OR p3 p2))), (F (NOT (OR p1 (NOT p3)))), (F (NOT p3)), (F (NOT (OR (NOT p1) (NOT p3) p2))), (F (NOT (OR p3 (NOT p2)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p1) p3 p0 (NOT p2))))]
Knowledge based reduction with 22 factoid took 768 ms. Reduced automaton from 12 states, 31 edges and 4 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 2078 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2078/2078 places, 2666/2666 transitions.
Applied a total of 0 rules in 78 ms. Remains 2078 /2078 variables (removed 0) and now considering 2666/2666 (removed 0) transitions.
// Phase 1: matrix 2666 rows 2078 cols
[2025-05-30 11:07:02] [INFO ] Computed 5 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:07:03] [INFO ] Implicit Places using invariants in 307 ms returned []
[2025-05-30 11:07:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:07:04] [INFO ] Implicit Places using invariants and state equation in 1310 ms returned []
Implicit Place search using SMT with State Equation took 1620 ms to find 0 implicit places.
Running 2665 sub problems to find dead transitions.
[2025-05-30 11:07:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2077 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2077/4744 variables, and 5 constraints, problems are : Problem set: 0 solved, 2665 unsolved in 30058 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2078 constraints, PredecessorRefiner: 2665/2665 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2665 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2077 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2077/4744 variables, and 5 constraints, problems are : Problem set: 0 solved, 2665 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2078 constraints, PredecessorRefiner: 0/2665 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60747ms problems are : Problem set: 0 solved, 2665 unsolved
Search for dead transitions found 0 dead transitions in 60750ms
Finished structural reductions in LTL mode , in 1 iterations and 62461 ms. Remains : 2078/2078 places, 2666/2666 transitions.
Computed a total of 34 stabilizing places and 37 stable transitions
Graph (complete) has 2901 edges and 2078 vertex of which 2067 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.11 ms
Computed a total of 34 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND p2 p3), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p2 p3))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 112 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (215 resets) in 154 ms. (258 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (50 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (50 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (49 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
[2025-05-30 11:08:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 859/861 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/861 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1204/2065 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2065 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2654/4719 variables, 2065/2070 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4719 variables, 0/2070 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/4721 variables, 1/2071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4721 variables, 0/2071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/4723 variables, 1/2072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4723 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/4725 variables, 1/2073 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4725 variables, 0/2073 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/4727 variables, 1/2074 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4727 variables, 0/2074 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/4729 variables, 1/2075 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4729 variables, 0/2075 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/4731 variables, 1/2076 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4731 variables, 0/2076 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/4733 variables, 1/2077 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4733 variables, 0/2077 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/4735 variables, 1/2078 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4735 variables, 0/2078 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/4737 variables, 1/2079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4737 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/4739 variables, 1/2080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4739 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 2/4741 variables, 1/2081 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4741/4744 variables, and 2081 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5019 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2076/2078 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 859/861 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/861 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1204/2065 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2065 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2654/4719 variables, 2065/2070 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4719 variables, 3/2073 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4719 variables, 0/2073 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/4721 variables, 1/2074 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4721 variables, 0/2074 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/4723 variables, 1/2075 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4723 variables, 0/2075 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/4725 variables, 1/2076 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4725 variables, 0/2076 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/4727 variables, 1/2077 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4727 variables, 0/2077 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/4729 variables, 1/2078 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4729 variables, 0/2078 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/4731 variables, 1/2079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4731 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/4733 variables, 1/2080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4733 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 2/4735 variables, 1/2081 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4735/4744 variables, and 2081 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5015 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2073/2078 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10047ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 2078 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2078/2078 places, 2666/2666 transitions.
Graph (trivial) has 2546 edges and 2078 vertex of which 977 / 2078 are part of one of the 88 SCC in 6 ms
Free SCC test removed 889 places
Drop transitions (Empty/Sink Transition effects.) removed 1128 transitions
Reduce isomorphic transitions removed 1128 transitions.
Graph (complete) has 1766 edges and 1189 vertex of which 1178 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 663 transitions
Trivial Post-agglo rules discarded 663 transitions
Performed 663 trivial Post agglomeration. Transition count delta: 663
Iterating post reduction 0 with 672 rules applied. Total rules applied 674 place count 1178 transition count 861
Reduce places removed 663 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 1 with 753 rules applied. Total rules applied 1427 place count 515 transition count 771
Reduce places removed 59 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 60 rules applied. Total rules applied 1487 place count 456 transition count 770
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1489 place count 455 transition count 769
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 66 Pre rules applied. Total rules applied 1489 place count 455 transition count 703
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 1621 place count 389 transition count 703
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1637 place count 373 transition count 680
Iterating global reduction 4 with 16 rules applied. Total rules applied 1653 place count 373 transition count 680
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 1657 place count 373 transition count 676
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1661 place count 369 transition count 676
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1661 place count 369 transition count 675
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1663 place count 368 transition count 675
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1673 place count 358 transition count 663
Iterating global reduction 6 with 10 rules applied. Total rules applied 1683 place count 358 transition count 663
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1691 place count 358 transition count 655
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1692 place count 357 transition count 649
Iterating global reduction 7 with 1 rules applied. Total rules applied 1693 place count 357 transition count 649
Performed 187 Post agglomeration using F-continuation condition with reduction of 126 identical transitions.
Deduced a syphon composed of 187 places in 1 ms
Reduce places removed 187 places and 0 transitions.
Iterating global reduction 7 with 374 rules applied. Total rules applied 2067 place count 170 transition count 336
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 2087 place count 170 transition count 316
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2092 place count 165 transition count 309
Iterating global reduction 8 with 5 rules applied. Total rules applied 2097 place count 165 transition count 309
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 2133 place count 147 transition count 287
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 2153 place count 147 transition count 267
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2155 place count 146 transition count 266
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2157 place count 146 transition count 264
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 10 with 2 rules applied. Total rules applied 2159 place count 145 transition count 263
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2162 place count 145 transition count 260
Performed 44 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 11 with 88 rules applied. Total rules applied 2250 place count 101 transition count 306
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 11 with 71 rules applied. Total rules applied 2321 place count 101 transition count 235
Discarding 31 places :
Symmetric choice reduction at 12 with 31 rule applications. Total rules 2352 place count 70 transition count 197
Iterating global reduction 12 with 31 rules applied. Total rules applied 2383 place count 70 transition count 197
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 12 with 19 rules applied. Total rules applied 2402 place count 70 transition count 178
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 2410 place count 62 transition count 162
Iterating global reduction 13 with 8 rules applied. Total rules applied 2418 place count 62 transition count 162
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 2426 place count 62 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 14 with 31 rules applied. Total rules applied 2457 place count 62 transition count 123
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 2460 place count 59 transition count 114
Iterating global reduction 14 with 3 rules applied. Total rules applied 2463 place count 59 transition count 114
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 2466 place count 56 transition count 111
Iterating global reduction 14 with 3 rules applied. Total rules applied 2469 place count 56 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 2472 place count 56 transition count 108
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 15 with 2 rules applied. Total rules applied 2474 place count 55 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 2477 place count 55 transition count 104
Free-agglomeration rule applied 4 times.
Iterating global reduction 15 with 4 rules applied. Total rules applied 2481 place count 55 transition count 100
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2486 place count 51 transition count 99
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 2487 place count 51 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 2488 place count 50 transition count 98
Applied a total of 2488 rules in 95 ms. Remains 50 /2078 variables (removed 2028) and now considering 98/2666 (removed 2568) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 50/2078 places, 98/2666 transitions.
RANDOM walk for 4922 steps (82 resets) in 24 ms. (196 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 p3), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (AND p2 p3))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F (NOT (AND p2 p3))), (F (NOT (OR p2 (NOT p3)))), (F (NOT p2)), (F (NOT (OR p2 p3))), (F (NOT p3))]
Knowledge based reduction with 7 factoid took 276 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 176 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 25000 reset in 338 ms.
Product exploration explored 100000 steps with 25000 reset in 349 ms.
Built C files in :
/tmp/ltsmin5521665300547867987
[2025-05-30 11:08:17] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5521665300547867987
Running compilation step : cd /tmp/ltsmin5521665300547867987;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5521665300547867987;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5521665300547867987;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 2078 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2078/2078 places, 2666/2666 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2076 transition count 2664
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2076 transition count 2664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 2075 transition count 2663
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 2075 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 2074 transition count 2662
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 2074 transition count 2662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 2073 transition count 2661
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 2073 transition count 2661
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 2073 transition count 2660
Applied a total of 11 rules in 431 ms. Remains 2073 /2078 variables (removed 5) and now considering 2660/2666 (removed 6) transitions.
// Phase 1: matrix 2660 rows 2073 cols
[2025-05-30 11:08:21] [INFO ] Computed 5 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:08:21] [INFO ] Implicit Places using invariants in 302 ms returned []
[2025-05-30 11:08:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:08:22] [INFO ] Implicit Places using invariants and state equation in 1291 ms returned []
Implicit Place search using SMT with State Equation took 1595 ms to find 0 implicit places.
Running 2659 sub problems to find dead transitions.
[2025-05-30 11:08: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/2072 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2072/4733 variables, and 5 constraints, problems are : Problem set: 0 solved, 2659 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2073 constraints, PredecessorRefiner: 2659/2659 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2659 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2072 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2659 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2072/4733 variables, and 5 constraints, problems are : Problem set: 0 solved, 2659 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2073 constraints, PredecessorRefiner: 0/2659 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60700ms problems are : Problem set: 0 solved, 2659 unsolved
Search for dead transitions found 0 dead transitions in 60706ms
Starting structural reductions in LTL mode, iteration 1 : 2073/2078 places, 2660/2666 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62743 ms. Remains : 2073/2078 places, 2660/2666 transitions.
Built C files in :
/tmp/ltsmin9118773250029671305
[2025-05-30 11:09:23] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9118773250029671305
Running compilation step : cd /tmp/ltsmin9118773250029671305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9118773250029671305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9118773250029671305;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 11:09:26] [INFO ] Flatten gal took : 66 ms
[2025-05-30 11:09:26] [INFO ] Flatten gal took : 66 ms
[2025-05-30 11:09:26] [INFO ] Time to serialize gal into /tmp/LTL17786696707907336696.gal : 18 ms
[2025-05-30 11:09:26] [INFO ] Time to serialize properties into /tmp/LTL15262762708401941849.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17786696707907336696.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18201067746503444823.hoa' '-atoms' '/tmp/LTL15262762708401941849.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...320
Loading property file /tmp/LTL15262762708401941849.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18201067746503444823.hoa
Detected timeout of ITS tools.
[2025-05-30 11:09:41] [INFO ] Flatten gal took : 55 ms
[2025-05-30 11:09:41] [INFO ] Flatten gal took : 55 ms
[2025-05-30 11:09:41] [INFO ] Time to serialize gal into /tmp/LTL16067560944211857172.gal : 11 ms
[2025-05-30 11:09:41] [INFO ] Time to serialize properties into /tmp/LTL5644030719772017459.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16067560944211857172.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5644030719772017459.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(((X(F("(p860!=1)")))||(G("(p999!=1)")))U(X((X("(p187!=1)"))U((X(G("(p187!=1)")))||(("(p1955!=1)")&&(X("(p187!=1)")))))))))
Formula 0 simplified : X((XG!"(p860!=1)" & F!"(p999!=1)") R X(X!"(p187!=1)" R (XF!"(p187!=1)" & (!"(p1955!=1)" | X!"(p187!=1)"))))
Detected timeout of ITS tools.
[2025-05-30 11:09:57] [INFO ] Flatten gal took : 49 ms
[2025-05-30 11:09:57] [INFO ] Applying decomposition
[2025-05-30 11:09:57] [INFO ] Flatten gal took : 48 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/graph17726150762683856283.txt' '-o' '/tmp/graph17726150762683856283.bin' '-w' '/tmp/graph17726150762683856283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17726150762683856283.bin' '-l' '-1' '-v' '-w' '/tmp/graph17726150762683856283.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:09:57] [INFO ] Decomposing Gal with order
[2025-05-30 11:09:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:09:57] [INFO ] Removed a total of 722 redundant transitions.
[2025-05-30 11:09:57] [INFO ] Flatten gal took : 177 ms
[2025-05-30 11:09:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 41 ms.
[2025-05-30 11:09:58] [INFO ] Time to serialize gal into /tmp/LTL6244415910682774962.gal : 25 ms
[2025-05-30 11:09:58] [INFO ] Time to serialize properties into /tmp/LTL16071595274848020769.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/LTL6244415910682774962.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16071595274848020769.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(((X(F("(i5.i1.i4.u172.p860!=1)")))||(G("(i12.i0.i2.u215.p999!=1)")))U(X((X("(i2.i1.i0.u38.p187!=1)"))U((X(G("(i2.i1.i0.u38.p187!=...231
Formula 0 simplified : X((XG!"(i5.i1.i4.u172.p860!=1)" & F!"(i12.i0.i2.u215.p999!=1)") R X(X!"(i2.i1.i0.u38.p187!=1)" R (XF!"(i2.i1.i0.u38.p187!=1)" & (!"(...213
Detected timeout of ITS tools.
Treatment of property CloudReconfiguration-PT-401-LTLFireability-00 finished in 268693 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||F((G(F((G(F(!p1))||(p2&&F(!p1)))))||(X(X(p3))&&F((G(F(!p1))||(p2&&F(!p1)))))))))))'
Support contains 5 out of 2119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2119/2119 places, 2715/2715 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 2103 transition count 2699
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 2103 transition count 2699
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 2103 transition count 2697
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 2096 transition count 2690
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 2096 transition count 2690
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 2090 transition count 2684
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 2090 transition count 2684
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 2090 transition count 2682
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 2086 transition count 2678
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 2086 transition count 2678
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 2086 transition count 2677
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 74 place count 2083 transition count 2674
Iterating global reduction 3 with 3 rules applied. Total rules applied 77 place count 2083 transition count 2674
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 79 place count 2081 transition count 2671
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 2081 transition count 2671
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 2080 transition count 2670
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 2080 transition count 2670
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 2079 transition count 2669
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 2079 transition count 2669
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 2078 transition count 2668
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 2078 transition count 2668
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 2077 transition count 2667
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 2077 transition count 2667
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 2076 transition count 2666
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 2076 transition count 2666
Applied a total of 91 rules in 956 ms. Remains 2076 /2119 variables (removed 43) and now considering 2666/2715 (removed 49) transitions.
// Phase 1: matrix 2666 rows 2076 cols
[2025-05-30 11:10:14] [INFO ] Computed 5 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:10:14] [INFO ] Implicit Places using invariants in 375 ms returned []
[2025-05-30 11:10:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:10:16] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 1938 ms to find 0 implicit places.
Running 2665 sub problems to find dead transitions.
[2025-05-30 11:10: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/2075 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2075/4742 variables, and 5 constraints, problems are : Problem set: 0 solved, 2665 unsolved in 30049 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2076 constraints, PredecessorRefiner: 2665/2665 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2665 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2075 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2075/4742 variables, and 5 constraints, problems are : Problem set: 0 solved, 2665 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2076 constraints, PredecessorRefiner: 0/2665 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60703ms problems are : Problem set: 0 solved, 2665 unsolved
Search for dead transitions found 0 dead transitions in 60707ms
Starting structural reductions in LTL mode, iteration 1 : 2076/2119 places, 2666/2715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63609 ms. Remains : 2076/2119 places, 2666/2715 transitions.
Stuttering acceptance computed with spot in 447 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p0 p1), (AND p1 (NOT p3)), p1, (AND p0 p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-01
Product exploration explored 100000 steps with 546 reset in 202 ms.
Product exploration explored 100000 steps with 555 reset in 216 ms.
Computed a total of 33 stabilizing places and 36 stable transitions
Graph (complete) has 2901 edges and 2076 vertex of which 2065 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.8 ms
Computed a total of 33 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) p3), (X p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 132 ms. Reduced automaton from 9 states, 21 edges and 4 AP (stutter sensitive) to 9 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 438 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p0 p1), (AND p1 (NOT p3)), p1, (AND p0 p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
RANDOM walk for 40000 steps (220 resets) in 407 ms. (98 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (51 resets) in 113 ms. (350 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (50 resets) in 99 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (54 resets) in 117 ms. (339 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (48 resets) in 88 ms. (449 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (26 resets) in 35 ms. (1111 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (25 resets) in 34 ms. (1142 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (24 resets) in 36 ms. (1081 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (49 resets) in 52 ms. (754 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (28 resets) in 35 ms. (1111 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (28 resets) in 34 ms. (1142 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (25 resets) in 53 ms. (740 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (52 resets) in 62 ms. (634 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (51 resets) in 56 ms. (701 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (26 resets) in 38 ms. (1025 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 197438 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 14
Probabilistic random walk after 197438 steps, saw 51186 distinct states, run finished after 3007 ms. (steps per millisecond=65 ) properties seen :0
[2025-05-30 11:11:21] [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, 14 unsolved
At refinement iteration 1 (OVERLAPS) 2058/2063 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2063 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 2654/4717 variables, 2063/2068 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4717 variables, 0/2068 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/4719 variables, 1/2069 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4719 variables, 0/2069 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 2/4721 variables, 1/2070 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4721/4742 variables, and 2070 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5021 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2065/2076 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 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, 14 unsolved
At refinement iteration 1 (OVERLAPS) 2058/2063 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2063 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 2654/4717 variables, 2063/2068 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4717 variables, 14/2082 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4717 variables, 0/2082 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 2/4719 variables, 1/2083 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4719/4742 variables, and 2083 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5021 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2064/2076 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10063ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 2076 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2076/2076 places, 2666/2666 transitions.
Graph (trivial) has 2535 edges and 2076 vertex of which 972 / 2076 are part of one of the 87 SCC in 5 ms
Free SCC test removed 885 places
Drop transitions (Empty/Sink Transition effects.) removed 1124 transitions
Reduce isomorphic transitions removed 1124 transitions.
Graph (complete) has 1770 edges and 1191 vertex of which 1180 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 658 transitions
Trivial Post-agglo rules discarded 658 transitions
Performed 658 trivial Post agglomeration. Transition count delta: 658
Iterating post reduction 0 with 666 rules applied. Total rules applied 668 place count 1180 transition count 871
Reduce places removed 658 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 1 with 747 rules applied. Total rules applied 1415 place count 522 transition count 782
Reduce places removed 58 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 63 rules applied. Total rules applied 1478 place count 464 transition count 777
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1483 place count 459 transition count 777
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 68 Pre rules applied. Total rules applied 1483 place count 459 transition count 709
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 1619 place count 391 transition count 709
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1633 place count 377 transition count 689
Iterating global reduction 4 with 14 rules applied. Total rules applied 1647 place count 377 transition count 689
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1650 place count 377 transition count 686
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1653 place count 374 transition count 686
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1664 place count 363 transition count 672
Iterating global reduction 6 with 11 rules applied. Total rules applied 1675 place count 363 transition count 672
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1683 place count 363 transition count 664
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1686 place count 360 transition count 646
Iterating global reduction 7 with 3 rules applied. Total rules applied 1689 place count 360 transition count 646
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1690 place count 360 transition count 645
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1691 place count 359 transition count 645
Performed 188 Post agglomeration using F-continuation condition with reduction of 128 identical transitions.
Deduced a syphon composed of 188 places in 0 ms
Reduce places removed 188 places and 0 transitions.
Iterating global reduction 9 with 376 rules applied. Total rules applied 2067 place count 171 transition count 329
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 17 rules applied. Total rules applied 2084 place count 171 transition count 312
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 2086 place count 170 transition count 311
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2090 place count 166 transition count 307
Iterating global reduction 11 with 4 rules applied. Total rules applied 2094 place count 166 transition count 307
Performed 16 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 32 rules applied. Total rules applied 2126 place count 150 transition count 288
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 2142 place count 150 transition count 272
Performed 46 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 12 with 92 rules applied. Total rules applied 2234 place count 104 transition count 312
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 12 with 36 rules applied. Total rules applied 2270 place count 104 transition count 276
Discarding 27 places :
Symmetric choice reduction at 13 with 27 rule applications. Total rules 2297 place count 77 transition count 222
Iterating global reduction 13 with 27 rules applied. Total rules applied 2324 place count 77 transition count 222
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 13 with 14 rules applied. Total rules applied 2338 place count 77 transition count 208
Discarding 8 places :
Symmetric choice reduction at 14 with 8 rule applications. Total rules 2346 place count 69 transition count 192
Iterating global reduction 14 with 8 rules applied. Total rules applied 2354 place count 69 transition count 192
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 2362 place count 69 transition count 184
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 15 with 5 rules applied. Total rules applied 2367 place count 69 transition count 179
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 2368 place count 69 transition count 179
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 2371 place count 69 transition count 179
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 2372 place count 68 transition count 178
Applied a total of 2372 rules in 83 ms. Remains 68 /2076 variables (removed 2008) and now considering 178/2666 (removed 2488) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 68/2076 places, 178/2666 transitions.
RANDOM walk for 40000 steps (3575 resets) in 247 ms. (161 steps per ms) remains 6/14 properties
BEST_FIRST walk for 40002 steps (683 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (425 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (675 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (416 resets) in 29 ms. (1333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (427 resets) in 44 ms. (888 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (419 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
[2025-05-30 11:11:32] [INFO ] Flow matrix only has 160 transitions (discarded 18 similar events)
// Phase 1: matrix 160 rows 68 cols
[2025-05-30 11:11:32] [INFO ] Computed 4 invariants in 0 ms
[2025-05-30 11:11:32] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 52/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 155/212 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 16/228 variables, 11/73 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/228 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 78 constraints, problems are : Problem set: 0 solved, 6 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 52/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 155/212 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 16/228 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/228 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 84 constraints, problems are : Problem set: 0 solved, 6 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 578ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 61 steps, including 2 resets, run visited all 6 properties in 2 ms. (steps per millisecond=30 )
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 6 properties in 3 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1) p3), (X p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p3))), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p0 p2))), (F p1), (F (NOT (OR (NOT p0) (NOT p1) p3))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p3))), (F (NOT p3)), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p1) (NOT p2) p3)))]
Knowledge based reduction with 14 factoid took 611 ms. Reduced automaton from 9 states, 21 edges and 4 AP (stutter sensitive) to 9 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 435 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p0 p1), (AND p1 (NOT p3)), p1, (AND p0 p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 465 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p0 p1), (AND p1 (NOT p3)), p1, (AND p0 p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Support contains 5 out of 2076 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2076/2076 places, 2666/2666 transitions.
Applied a total of 0 rules in 77 ms. Remains 2076 /2076 variables (removed 0) and now considering 2666/2666 (removed 0) transitions.
// Phase 1: matrix 2666 rows 2076 cols
[2025-05-30 11:11:34] [INFO ] Computed 5 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:11:34] [INFO ] Implicit Places using invariants in 303 ms returned []
[2025-05-30 11:11:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:11:36] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 1835 ms to find 0 implicit places.
Running 2665 sub problems to find dead transitions.
[2025-05-30 11:11:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 1.0)
(s460 1.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 1.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 1.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 1.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 1.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 1.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 1.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 0.0)
(s1216 1.0)
(s1217 0.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 1.0)
(s1228 1.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 1.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 1.0)
(s1258 1.0)
(s1259 0.0)
(s1260 1.0)
(s1261 0.0)
(s1262 0.0)
(s1263 1.0)
(s1264 1.0)
(s1265 0.0)
(s1266 1.0)
(s1267 1.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 1.0)
(s1275 1.0)
(s1276 0.0)
(s1277 1.0)
(s1278 0.0)
(s1279 0.0)
(s1280 1.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 1.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 1.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 0.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 0.0)
(s1539 0.0)
(s1540 0.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 0.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 0.0)
(s1581 0.0)
(s1582 0.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 0.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 0.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 0.0)
(s1601 0.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
timeout
(s1609 0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2075 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2075/4742 variables, and 5 constraints, problems are : Problem set: 0 solved, 2665 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2076 constraints, PredecessorRefiner: 2665/2665 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2665 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2075 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2075/4742 variables, and 5 constraints, problems are : Problem set: 0 solved, 2665 unsolved in 30048 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2076 constraints, PredecessorRefiner: 0/2665 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60706ms problems are : Problem set: 0 solved, 2665 unsolved
Search for dead transitions found 0 dead transitions in 60711ms
Finished structural reductions in LTL mode , in 1 iterations and 62632 ms. Remains : 2076/2076 places, 2666/2666 transitions.
Computed a total of 33 stabilizing places and 36 stable transitions
Graph (complete) has 2901 edges and 2076 vertex of which 2065 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.7 ms
Computed a total of 33 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) p3), (X p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 146 ms. Reduced automaton from 9 states, 21 edges and 4 AP (stutter sensitive) to 9 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 437 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p0 p1), (AND p1 (NOT p3)), p1, (AND p0 p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
RANDOM walk for 40000 steps (215 resets) in 316 ms. (126 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (51 resets) in 53 ms. (740 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (45 resets) in 98 ms. (404 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (44 resets) in 49 ms. (800 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (49 resets) in 49 ms. (800 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (26 resets) in 35 ms. (1111 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (26 resets) in 34 ms. (1142 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (26 resets) in 36 ms. (1081 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (52 resets) in 50 ms. (784 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (26 resets) in 32 ms. (1212 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (23 resets) in 34 ms. (1142 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (28 resets) in 34 ms. (1142 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (51 resets) in 48 ms. (816 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (48 resets) in 90 ms. (439 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (26 resets) in 35 ms. (1111 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 225054 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 14
Probabilistic random walk after 225054 steps, saw 57727 distinct states, run finished after 3003 ms. (steps per millisecond=74 ) properties seen :0
[2025-05-30 11:12:40] [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, 14 unsolved
At refinement iteration 1 (OVERLAPS) 2058/2063 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2063 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 2654/4717 variables, 2063/2068 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4717 variables, 0/2068 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/4719 variables, 1/2069 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4719 variables, 0/2069 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 2/4721 variables, 1/2070 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4721 variables, 0/2070 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SMT process timed out in 5037ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 2076 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2076/2076 places, 2666/2666 transitions.
Graph (trivial) has 2535 edges and 2076 vertex of which 972 / 2076 are part of one of the 87 SCC in 2 ms
Free SCC test removed 885 places
Drop transitions (Empty/Sink Transition effects.) removed 1124 transitions
Reduce isomorphic transitions removed 1124 transitions.
Graph (complete) has 1770 edges and 1191 vertex of which 1180 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 658 transitions
Trivial Post-agglo rules discarded 658 transitions
Performed 658 trivial Post agglomeration. Transition count delta: 658
Iterating post reduction 0 with 666 rules applied. Total rules applied 668 place count 1180 transition count 871
Reduce places removed 658 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 1 with 747 rules applied. Total rules applied 1415 place count 522 transition count 782
Reduce places removed 58 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 63 rules applied. Total rules applied 1478 place count 464 transition count 777
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1483 place count 459 transition count 777
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 68 Pre rules applied. Total rules applied 1483 place count 459 transition count 709
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 1619 place count 391 transition count 709
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1633 place count 377 transition count 689
Iterating global reduction 4 with 14 rules applied. Total rules applied 1647 place count 377 transition count 689
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1650 place count 377 transition count 686
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1653 place count 374 transition count 686
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1664 place count 363 transition count 672
Iterating global reduction 6 with 11 rules applied. Total rules applied 1675 place count 363 transition count 672
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1683 place count 363 transition count 664
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1686 place count 360 transition count 646
Iterating global reduction 7 with 3 rules applied. Total rules applied 1689 place count 360 transition count 646
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 1690 place count 360 transition count 645
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1691 place count 359 transition count 645
Performed 188 Post agglomeration using F-continuation condition with reduction of 128 identical transitions.
Deduced a syphon composed of 188 places in 0 ms
Reduce places removed 188 places and 0 transitions.
Iterating global reduction 9 with 376 rules applied. Total rules applied 2067 place count 171 transition count 329
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 17 rules applied. Total rules applied 2084 place count 171 transition count 312
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 2086 place count 170 transition count 311
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 2090 place count 166 transition count 307
Iterating global reduction 11 with 4 rules applied. Total rules applied 2094 place count 166 transition count 307
Performed 16 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 32 rules applied. Total rules applied 2126 place count 150 transition count 288
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 2142 place count 150 transition count 272
Performed 46 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 12 with 92 rules applied. Total rules applied 2234 place count 104 transition count 312
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 12 with 36 rules applied. Total rules applied 2270 place count 104 transition count 276
Discarding 27 places :
Symmetric choice reduction at 13 with 27 rule applications. Total rules 2297 place count 77 transition count 222
Iterating global reduction 13 with 27 rules applied. Total rules applied 2324 place count 77 transition count 222
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 13 with 14 rules applied. Total rules applied 2338 place count 77 transition count 208
Discarding 8 places :
Symmetric choice reduction at 14 with 8 rule applications. Total rules 2346 place count 69 transition count 192
Iterating global reduction 14 with 8 rules applied. Total rules applied 2354 place count 69 transition count 192
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 2362 place count 69 transition count 184
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 15 with 5 rules applied. Total rules applied 2367 place count 69 transition count 179
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 2368 place count 69 transition count 179
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 2371 place count 69 transition count 179
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 2372 place count 68 transition count 178
Applied a total of 2372 rules in 65 ms. Remains 68 /2076 variables (removed 2008) and now considering 178/2666 (removed 2488) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 68/2076 places, 178/2666 transitions.
RANDOM walk for 40000 steps (3548 resets) in 215 ms. (185 steps per ms) remains 7/14 properties
BEST_FIRST walk for 40003 steps (684 resets) in 40 ms. (975 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (660 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (429 resets) in 59 ms. (666 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (672 resets) in 44 ms. (888 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (422 resets) in 37 ms. (1052 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (418 resets) in 39 ms. (1000 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (416 resets) in 39 ms. (1000 steps per ms) remains 7/7 properties
[2025-05-30 11:12:46] [INFO ] Flow matrix only has 160 transitions (discarded 18 similar events)
// Phase 1: matrix 160 rows 68 cols
[2025-05-30 11:12:46] [INFO ] Computed 4 invariants in 0 ms
[2025-05-30 11:12:46] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 52/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 155/212 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 16/228 variables, 11/73 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/228 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 78 constraints, problems are : Problem set: 0 solved, 7 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 52/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 155/212 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 16/228 variables, 11/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/228 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 85 constraints, problems are : Problem set: 0 solved, 7 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 694ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 7 properties in 2 ms. (steps per millisecond=10 )
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 7 properties in 2 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1) p3), (X p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p3))), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p0 p2))), (F p1), (F (NOT (OR (NOT p0) (NOT p1) p3))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p3))), (F (NOT p3)), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p1) (NOT p2) p3)))]
Knowledge based reduction with 14 factoid took 639 ms. Reduced automaton from 9 states, 21 edges and 4 AP (stutter sensitive) to 9 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 457 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p0 p1), (AND p1 (NOT p3)), p1, (AND p0 p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 438 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p0 p1), (AND p1 (NOT p3)), p1, (AND p0 p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 441 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p0 p1), (AND p1 (NOT p3)), p1, (AND p0 p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Product exploration explored 100000 steps with 550 reset in 195 ms.
Product exploration explored 100000 steps with 543 reset in 316 ms.
Applying partial POR strategy [false, false, true, false, true, true, false, true, true]
Stuttering acceptance computed with spot in 446 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p0 p1), (AND p1 (NOT p3)), p1, (AND p0 p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Support contains 5 out of 2076 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2076/2076 places, 2666/2666 transitions.
Graph (trivial) has 2535 edges and 2076 vertex of which 972 / 2076 are part of one of the 87 SCC in 2 ms
Free SCC test removed 885 places
Ensure Unique test removed 1036 transitions
Reduce isomorphic transitions removed 1036 transitions.
Graph (complete) has 1857 edges and 1191 vertex of which 1180 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 639 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 639 rules applied. Total rules applied 641 place count 1180 transition count 1624
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 656 place count 1180 transition count 1609
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 656 place count 1180 transition count 1627
Deduced a syphon composed of 669 places in 1 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 686 place count 1180 transition count 1627
Discarding 381 places :
Symmetric choice reduction at 2 with 381 rule applications. Total rules 1067 place count 799 transition count 1233
Deduced a syphon composed of 309 places in 1 ms
Iterating global reduction 2 with 381 rules applied. Total rules applied 1448 place count 799 transition count 1233
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1465 place count 782 transition count 1210
Deduced a syphon composed of 306 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1482 place count 782 transition count 1210
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1490 place count 782 transition count 1202
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1507 place count 765 transition count 1185
Deduced a syphon composed of 292 places in 0 ms
Iterating global reduction 3 with 17 rules applied. Total rules applied 1524 place count 765 transition count 1185
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1527 place count 762 transition count 1179
Deduced a syphon composed of 292 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1530 place count 762 transition count 1179
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1533 place count 759 transition count 1173
Deduced a syphon composed of 292 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1536 place count 759 transition count 1173
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1542 place count 753 transition count 1167
Deduced a syphon composed of 289 places in 1 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 1548 place count 753 transition count 1167
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1551 place count 750 transition count 1161
Deduced a syphon composed of 289 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1554 place count 750 transition count 1161
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1557 place count 747 transition count 1155
Deduced a syphon composed of 289 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1560 place count 747 transition count 1155
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1566 place count 741 transition count 1149
Deduced a syphon composed of 286 places in 1 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 1572 place count 741 transition count 1149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1575 place count 738 transition count 1143
Deduced a syphon composed of 286 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1578 place count 738 transition count 1143
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1581 place count 735 transition count 1137
Deduced a syphon composed of 286 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1584 place count 735 transition count 1137
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1590 place count 729 transition count 1128
Deduced a syphon composed of 283 places in 1 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 1596 place count 729 transition count 1128
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1602 place count 723 transition count 1104
Deduced a syphon composed of 280 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 1608 place count 723 transition count 1104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 3 with 1 rules applied. Total rules applied 1609 place count 723 transition count 1104
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1615 place count 717 transition count 1098
Deduced a syphon composed of 278 places in 1 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1621 place count 717 transition count 1098
Performed 139 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 417 places in 0 ms
Iterating global reduction 4 with 139 rules applied. Total rules applied 1760 place count 717 transition count 1201
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 53 rules applied. Total rules applied 1813 place count 717 transition count 1148
Discarding 130 places :
Symmetric choice reduction at 5 with 130 rule applications. Total rules 1943 place count 587 transition count 1005
Deduced a syphon composed of 300 places in 1 ms
Iterating global reduction 5 with 130 rules applied. Total rules applied 2073 place count 587 transition count 1005
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 2081 place count 579 transition count 993
Deduced a syphon composed of 292 places in 0 ms
Iterating global reduction 5 with 8 rules applied. Total rules applied 2089 place count 579 transition count 993
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 301 places in 1 ms
Iterating global reduction 5 with 9 rules applied. Total rules applied 2098 place count 579 transition count 993
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 2105 place count 579 transition count 986
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 2125 place count 559 transition count 961
Deduced a syphon composed of 286 places in 0 ms
Iterating global reduction 6 with 20 rules applied. Total rules applied 2145 place count 559 transition count 961
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2153 place count 559 transition count 953
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2158 place count 554 transition count 948
Deduced a syphon composed of 281 places in 1 ms
Iterating global reduction 7 with 5 rules applied. Total rules applied 2163 place count 554 transition count 948
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 284 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 2166 place count 554 transition count 948
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 2172 place count 554 transition count 942
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 2175 place count 551 transition count 939
Deduced a syphon composed of 281 places in 1 ms
Iterating global reduction 8 with 3 rules applied. Total rules applied 2178 place count 551 transition count 939
Performed 94 Post agglomeration using F-continuation condition with reduction of 158 identical transitions.
Deduced a syphon composed of 375 places in 0 ms
Iterating global reduction 8 with 94 rules applied. Total rules applied 2272 place count 551 transition count 1372
Ensure Unique test removed 161 transitions
Reduce isomorphic transitions removed 161 transitions.
Iterating post reduction 8 with 161 rules applied. Total rules applied 2433 place count 551 transition count 1211
Discarding 166 places :
Symmetric choice reduction at 9 with 166 rule applications. Total rules 2599 place count 385 transition count 767
Deduced a syphon composed of 220 places in 1 ms
Iterating global reduction 9 with 166 rules applied. Total rules applied 2765 place count 385 transition count 767
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 9 with 14 rules applied. Total rules applied 2779 place count 385 transition count 753
Discarding 29 places :
Symmetric choice reduction at 10 with 29 rule applications. Total rules 2808 place count 356 transition count 696
Deduced a syphon composed of 191 places in 1 ms
Iterating global reduction 10 with 29 rules applied. Total rules applied 2837 place count 356 transition count 696
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 195 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2841 place count 356 transition count 768
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2845 place count 352 transition count 728
Deduced a syphon composed of 191 places in 1 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2849 place count 352 transition count 728
Deduced a syphon composed of 191 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 10 with 74 rules applied. Total rules applied 2923 place count 352 transition count 654
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 2930 place count 345 transition count 647
Deduced a syphon composed of 184 places in 0 ms
Iterating global reduction 10 with 7 rules applied. Total rules applied 2937 place count 345 transition count 647
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 188 places in 0 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2941 place count 345 transition count 727
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2945 place count 341 transition count 707
Deduced a syphon composed of 184 places in 1 ms
Iterating global reduction 10 with 4 rules applied. Total rules applied 2949 place count 341 transition count 707
Deduced a syphon composed of 184 places in 0 ms
Applied a total of 2949 rules in 636 ms. Remains 341 /2076 variables (removed 1735) and now considering 707/2666 (removed 1959) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:12:50] [INFO ] Redundant transitions in 40 ms returned []
Running 706 sub problems to find dead transitions.
[2025-05-30 11:12:50] [INFO ] Flow matrix only has 631 transitions (discarded 76 similar events)
// Phase 1: matrix 631 rows 341 cols
[2025-05-30 11:12:50] [INFO ] Computed 0 invariants in 4 ms
[2025-05-30 11:12:50] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/340 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 706 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 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 TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
At refinement iteration 1 (OVERLAPS) 630/970 variables, 340/340 constraints. Problems are: Problem set: 343 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/970 variables, 2/342 constraints. Problems are: Problem set: 343 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/970 variables, 0/342 constraints. Problems are: Problem set: 343 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 1/971 variables, 1/343 constraints. Problems are: Problem set: 343 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 971/972 variables, and 343 constraints, problems are : Problem set: 343 solved, 363 unsolved in 30015 ms.
Refiners :[State Equation: 341/341 constraints, ReadFeed: 2/3 constraints, PredecessorRefiner: 706/706 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 343 solved, 363 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 343 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 626/782 variables, 156/156 constraints. Problems are: Problem set: 343 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/782 variables, 2/158 constraints. Problems are: Problem set: 343 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/782 variables, 363/521 constraints. Problems are: Problem set: 343 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/782 variables, 0/521 constraints. Problems are: Problem set: 343 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 189/971 variables, 185/706 constraints. Problems are: Problem set: 343 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 971/972 variables, and 706 constraints, problems are : Problem set: 343 solved, 363 unsolved in 30021 ms.
Refiners :[State Equation: 341/341 constraints, ReadFeed: 2/3 constraints, PredecessorRefiner: 363/706 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60208ms problems are : Problem set: 343 solved, 363 unsolved
Search for dead transitions found 343 dead transitions in 60210ms
Found 343 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 343 transitions
Dead transitions reduction (with SMT) removed 343 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 341/2076 places, 364/2666 transitions.
Graph (complete) has 565 edges and 341 vertex of which 157 are kept as prefixes of interest. Removing 184 places using SCC suffix rule.1 ms
Discarding 184 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 157 /341 variables (removed 184) and now considering 364/364 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 157/2076 places, 364/2666 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60903 ms. Remains : 157/2076 places, 364/2666 transitions.
Built C files in :
/tmp/ltsmin17067023338809509426
[2025-05-30 11:13:50] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17067023338809509426
Running compilation step : cd /tmp/ltsmin17067023338809509426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17067023338809509426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17067023338809509426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 2076 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2076/2076 places, 2666/2666 transitions.
Applied a total of 0 rules in 93 ms. Remains 2076 /2076 variables (removed 0) and now considering 2666/2666 (removed 0) transitions.
// Phase 1: matrix 2666 rows 2076 cols
[2025-05-30 11:13:54] [INFO ] Computed 5 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:13:54] [INFO ] Implicit Places using invariants in 349 ms returned []
[2025-05-30 11:13:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:13:55] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 1820 ms to find 0 implicit places.
Running 2665 sub problems to find dead transitions.
[2025-05-30 11:13:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2075 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2075/4742 variables, and 5 constraints, problems are : Problem set: 0 solved, 2665 unsolved in 30047 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2076 constraints, PredecessorRefiner: 2665/2665 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2665 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2075 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 0)
(s15 1)
(s16 1)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 1)
(s24 0)
(s25 1)
(s26 1)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 1)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 1)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 1)
(s451 1)
(s452 1)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 1)
(s460 1)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 1)
(s467 1)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 1)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 1)
(s511 1)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 1)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 1)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 1)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 1)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 1)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 0)
(s1094 0)
(s1095 0)
(s1096 0)
(s1097 0)
(s1098 0)
(s1099 0)
(s1100 0)
(s1101 0)
(s1102 0)
(s1103 0)
(s1104 0)
(s1105 0)
(s1106 0)
(s1107 0)
(s1108 0)
(s1109 0)
(s1110 0)
(s1111 0)
(s1112 0)
(s1113 0)
(s1114 0)
(s1115 0)
(s1116 0)
(s1117 0)
(s1118 0)
(s1119 0)
(s1120 0)
(s1121 0)
(s1122 0)
(s1123 0)
(s1124 0)
(s1125 0)
(s1126 0)
(s1127 0)
(s1128 0)
(s1129 0)
(s1130 0)
(s1131 0)
(s1132 0)
(s1133 0)
(s1134 0)
(s1135 0)
(s1136 0)
(s1137 0)
(s1138 0)
(s1139 0)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 0)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 0)
(s1149 0)
(s1150 0)
(s1151 0)
(s1152 0)
(s1153 0)
(s1154 0)
(s1155 0)
(s1156 0)
(s1157 0)
(s1158 0)
(s1159 0)
(s1160 0)
(s1161 0)
(s1162 0)
(s1163 0)
(s1164 0)
(s1165 0)
(s1166 0)
(s1167 0)
(s1168 0)
(s1169 0)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 0)
(s1175 0)
(s1176 1)
(s1177 1)
(s1178 0)
(s1179 1)
(s1180 0)
(s1181 1)
(s1182 0)
(s1183 0)
(s1184 1)
(s1185 0)
(s1186 0)
(s1187 0)
(s1188 0)
(s1189 0)
(s1190 0)
(s1191 0)
(s1192 0)
(s1193 0)
(s1194 0)
(s1195 1)
(s1196 0)
(s1197 0)
(s1198 0)
(s1199 0)
(s1200 1)
(s1201 1)
(s1202 0)
(s1203 0)
(s1204 0)
(s1205 0)
(s1206 0)
(s1207 0)
(s1208 0)
(s1209 0)
(s1210 0)
(s1211 0)
(s1212 0)
(s1213 0)
(s1214 0)
(s1215 0)
(s1216 0)
(s1217 0)
(s1218 0)
(s1219 0)
(s1220 0)
(s1221 0)
(s1222 0)
(s1223 0)
(s1224 0)
(s1225 0)
(s1226 0)
(s1227 0)
(s1228 0)
(s1229 0)
(s1230 0)
(s1231 0)
(s1232 0)
(s1233 0)
(s1234 0)
(s1235 0)
(s1236 0)
(s1237 0)
(s1238 0)
(s1239 0)
(s1240 0)
(s1241 0)
(s1242 0)
(s1243 0)
(s1244 0)
(s1245 0)
(s1246 0)
(s1247 0)
(s1248 0)
(s1249 0)
(s1250 0)
(s1251 0)
(s1252 0)
(s1253 0)
(s1254 0)
(s1255 0)
(s1256 0)
(s1257 1)
(s1258 1)
(s1259 0)
(s1260 1)
(s1261 0)
(s1262 0)
(s1263 1)
(s1264 1)
(s1265 0)
(s1266 1)
(s1267 1)
(s1268 0)
(s1269 0)
(s1270 0)
(s1271 0)
(s1272 0)
(s1273 0)
(s1274 1)
(s1275 1)
(s1276 0)
(s1277 1)
(s1278 0)
(s1279 0)
(s1280 1)
(s1281 0)
(s1282 0)
(s1283 0)
(s1284 0)
(s1285 0)
(s1286 0)
(s1287 0)
(s1288 0)
(s1289 0)
(s1290 0)
(s1291 0)
(s1292 1)
(s1293 0)
(s1294 0)
(s1295 0)
(s1296 0)
(s1297 1)
(s1298 0)
(s1299 0)
(s1300 0)
(s1301 0)
(s1302 0)
(s1303 0)
(s1304 0)
(s1305 0)
(s1306 0)
(s1307 0)
(s1308 0)
(s1309 0)
(s1310 0)
(s1311 0)
(s1312 0)
(s1313 0)
(s1314 0)
(s1315 0)
(s1316 0)
(s1317 0)
(s1318 0)
(s1319 0)
(s1320 0)
(s1321 0)
(s1322 0)
(s1323 0)
(s1324 0)
(s1325 0)
(s1326 0)
(s1327 0)
(s1328 0)
(s1329 0)
(s1330 0)
(s1331 0)
(s1332 0)
(s1333 0)
(s1334 0)
(s1335 0)
(s1336 0)
(s1337 0)
(s1338 0)
(s1339 0)
(s1340 0)
(s1341 0)
(s1342 0)
(s1343 0)
(s1344 0)
(s1345 0)
(s1346 0)
(s1347 0)
(s1348 0)
(s1349 0)
(s1350 0)
(s1351 0)
(s1352 0)
(s1353 0)
(s1354 0)
(s1355 0)
(s1356 0)
(s1357 0)
(s1358 0)
(s1359 0)
(s1360 0)
(s1361 0)
(s1362 0)
(s1363 0)
(s1364 0)
(s1365 0)
(s1366 0)
(s1367 0)
(s1368 0)
(s1369 0)
(s1370 0)
(s1371 0)
(s1372 0)
(s1373 0)
(s1374 0)
(s1375 0)
(s1376 0)
(s1377 0)
(s1378 0)
(s1379 0)
(s1380 0)
(s1381 0)
(s1382 0)
(s1383 0)
(s1384 0)
(s1385 0)
(s1386 0)
(s1387 0)
(s1388 0)
(s1389 0)
(s1390 0)
(s1391 0)
(s1392 0)
(s1393 0)
(s1394 0)
(s1395 0)
(s1396 0)
(s1397 0)
(s1398 0)
(s1399 0)
(s1400 0)
(s1401 0)
(s1402 0)
(s1403 0)
(s1404 0)
(s1405 0)
(s1406 0)
(s1407 0)
(s1408 0)
(s1409 0)
(s1410 0)
(s1411 0)
(s1412 0)
(s1413 0)
(s1414 0)
(s1415 0)
(s1416 0)
(s1417 0)
(s1418 0)
(s1419 0)
(s1420 0)
(s1421 0)
(s1422 0)
(s1423 0)
(s1424 0)
(s1425 0)
(s1426 0)
(s1427 0)
(s1428 0)
(s1429 0)
(s1430 0)
(s1431 0)
(s1432 0)
(s1433 0)
(s1434 0)
(s1435 0)
(s1436 0)
(s1437 0)
(s1438 0)
(s1439 0)
(s1440 0)
(s1441 0)
(s1442 0)
(s1443 0)
(s1444 0)
(s1445 0)
(s1446 0)
(s1447 0)
(s1448 0)
(s1449 0)
(s1450 0)
(s1451 0)
(s1452 0)
(s1453 0)
(s1454 0)
(s1455 0)
(s1456 0)
(s1457 0)
(s1458 0)
(s1459 0)
(s1460 0)
(s1461 0)
(s1462 0)
(s1463 0)
(s1464 0)
(s1465 0)
(s1466 0)
(s1467 0)
(s1468 0)
(s1469 0)
(s1470 0)
(s1471 0)
(s1472 0)
(s1473 0)
(s1474 0)
(s1475 0)
(s1476 0)
(s1477 0)
(s1478 0)
(s1479 0)
(s1480 0)
(s1481 0)
(s1482 0)
(s1483 0)
(s1484 0)
(s1485 0)
(s1486 0)
(s1487 0)
(s1488 0)
(s1489 0)
(s1490 0)
(s1491 0)
(s1492 0)
(s1493 0)
(s1494 0)
(s1495 0)
(s1496 0)
(s1497 0)
(s1498 0)
(s1499 0)
(s1500 0)
(s1501 0)
(s1502 0)
(s1503 0)
(s1504 0)
(s1505 0)
(s1506 0)
(s1507 0)
(s1508 0)
(s1509 0)
(s1510 0)
(s1511 0)
(s1512 0)
(s1513 0)
(s1514 0)
(s1515 0)
(s1516 0)
(s1517 0)
(s1518 0)
(s1519 0)
(s1520 0)
(s1521 0)
(s1522 0)
(s1523 0)
(s1524 0)
(s1525 0)
(s1526 0)
(s1527 0)
(s1528 0)
(s1529 0)
(s1530 0)
(s1531 0)
(s1532 0)
(s1533 0)
(s1534 0)
(s1535 0)
(s1536 0)
(s1537 0)
(s1538 0)
(s1539 0)
(s1540 0)
(s1541 0)
(s1542 0)
(s1543 0)
(s1544 0)
(s1545 0)
(s1546 0)
(s1547 0)
(s1548 0)
(s1549 0)
(s1550 0)
(s1551 0)
(s1552 0)
(s1553 0)
(s1554 0)
(s1555 0)
(s1556 0)
(s1557 0)
(s1558 0)
(s1559 0)
(s1560 0)
(s1561 0)
(s1562 0)
(s1563 0)
(s1564 0)
(s1565 0)
(s1566 0)
(s1567 0)
(s1568 0)
(s1569 0)
(s1570 0)
(s1571 0)
(s1572 0)
(s1573 0)
(s1574 0)
(s1575 0)
(s1576 0)
(s1577 0)
(s1578 0)
(s1579 0)
(s1580 0)
(s1581 0)
(s1582 0)
(s1583 0)
(s1584 0)
(s1585 0)
(s1586 0)
(s1587 0)
(s1588 0)
(s1589 0)
(s1590 0)
(s1591 0)
(s1592 0)
(s1593 0)
(s1594 0)
(s1595 0)
(s1596 0)
(s1597 0)
(s1598 0)
(s1599 0)
(s1600 0)
(s1601 0)
(s1602 0)
(s1603 0)
(s1604 0)
(s1605 0)
(s1606 0)
(s1607 0)
(s1608 0)
(s1609 0)
(s1610 0)
(s1611 0)
(s1612 0)
(s1613 0)
(s1614 0)
(s1615 0)
(s1616 0)
(s1617 0)
(s1618 0)
(s1619 0)
(s1620 0)
(s1621 0)
(s1622 0)
(s1623 0)
(s1624 0)
(s1625 0)
(s1626 0)
(s1627 0)
(s1628 0)
(s1629 0)
(s1630 0)
(s1631 0)
(s1632 0)
(s1633 0)
(s1634 0)
(s1635 0)
(s1636 0)
(s1637 0)
(s1638 0)
(s1639 0)
(s1640 0)
(s1641 0)
(s1642 0)
(s1643 0)
(s1644 0)
(s1645 0)
(s1646 0)
(s1647 0)
(s1648 0)
(s1649 0)
(s1650 0)
(s1651 0)
(s1652 0)
(s1653 0)
(s1654 0)
(s1655 0)
(s1656 0)
(s1657 0)
(s1658 0)
(s1659 0)
(s1660 0)
(s1661 1)
(s1662 1)
(s1663 1)
(s1664 1)
(s1665 0)
(s1666 0)
(s1667 1)
(s1668 1)
(s1669 0)
(s1670 1)
(s1671 0)
(s1672 0)
(s1673 0)
(s1674 0)
(s1675 0)
(s1676 0)
(s1677 0)
(s1678 1)
(s1679 0)
(s1680 1)
(s1681 0)
(s1682 0)
(s1683 0)
(s1684 0)
(s1685 0)
(s1686 0)
(s1687 0)
(s1688 0)
(s1689 0)
(s1690 0)
(s1691 0)
(s1692 1)
(s1693 0)
(s1694 1)
(s1695 1)
(s1696 0)
(s1697 0)
(s1698 0)
(s1699 1)
(s1700 0)
(s1701 0)
(s1702 0)
(s1703 0)
(s1704 0)
(s1705 0)
(s1706 0)
(s1707 0)
(s1708 0)
(s1709 0)
(s1710 0)
(s1711 0)
(s1712 0)
(s1713 0)
(s1714 0)
(s1715 0)
(s1716 0)
(s1717 0)
(s1718 0)
(s1719 0)
(s1720 0)
(s1721 0)
(s1722 0)
(s1723 0)
(s1724 0)
(s1725 0)
(s1726 0)
(s1727 0)
(s1728 0)
(s1729 0)
(s1730 0)
(s1731 0)
(s1732 0)
(s1733 0)
(s1734 0)
(s1735 0)
(s1736 0)
(s1737 0)
(s1738 1)
(s1739 0)
(s1740 0)
(s1741 0)
(s1742 0)
(s1743 0)
(s1744 0)
(s1745 0)
(s1746 0)
(s1747 0)
(s1748 0)
(s1749 0)
(s1750 0)
(s1751 0)
(s1752 0)
(s1753 0)
(s1754 0)
(s1755 0)
(s1756 0)
(s1757 0)
(s1758 0)
(s1759 0)
(s1760 0)
(s1761 0)
(s1762 0)
(s1763 0)
(s1764 0)
(s1765 0)
(s1766 0)
(s1767 0)
(s1768 0)
(s1769 0)
(s1770 0)
(s1771 0)
(s1772 0)
(s1773 0)
(s1774 0)
(s1775 0)
(s1776 0)
(s1777 0)
(s1778 0)
(s1779 0)
(s1780 0)
(s1781 0)
(s1782 0)
(s1783 0)
(s1784 0)
(s1785 0)
(s1786 0)
(s1787 0)
(s1788 0)
(s1789 0)
(s1790 0)
(s1791 0)
(s1792 0)
(s1793 0)
(s1794 0)
(s1795 0)
(s1796 0)
(s1797 0)
(s1798 0)
(s1799 0)
(s1800 0)
(s1801 0)
(s1802 0)
(s1803 0)
(s1804 0)
(s1805 0)
(s1806 0)
(s1807 0)
(s1808 0)
(s1809 0)
(s1810 0)
(s1811 0)
(s1812 0)
(s1813 0)
(s1814 0)
(s1815 0)
(s1816 0)
(s1817 0)
(s1818 0)
(s1819 0)
(s1820 0)
(s1821 0)
(s1822 0)
(s1823 0)
(s1824 0)
(s1825 0)
(s1826 0)
(s1827 0)
(s1828 0)
(s1829 0)
(s1830 0)
(s1831 0)
(s1832 0)
(s1833 0)
(s1834 0)
(s1835 0)
(s1836 0)
(s1837 0)
(s1838 0)
(s1839 0)
(s1840 0)
(s1841 0)
(s1842 0)
(s1843 0)
(s1844 0)
(s1845 0)
(s1846 0)
(s1847 0)
(s1848 0)
(s1849 0)
(s1850 0)
(s1851 0)
(s1852 0)
(s1853 0)
(s1854 0)
(s1855 0)
(s1856 0)
(s1857 0)
(s1858 0)
(s1859 0)
(s1860 0)
(s1861 0)
(s1862 0)
(s1863 0)
(s1864 0)
(s1865 0)
(s1866 0)
(s1867 0)
(s1868 0)
(s1869 0)
(s1870 0)
(s1871 0)
(s1872 0)
(s1873 0)
(s1874 0)
(s1875 0)
(s1876 0)
(s1877 0)
(s1878 0)
(s1879 0)
(s1880 0)
(s1881 0)
(s1882 0)
(s1883 0)
(s1884 0)
(s1885 0)
(s1886 0)
(s1887 0)
(s1888 0)
(s1889 0)
(s1890 0)
(s1891 0)
(s1892 0)
(s1893 0)
(s1894 0)
(s1895 0)
(s1896 0)
(s1897 0)
(s1898 0)
(s1899 0)
(s1900 0)
(s1901 0)
(s1902 0)
(s1903 0)
(s1904 0)
(s1905 0)
(s1906 0)
(s1907 0)
(s1908 0)
(s1909 0)
(s1910 0)
(s1911 0)
(s1912 0)
(s1913 0)
(s1914 0)
(s1915 0)
(s1916 0)
(s1917 0)
(s1918 0)
(s1919 0)
(s1920 0)
(s1921 0)
(s1922 0)
(s1923 0)
(s1924 0)
(s1925 0)
(s1926 0)
(s1927 0)
(s1928 0)
(s1929 0)
(s1930 0)
(s1931 0)
(s1932 0)
(s1933 0)
(s1934 0)
(s1935 0)
(s1936 0)
(s1937 0)
(s1938 0)
(s1939 0)
(s1940 0)
(s1941 0)
(s1942 0)
(s1943 0)
(s1944 0)
(s1945 0)
(s1946 0)
(s1947 0)
(s1948 0)
(s1949 0)
(s1950 0)
(s1951 0)
(s1952 0)
(s1953 0)
(s1954 0)
(s1955 0)
(s1956 0)
(s1957 0)
(s1958 0)
(s1959 0)
(s1960 0)
(s1961 0)
(s1962 0)
(s1963 0)
(s1964 0)
(s1965 0)
(s1966 0)
(s1967 0)
(s1968 0)
(s1969 0)
(s1970 0)
(s1971 0)
(s1972 0)
(s1973 0)
(s1974 0)
(s1975 0)
(s1976 0)
(s1977 0)
(s1978 0)
(s1979 0)
(s1980 0)
(s1981 0)
(s1982 0)
(s1983 0)
(s1984 0)
(s1985 0)
(s1986 0)
(s1987 0)
(s1988 0)
(s1989 0)
(s1990 0)
(s1991 0)
(s1992 0)
(s1993 0)
(s1994 0)
(s1995 0)
(s1996 0)
(s1997 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2075/4742 variables, and 5 constraints, problems are : Problem set: 0 solved, 2665 unsolved in 30053 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2076 constraints, PredecessorRefiner: 0/2665 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60740ms problems are : Problem set: 0 solved, 2665 unsolved
Search for dead transitions found 0 dead transitions in 60743ms
Finished structural reductions in LTL mode , in 1 iterations and 62666 ms. Remains : 2076/2076 places, 2666/2666 transitions.
Built C files in :
/tmp/ltsmin15501713801095664115
[2025-05-30 11:14:56] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15501713801095664115
Running compilation step : cd /tmp/ltsmin15501713801095664115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15501713801095664115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15501713801095664115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 11:14:59] [INFO ] Flatten gal took : 50 ms
[2025-05-30 11:14:59] [INFO ] Flatten gal took : 62 ms
[2025-05-30 11:14:59] [INFO ] Time to serialize gal into /tmp/LTL16529372348177298959.gal : 9 ms
[2025-05-30 11:14:59] [INFO ] Time to serialize properties into /tmp/LTL15383167047280779385.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16529372348177298959.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17964673903104389869.hoa' '-atoms' '/tmp/LTL15383167047280779385.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...320
Loading property file /tmp/LTL15383167047280779385.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17964673903104389869.hoa
Detected timeout of ITS tools.
[2025-05-30 11:15:14] [INFO ] Flatten gal took : 50 ms
[2025-05-30 11:15:15] [INFO ] Flatten gal took : 41 ms
[2025-05-30 11:15:15] [INFO ] Time to serialize gal into /tmp/LTL387300558652048580.gal : 8 ms
[2025-05-30 11:15:15] [INFO ] Time to serialize properties into /tmp/LTL6579376456847229826.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/LTL387300558652048580.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6579376456847229826.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...274
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p1526==0)")||(F((G(F((G(F("((p872!=1)||(p2153!=1))")))||(("(p3152!=1)")&&(F("((p872!=1)||(p2153!=1))"))))))||((F((G(F("((p87...258
Formula 0 simplified : XF(!"(p1526==0)" & G(FG!"((p872!=1)||(p2153!=1))" & (G(FG!"((p872!=1)||(p2153!=1))" & (!"(p3152!=1)" | G!"((p872!=1)||(p2153!=1))"))...176
Detected timeout of ITS tools.
[2025-05-30 11:15:30] [INFO ] Flatten gal took : 41 ms
[2025-05-30 11:15:30] [INFO ] Applying decomposition
[2025-05-30 11:15:30] [INFO ] Flatten gal took : 38 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/graph13858945033971852125.txt' '-o' '/tmp/graph13858945033971852125.bin' '-w' '/tmp/graph13858945033971852125.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13858945033971852125.bin' '-l' '-1' '-v' '-w' '/tmp/graph13858945033971852125.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:15:30] [INFO ] Decomposing Gal with order
[2025-05-30 11:15:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:15:30] [INFO ] Removed a total of 687 redundant transitions.
[2025-05-30 11:15:30] [INFO ] Flatten gal took : 94 ms
[2025-05-30 11:15:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 34 ms.
[2025-05-30 11:15:30] [INFO ] Time to serialize gal into /tmp/LTL10784979765860271017.gal : 23 ms
[2025-05-30 11:15:30] [INFO ] Time to serialize properties into /tmp/LTL2640827167105441316.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/LTL10784979765860271017.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2640827167105441316.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i18.i4.i5.u335.p1526==0)")||(F((G(F((G(F("((i10.i0.i0.u167.p872!=1)||(i26.i4.i0.u498.p2153!=1))")))||(("(i40.u762.p3152!=1)"...426
Formula 0 simplified : XF(!"(i18.i4.i5.u335.p1526==0)" & G(FG!"((i10.i0.i0.u167.p872!=1)||(i26.i4.i0.u498.p2153!=1))" & (G(FG!"((i10.i0.i0.u167.p872!=1)||(...305
Reverse transition relation is NOT exact ! Due to transitions t32, t185, t266, t297, t447, t499, t671, t752, t783, t861, t932, t981, t984, t1166, t1218, t1...2730
Computing Next relation with stutter on 3.99752e+06 deadlock states
Detected timeout of ITS tools.
Treatment of property CloudReconfiguration-PT-401-LTLFireability-01 finished in 332634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||(p1&&(p2||X(p3))))))'
Support contains 4 out of 2119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2119/2119 places, 2715/2715 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 2105 transition count 2701
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 2105 transition count 2701
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 2105 transition count 2700
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 2098 transition count 2693
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 2098 transition count 2693
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 2092 transition count 2687
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 2092 transition count 2687
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 2092 transition count 2685
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 2088 transition count 2681
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 2088 transition count 2681
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 2088 transition count 2680
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 69 place count 2085 transition count 2677
Iterating global reduction 3 with 3 rules applied. Total rules applied 72 place count 2085 transition count 2677
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 2082 transition count 2672
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 2082 transition count 2672
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 2080 transition count 2669
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 2080 transition count 2669
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 2078 transition count 2667
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 2078 transition count 2667
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 2078 transition count 2666
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 88 place count 2077 transition count 2665
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 2077 transition count 2665
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 90 place count 2076 transition count 2664
Iterating global reduction 4 with 1 rules applied. Total rules applied 91 place count 2076 transition count 2664
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 92 place count 2075 transition count 2663
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 2075 transition count 2663
Applied a total of 93 rules in 1284 ms. Remains 2075 /2119 variables (removed 44) and now considering 2663/2715 (removed 52) transitions.
// Phase 1: matrix 2663 rows 2075 cols
[2025-05-30 11:15:47] [INFO ] Computed 5 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:15:47] [INFO ] Implicit Places using invariants in 318 ms returned []
[2025-05-30 11:15:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:15:48] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned []
Implicit Place search using SMT with State Equation took 1756 ms to find 0 implicit places.
Running 2662 sub problems to find dead transitions.
[2025-05-30 11:15:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2074 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2662 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2074/4738 variables, and 5 constraints, problems are : Problem set: 0 solved, 2662 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2075 constraints, PredecessorRefiner: 2662/2662 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2662 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2074 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2662 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2074/4738 variables, and 5 constraints, problems are : Problem set: 0 solved, 2662 unsolved in 30050 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2075 constraints, PredecessorRefiner: 0/2662 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60800ms problems are : Problem set: 0 solved, 2662 unsolved
Search for dead transitions found 0 dead transitions in 60805ms
Starting structural reductions in LTL mode, iteration 1 : 2075/2119 places, 2663/2715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63854 ms. Remains : 2075/2119 places, 2663/2715 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-02
Product exploration explored 100000 steps with 547 reset in 280 ms.
Product exploration explored 100000 steps with 535 reset in 218 ms.
Computed a total of 33 stabilizing places and 36 stable transitions
Graph (complete) has 2898 edges and 2075 vertex of which 2064 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.7 ms
Computed a total of 33 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0 (NOT p3)), (X (NOT p2)), (X (AND p1 (NOT p2))), (X p1), (X (X (NOT p3))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 103 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 40000 steps (214 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (47 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 353357 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 1
Probabilistic random walk after 353357 steps, saw 88489 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
[2025-05-30 11:16:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 821/823 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/823 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1239/2062 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2062 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2651/4713 variables, 2062/2067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4713 variables, 0/2067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/4715 variables, 1/2068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4715 variables, 0/2068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/4717 variables, 1/2069 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4717 variables, 0/2069 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/4719 variables, 1/2070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4719 variables, 0/2070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/4721 variables, 1/2071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4721 variables, 0/2071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/4723 variables, 1/2072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4723 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/4725 variables, 1/2073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4725 variables, 0/2073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/4727 variables, 1/2074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4727 variables, 0/2074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/4729 variables, 1/2075 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4729 variables, 0/2075 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/4731 variables, 1/2076 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4731 variables, 0/2076 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/4733 variables, 1/2077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4733 variables, 0/2077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/4735 variables, 1/2078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4735 variables, 0/2078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/4737 variables, 1/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/4737 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 1/4738 variables, 1/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/4738 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/4738 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4738/4738 variables, and 2080 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1981 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2075/2075 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 821/823 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/823 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1239/2062 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2062 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2651/4713 variables, 2062/2067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4713 variables, 1/2068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4713 variables, 0/2068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/4715 variables, 1/2069 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4715 variables, 0/2069 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/4717 variables, 1/2070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4717 variables, 0/2070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/4719 variables, 1/2071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4719 variables, 0/2071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/4721 variables, 1/2072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4721 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/4723 variables, 1/2073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4723 variables, 0/2073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/4725 variables, 1/2074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4725 variables, 0/2074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/4727 variables, 1/2075 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4727 variables, 0/2075 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/4729 variables, 1/2076 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4729 variables, 0/2076 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/4731 variables, 1/2077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/4731 variables, 0/2077 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/4733 variables, 1/2078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/4733 variables, 0/2078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/4735 variables, 1/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/4735 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 2/4737 variables, 1/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/4737 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 1/4738 variables, 1/2081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/4738 variables, 0/2081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/4738 variables, 0/2081 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4738/4738 variables, and 2081 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3302 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2075/2075 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5294ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 171 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=85 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p1 (NOT p2) p0 (NOT p3)), (X (NOT p2)), (X (AND p1 (NOT p2))), (X p1), (X (X (NOT p3))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 6 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 2 out of 2075 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 : 2075/2075 places, 2663/2663 transitions.
Graph (trivial) has 2539 edges and 2075 vertex of which 966 / 2075 are part of one of the 86 SCC in 2 ms
Free SCC test removed 880 places
Ensure Unique test removed 1031 transitions
Reduce isomorphic transitions removed 1031 transitions.
Graph (complete) has 1859 edges and 1195 vertex of which 1184 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 639 transitions
Trivial Post-agglo rules discarded 639 transitions
Performed 639 trivial Post agglomeration. Transition count delta: 639
Iterating post reduction 0 with 639 rules applied. Total rules applied 641 place count 1183 transition count 986
Reduce places removed 639 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 669 rules applied. Total rules applied 1310 place count 544 transition count 956
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 17 rules applied. Total rules applied 1327 place count 529 transition count 954
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1329 place count 527 transition count 954
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 69 Pre rules applied. Total rules applied 1329 place count 527 transition count 885
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 1467 place count 458 transition count 885
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 1489 place count 436 transition count 849
Iterating global reduction 4 with 22 rules applied. Total rules applied 1511 place count 436 transition count 849
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 1515 place count 436 transition count 845
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1519 place count 432 transition count 845
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1533 place count 418 transition count 825
Iterating global reduction 6 with 14 rules applied. Total rules applied 1547 place count 418 transition count 825
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1555 place count 418 transition count 817
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1558 place count 415 transition count 811
Iterating global reduction 7 with 3 rules applied. Total rules applied 1561 place count 415 transition count 811
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1564 place count 412 transition count 805
Iterating global reduction 7 with 3 rules applied. Total rules applied 1567 place count 412 transition count 805
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1570 place count 409 transition count 799
Iterating global reduction 7 with 3 rules applied. Total rules applied 1573 place count 409 transition count 799
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1576 place count 406 transition count 793
Iterating global reduction 7 with 3 rules applied. Total rules applied 1579 place count 406 transition count 793
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1581 place count 404 transition count 789
Iterating global reduction 7 with 2 rules applied. Total rules applied 1583 place count 404 transition count 789
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1585 place count 402 transition count 785
Iterating global reduction 7 with 2 rules applied. Total rules applied 1587 place count 402 transition count 785
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1589 place count 400 transition count 781
Iterating global reduction 7 with 2 rules applied. Total rules applied 1591 place count 400 transition count 781
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1593 place count 398 transition count 767
Iterating global reduction 7 with 2 rules applied. Total rules applied 1595 place count 398 transition count 767
Performed 183 Post agglomeration using F-continuation condition with reduction of 104 identical transitions.
Deduced a syphon composed of 183 places in 0 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 7 with 366 rules applied. Total rules applied 1961 place count 215 transition count 480
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1975 place count 215 transition count 466
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1979 place count 211 transition count 461
Iterating global reduction 8 with 4 rules applied. Total rules applied 1983 place count 211 transition count 461
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 2015 place count 195 transition count 441
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 2033 place count 195 transition count 423
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2034 place count 194 transition count 421
Iterating global reduction 9 with 1 rules applied. Total rules applied 2035 place count 194 transition count 421
Performed 26 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 9 with 52 rules applied. Total rules applied 2087 place count 168 transition count 479
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 9 with 28 rules applied. Total rules applied 2115 place count 168 transition count 451
Discarding 12 places :
Symmetric choice reduction at 10 with 12 rule applications. Total rules 2127 place count 156 transition count 427
Iterating global reduction 10 with 12 rules applied. Total rules applied 2139 place count 156 transition count 427
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 2147 place count 156 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 11 with 56 rules applied. Total rules applied 2203 place count 156 transition count 363
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2204 place count 155 transition count 362
Applied a total of 2204 rules in 132 ms. Remains 155 /2075 variables (removed 1920) and now considering 362/2663 (removed 2301) transitions.
[2025-05-30 11:16:59] [INFO ] Flow matrix only has 287 transitions (discarded 75 similar events)
// Phase 1: matrix 287 rows 155 cols
[2025-05-30 11:16:59] [INFO ] Computed 0 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:16:59] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-05-30 11:16:59] [INFO ] Flow matrix only has 287 transitions (discarded 75 similar events)
[2025-05-30 11:16:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:16:59] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 11:16:59] [INFO ] Implicit Places using invariants and state equation in 333 ms returned [13, 82, 116]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 395 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/2075 places, 362/2663 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 150 transition count 360
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 149 transition count 359
Applied a total of 3 rules in 12 ms. Remains 149 /152 variables (removed 3) and now considering 359/362 (removed 3) transitions.
[2025-05-30 11:16:59] [INFO ] Flow matrix only has 284 transitions (discarded 75 similar events)
// Phase 1: matrix 284 rows 149 cols
[2025-05-30 11:16:59] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:16:59] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-05-30 11:16:59] [INFO ] Flow matrix only has 284 transitions (discarded 75 similar events)
[2025-05-30 11:16:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:16:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 11:16:59] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 149/2075 places, 359/2663 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 720 ms. Remains : 149/2075 places, 359/2663 transitions.
Computed a total of 3 stabilizing places and 22 stable transitions
Computed a total of 3 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3600 resets) in 329 ms. (121 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (555 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2289698 steps, run timeout after 3001 ms. (steps per millisecond=762 ) properties seen :0 out of 1
Probabilistic random walk after 2289698 steps, saw 400238 distinct states, run finished after 3001 ms. (steps per millisecond=762 ) properties seen :0
[2025-05-30 11:17:03] [INFO ] Flow matrix only has 284 transitions (discarded 75 similar events)
[2025-05-30 11:17:03] [INFO ] Invariant cache hit.
[2025-05-30 11:17:03] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 170/183 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 237/420 variables, 124/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/432 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/432 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/433 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 92 ms.
Refiners :[State Equation: 149/149 constraints, ReadFeed: 3/3 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 170/183 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 237/420 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/432 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/432 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/432 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/433 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[State Equation: 149/149 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 250ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7331 reset in 212 ms.
Product exploration explored 100000 steps with 7276 reset in 196 ms.
Built C files in :
/tmp/ltsmin8045936026092316525
[2025-05-30 11:17:03] [INFO ] Computing symmetric may disable matrix : 359 transitions.
[2025-05-30 11:17:03] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:17:03] [INFO ] Computing symmetric may enable matrix : 359 transitions.
[2025-05-30 11:17:03] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:17:04] [INFO ] Computing Do-Not-Accords matrix : 359 transitions.
[2025-05-30 11:17:04] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:17:04] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8045936026092316525
Running compilation step : cd /tmp/ltsmin8045936026092316525;'/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 696 ms.
Running link step : cd /tmp/ltsmin8045936026092316525;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin8045936026092316525;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1072635853038853938.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 359/359 transitions.
Graph (trivial) has 198 edges and 149 vertex of which 4 / 149 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 146 transition count 354
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 146 transition count 354
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 145 transition count 352
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 145 transition count 352
Applied a total of 5 rules in 9 ms. Remains 145 /149 variables (removed 4) and now considering 352/359 (removed 7) transitions.
[2025-05-30 11:17:19] [INFO ] Flow matrix only has 276 transitions (discarded 76 similar events)
// Phase 1: matrix 276 rows 145 cols
[2025-05-30 11:17:19] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:17:19] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-30 11:17:19] [INFO ] Flow matrix only has 276 transitions (discarded 76 similar events)
[2025-05-30 11:17:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:17:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 11:17:19] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:17:19] [INFO ] Redundant transitions in 36 ms returned []
Running 340 sub problems to find dead transitions.
[2025-05-30 11:17:19] [INFO ] Flow matrix only has 276 transitions (discarded 76 similar events)
[2025-05-30 11:17:19] [INFO ] Invariant cache hit.
[2025-05-30 11:17:19] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 275/417 variables, 142/142 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 3/420 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (OVERLAPS) 0/420 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/421 variables, and 147 constraints, problems are : Problem set: 0 solved, 340 unsolved in 18704 ms.
Refiners :[State Equation: 145/145 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 275/417 variables, 142/142 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 248/392 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (OVERLAPS) 3/420 variables, 3/395 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 92/487 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 8 (OVERLAPS) 0/420 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 340 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/421 variables, and 487 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30019 ms.
Refiners :[State Equation: 145/145 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48807ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 48808ms
Starting structural reductions in SI_LTL mode, iteration 1 : 145/149 places, 352/359 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49024 ms. Remains : 145/149 places, 352/359 transitions.
Built C files in :
/tmp/ltsmin2091905230133338942
[2025-05-30 11:18:08] [INFO ] Computing symmetric may disable matrix : 352 transitions.
[2025-05-30 11:18:08] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:18:08] [INFO ] Computing symmetric may enable matrix : 352 transitions.
[2025-05-30 11:18:08] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:18:08] [INFO ] Computing Do-Not-Accords matrix : 352 transitions.
[2025-05-30 11:18:08] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:18:08] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2091905230133338942
Running compilation step : cd /tmp/ltsmin2091905230133338942;'/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 691 ms.
Running link step : cd /tmp/ltsmin2091905230133338942;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2091905230133338942;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10476604388806028388.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 11:18:23] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:18:23] [INFO ] Flatten gal took : 7 ms
[2025-05-30 11:18:23] [INFO ] Time to serialize gal into /tmp/LTL14025210432844154129.gal : 1 ms
[2025-05-30 11:18:23] [INFO ] Time to serialize properties into /tmp/LTL5331879377964124546.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/LTL14025210432844154129.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12104790698067993021.hoa' '-atoms' '/tmp/LTL5331879377964124546.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5331879377964124546.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12104790698067993021.hoa
Reverse transition relation is NOT exact ! Due to transitions t189, t301, t454, t675, t787, t939, t1141, t1253, t1407, t1615, t1729, t1882, t2366.t2367.t23...2097
Computing Next relation with stutter on 650080 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1047 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.5128,309692,1,0,640,1.10626e+06,667,428,5912,2.05473e+06,1052
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-401-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CloudReconfiguration-PT-401-LTLFireability-02 finished in 170300 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 2 out of 2119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2119/2119 places, 2715/2715 transitions.
Graph (trivial) has 2590 edges and 2119 vertex of which 988 / 2119 are part of one of the 88 SCC in 1 ms
Free SCC test removed 900 places
Ensure Unique test removed 1055 transitions
Reduce isomorphic transitions removed 1055 transitions.
Graph (complete) has 1890 edges and 1219 vertex of which 1207 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 657 transitions
Trivial Post-agglo rules discarded 657 transitions
Performed 657 trivial Post agglomeration. Transition count delta: 657
Iterating post reduction 0 with 658 rules applied. Total rules applied 660 place count 1206 transition count 994
Reduce places removed 657 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 689 rules applied. Total rules applied 1349 place count 549 transition count 962
Reduce places removed 16 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 20 rules applied. Total rules applied 1369 place count 533 transition count 958
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1373 place count 529 transition count 958
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 66 Pre rules applied. Total rules applied 1373 place count 529 transition count 892
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 1505 place count 463 transition count 892
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 1530 place count 438 transition count 854
Iterating global reduction 4 with 25 rules applied. Total rules applied 1555 place count 438 transition count 854
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1558 place count 438 transition count 851
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1561 place count 435 transition count 851
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1561 place count 435 transition count 849
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1565 place count 433 transition count 849
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1581 place count 417 transition count 827
Iterating global reduction 6 with 16 rules applied. Total rules applied 1597 place count 417 transition count 827
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1605 place count 417 transition count 819
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1608 place count 414 transition count 813
Iterating global reduction 7 with 3 rules applied. Total rules applied 1611 place count 414 transition count 813
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1614 place count 411 transition count 807
Iterating global reduction 7 with 3 rules applied. Total rules applied 1617 place count 411 transition count 807
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1620 place count 408 transition count 801
Iterating global reduction 7 with 3 rules applied. Total rules applied 1623 place count 408 transition count 801
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1626 place count 405 transition count 795
Iterating global reduction 7 with 3 rules applied. Total rules applied 1629 place count 405 transition count 795
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1632 place count 402 transition count 789
Iterating global reduction 7 with 3 rules applied. Total rules applied 1635 place count 402 transition count 789
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1638 place count 399 transition count 783
Iterating global reduction 7 with 3 rules applied. Total rules applied 1641 place count 399 transition count 783
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1644 place count 396 transition count 777
Iterating global reduction 7 with 3 rules applied. Total rules applied 1647 place count 396 transition count 777
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1649 place count 394 transition count 763
Iterating global reduction 7 with 2 rules applied. Total rules applied 1651 place count 394 transition count 763
Performed 187 Post agglomeration using F-continuation condition with reduction of 111 identical transitions.
Deduced a syphon composed of 187 places in 0 ms
Reduce places removed 187 places and 0 transitions.
Iterating global reduction 7 with 374 rules applied. Total rules applied 2025 place count 207 transition count 465
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 2039 place count 207 transition count 451
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2044 place count 202 transition count 441
Iterating global reduction 8 with 5 rules applied. Total rules applied 2049 place count 202 transition count 441
Performed 16 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 2081 place count 186 transition count 422
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 2099 place count 186 transition count 404
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 9 with 46 rules applied. Total rules applied 2145 place count 163 transition count 451
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 2167 place count 163 transition count 429
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 2178 place count 152 transition count 407
Iterating global reduction 10 with 11 rules applied. Total rules applied 2189 place count 152 transition count 407
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 2196 place count 152 transition count 400
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 11 with 50 rules applied. Total rules applied 2246 place count 152 transition count 350
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2247 place count 151 transition count 349
Applied a total of 2247 rules in 121 ms. Remains 151 /2119 variables (removed 1968) and now considering 349/2715 (removed 2366) transitions.
[2025-05-30 11:18:36] [INFO ] Flow matrix only has 272 transitions (discarded 77 similar events)
// Phase 1: matrix 272 rows 151 cols
[2025-05-30 11:18:36] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:18:36] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-05-30 11:18:36] [INFO ] Flow matrix only has 272 transitions (discarded 77 similar events)
[2025-05-30 11:18:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:18:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 11:18:36] [INFO ] Implicit Places using invariants and state equation in 170 ms returned [11, 79, 112]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 236 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/2119 places, 349/2715 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 146 transition count 347
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 145 transition count 346
Applied a total of 3 rules in 12 ms. Remains 145 /148 variables (removed 3) and now considering 346/349 (removed 3) transitions.
[2025-05-30 11:18:36] [INFO ] Flow matrix only has 269 transitions (discarded 77 similar events)
// Phase 1: matrix 269 rows 145 cols
[2025-05-30 11:18:36] [INFO ] Computed 0 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:18:36] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-05-30 11:18:36] [INFO ] Flow matrix only has 269 transitions (discarded 77 similar events)
[2025-05-30 11:18:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:18:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 11:18:36] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 145/2119 places, 346/2715 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 542 ms. Remains : 145/2119 places, 346/2715 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-401-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLFireability-03 finished in 589 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||G(p1)))&&F(p2))))'
Support contains 3 out of 2119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2119/2119 places, 2715/2715 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 2103 transition count 2699
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 2103 transition count 2699
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 2103 transition count 2697
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 2096 transition count 2690
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 2096 transition count 2690
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 2090 transition count 2684
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 2090 transition count 2684
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 2090 transition count 2682
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 2086 transition count 2678
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 2086 transition count 2678
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 2086 transition count 2677
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 74 place count 2083 transition count 2674
Iterating global reduction 3 with 3 rules applied. Total rules applied 77 place count 2083 transition count 2674
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 80 place count 2080 transition count 2669
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 2080 transition count 2669
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 2078 transition count 2666
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 2078 transition count 2666
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 2076 transition count 2664
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 2076 transition count 2664
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 2076 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 2075 transition count 2662
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 2075 transition count 2662
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 95 place count 2074 transition count 2661
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 2074 transition count 2661
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 2073 transition count 2660
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 2073 transition count 2660
Applied a total of 98 rules in 1316 ms. Remains 2073 /2119 variables (removed 46) and now considering 2660/2715 (removed 55) transitions.
// Phase 1: matrix 2660 rows 2073 cols
[2025-05-30 11:18:37] [INFO ] Computed 5 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:18:38] [INFO ] Implicit Places using invariants in 350 ms returned []
[2025-05-30 11:18:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:18:39] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned []
Implicit Place search using SMT with State Equation took 1790 ms to find 0 implicit places.
Running 2659 sub problems to find dead transitions.
[2025-05-30 11:18:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2072 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2072/4733 variables, and 5 constraints, problems are : Problem set: 0 solved, 2659 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2073 constraints, PredecessorRefiner: 2659/2659 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2659 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2072 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2072/4733 variables, and 5 constraints, problems are : Problem set: 0 solved, 2659 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2073 constraints, PredecessorRefiner: 0/2659 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60743ms problems are : Problem set: 0 solved, 2659 unsolved
Search for dead transitions found 0 dead transitions in 60746ms
Starting structural reductions in LTL mode, iteration 1 : 2073/2119 places, 2660/2715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63863 ms. Remains : 2073/2119 places, 2660/2715 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-401-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLFireability-05 finished in 64120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (p1&&X((F(p2) U p1)))))'
Support contains 3 out of 2119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2119/2119 places, 2715/2715 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 2105 transition count 2701
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 2105 transition count 2701
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 2105 transition count 2699
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 2099 transition count 2693
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 2099 transition count 2693
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 2094 transition count 2688
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 2094 transition count 2688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 2094 transition count 2687
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 2090 transition count 2683
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 2090 transition count 2683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 2090 transition count 2682
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 2087 transition count 2679
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 2087 transition count 2679
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 71 place count 2084 transition count 2674
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 2084 transition count 2674
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 2082 transition count 2671
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 2082 transition count 2671
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 2080 transition count 2669
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 2080 transition count 2669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 2080 transition count 2668
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 84 place count 2079 transition count 2667
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 2079 transition count 2667
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 86 place count 2078 transition count 2666
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 2078 transition count 2666
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 88 place count 2077 transition count 2665
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 2077 transition count 2665
Applied a total of 89 rules in 1258 ms. Remains 2077 /2119 variables (removed 42) and now considering 2665/2715 (removed 50) transitions.
// Phase 1: matrix 2665 rows 2077 cols
[2025-05-30 11:19:42] [INFO ] Computed 5 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:19:42] [INFO ] Implicit Places using invariants in 332 ms returned []
[2025-05-30 11:19:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:19:43] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 1828 ms to find 0 implicit places.
Running 2664 sub problems to find dead transitions.
[2025-05-30 11:19:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2076 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2076/4742 variables, and 5 constraints, problems are : Problem set: 0 solved, 2664 unsolved in 30049 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2077 constraints, PredecessorRefiner: 2664/2664 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2664 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2076 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2076/4742 variables, and 5 constraints, problems are : Problem set: 0 solved, 2664 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2077 constraints, PredecessorRefiner: 0/2664 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60757ms problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 60760ms
Starting structural reductions in LTL mode, iteration 1 : 2077/2119 places, 2665/2715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63856 ms. Remains : 2077/2119 places, 2665/2715 transitions.
Stuttering acceptance computed with spot in 312 ms :[(NOT p1), (NOT p0), (NOT p1), true, (NOT p2), (AND p0 (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 562 ms.
Product exploration explored 100000 steps with 50000 reset in 540 ms.
Computed a total of 33 stabilizing places and 36 stable transitions
Graph (complete) has 2900 edges and 2077 vertex of which 2066 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.7 ms
Computed a total of 33 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 15 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudReconfiguration-PT-401-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudReconfiguration-PT-401-LTLFireability-06 finished in 65336 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||X((F(G(p1))||G((p2 U p3)))))))'
Support contains 5 out of 2119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2119/2119 places, 2715/2715 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2106 transition count 2702
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2106 transition count 2702
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 2106 transition count 2700
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 2101 transition count 2695
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 2101 transition count 2695
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 2097 transition count 2691
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 2097 transition count 2691
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 2097 transition count 2689
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 2095 transition count 2687
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 2095 transition count 2687
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 2095 transition count 2686
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 2094 transition count 2685
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 2094 transition count 2685
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 2093 transition count 2684
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 2093 transition count 2684
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 2092 transition count 2683
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 2092 transition count 2683
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 2091 transition count 2682
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 2091 transition count 2682
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 2090 transition count 2681
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 2090 transition count 2681
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 2089 transition count 2680
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 2089 transition count 2680
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 2088 transition count 2679
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 2088 transition count 2679
Applied a total of 67 rules in 1262 ms. Remains 2088 /2119 variables (removed 31) and now considering 2679/2715 (removed 36) transitions.
// Phase 1: matrix 2679 rows 2088 cols
[2025-05-30 11:20:47] [INFO ] Computed 5 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:20:47] [INFO ] Implicit Places using invariants in 339 ms returned []
[2025-05-30 11:20:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:20:49] [INFO ] Implicit Places using invariants and state equation in 1422 ms returned []
Implicit Place search using SMT with State Equation took 1778 ms to find 0 implicit places.
Running 2678 sub problems to find dead transitions.
[2025-05-30 11:20:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2087 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2087/4767 variables, and 5 constraints, problems are : Problem set: 0 solved, 2678 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2088 constraints, PredecessorRefiner: 2678/2678 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2678 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2087 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2678 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2087/4767 variables, and 5 constraints, problems are : Problem set: 0 solved, 2678 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2088 constraints, PredecessorRefiner: 0/2678 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60731ms problems are : Problem set: 0 solved, 2678 unsolved
Search for dead transitions found 0 dead transitions in 60734ms
Starting structural reductions in LTL mode, iteration 1 : 2088/2119 places, 2679/2715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63785 ms. Remains : 2088/2119 places, 2679/2715 transitions.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-07
Stuttering criterion allowed to conclude after 167 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-401-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLFireability-07 finished in 64047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 3 out of 2119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2119/2119 places, 2715/2715 transitions.
Graph (trivial) has 2592 edges and 2119 vertex of which 983 / 2119 are part of one of the 89 SCC in 1 ms
Free SCC test removed 894 places
Ensure Unique test removed 1046 transitions
Reduce isomorphic transitions removed 1046 transitions.
Graph (complete) has 1899 edges and 1225 vertex of which 1214 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 665 transitions
Trivial Post-agglo rules discarded 665 transitions
Performed 665 trivial Post agglomeration. Transition count delta: 665
Iterating post reduction 0 with 665 rules applied. Total rules applied 667 place count 1213 transition count 997
Reduce places removed 665 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 697 rules applied. Total rules applied 1364 place count 548 transition count 965
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 1380 place count 532 transition count 965
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 1380 place count 532 transition count 899
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 1512 place count 466 transition count 899
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1537 place count 441 transition count 861
Iterating global reduction 3 with 25 rules applied. Total rules applied 1562 place count 441 transition count 861
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 1565 place count 441 transition count 858
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1568 place count 438 transition count 858
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1568 place count 438 transition count 856
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1572 place count 436 transition count 856
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1588 place count 420 transition count 834
Iterating global reduction 5 with 16 rules applied. Total rules applied 1604 place count 420 transition count 834
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1612 place count 420 transition count 826
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1615 place count 417 transition count 820
Iterating global reduction 6 with 3 rules applied. Total rules applied 1618 place count 417 transition count 820
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1621 place count 414 transition count 814
Iterating global reduction 6 with 3 rules applied. Total rules applied 1624 place count 414 transition count 814
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1627 place count 411 transition count 808
Iterating global reduction 6 with 3 rules applied. Total rules applied 1630 place count 411 transition count 808
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1633 place count 408 transition count 802
Iterating global reduction 6 with 3 rules applied. Total rules applied 1636 place count 408 transition count 802
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1639 place count 405 transition count 796
Iterating global reduction 6 with 3 rules applied. Total rules applied 1642 place count 405 transition count 796
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1645 place count 402 transition count 790
Iterating global reduction 6 with 3 rules applied. Total rules applied 1648 place count 402 transition count 790
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1651 place count 399 transition count 784
Iterating global reduction 6 with 3 rules applied. Total rules applied 1654 place count 399 transition count 784
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1656 place count 397 transition count 770
Iterating global reduction 6 with 2 rules applied. Total rules applied 1658 place count 397 transition count 770
Performed 187 Post agglomeration using F-continuation condition with reduction of 111 identical transitions.
Deduced a syphon composed of 187 places in 0 ms
Reduce places removed 187 places and 0 transitions.
Iterating global reduction 6 with 374 rules applied. Total rules applied 2032 place count 210 transition count 472
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 2046 place count 210 transition count 458
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2051 place count 205 transition count 448
Iterating global reduction 7 with 5 rules applied. Total rules applied 2056 place count 205 transition count 448
Performed 16 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 2088 place count 189 transition count 429
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 2106 place count 189 transition count 411
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 8 with 46 rules applied. Total rules applied 2152 place count 166 transition count 458
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 2174 place count 166 transition count 436
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 2186 place count 154 transition count 412
Iterating global reduction 9 with 12 rules applied. Total rules applied 2198 place count 154 transition count 412
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 2206 place count 154 transition count 404
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 10 with 50 rules applied. Total rules applied 2256 place count 154 transition count 354
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2257 place count 153 transition count 353
Applied a total of 2257 rules in 109 ms. Remains 153 /2119 variables (removed 1966) and now considering 353/2715 (removed 2362) transitions.
[2025-05-30 11:21:50] [INFO ] Flow matrix only has 275 transitions (discarded 78 similar events)
// Phase 1: matrix 275 rows 153 cols
[2025-05-30 11:21:50] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:21:50] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-05-30 11:21:50] [INFO ] Flow matrix only has 275 transitions (discarded 78 similar events)
[2025-05-30 11:21:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:21:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 11:21:50] [INFO ] Implicit Places using invariants and state equation in 163 ms returned [11, 81, 114]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 228 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/2119 places, 353/2715 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 148 transition count 351
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 147 transition count 350
Applied a total of 3 rules in 9 ms. Remains 147 /150 variables (removed 3) and now considering 350/353 (removed 3) transitions.
[2025-05-30 11:21:50] [INFO ] Flow matrix only has 272 transitions (discarded 78 similar events)
// Phase 1: matrix 272 rows 147 cols
[2025-05-30 11:21:50] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:21:50] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-05-30 11:21:50] [INFO ] Flow matrix only has 272 transitions (discarded 78 similar events)
[2025-05-30 11:21:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:21:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 11:21:50] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 147/2119 places, 350/2715 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 520 ms. Remains : 147/2119 places, 350/2715 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-09
Product exploration explored 100000 steps with 6651 reset in 152 ms.
Product exploration explored 100000 steps with 6578 reset in 155 ms.
Computed a total of 3 stabilizing places and 22 stable transitions
Graph (complete) has 531 edges and 147 vertex of which 146 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 3 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 330 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (3198 resets) in 99 ms. (400 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (495 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (499 resets) in 20 ms. (1904 steps per ms) remains 2/2 properties
[2025-05-30 11:21:51] [INFO ] Flow matrix only has 272 transitions (discarded 78 similar events)
[2025-05-30 11:21:51] [INFO ] Invariant cache hit.
[2025-05-30 11:21:51] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 132/141 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 263/404 variables, 127/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/417 variables, 11/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/418 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/418 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/419 variables, and 149 constraints, problems are : Problem set: 0 solved, 2 unsolved in 126 ms.
Refiners :[State Equation: 147/147 constraints, ReadFeed: 2/2 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 132/141 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 263/404 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 13/417 variables, 11/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/418 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/418 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/419 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 210 ms.
Refiners :[State Equation: 147/147 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 340ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 438 steps, including 45 resets, run visited all 2 properties in 7 ms. (steps per millisecond=62 )
Parikh walk visited 2 properties in 6 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 431 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 350/350 transitions.
Applied a total of 0 rules in 9 ms. Remains 147 /147 variables (removed 0) and now considering 350/350 (removed 0) transitions.
[2025-05-30 11:21:52] [INFO ] Flow matrix only has 272 transitions (discarded 78 similar events)
[2025-05-30 11:21:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:21:52] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-05-30 11:21:52] [INFO ] Flow matrix only has 272 transitions (discarded 78 similar events)
[2025-05-30 11:21:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:21:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 11:21:52] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:21:52] [INFO ] Redundant transitions in 34 ms returned []
Running 337 sub problems to find dead transitions.
[2025-05-30 11:21:52] [INFO ] Flow matrix only has 272 transitions (discarded 78 similar events)
[2025-05-30 11:21:52] [INFO ] Invariant cache hit.
[2025-05-30 11:21:52] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (OVERLAPS) 271/415 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (OVERLAPS) 3/418 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (OVERLAPS) 0/418 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 337 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/419 variables, and 149 constraints, problems are : Problem set: 0 solved, 337 unsolved in 18805 ms.
Refiners :[State Equation: 147/147 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (OVERLAPS) 271/415 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 247/393 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (OVERLAPS) 3/418 variables, 3/396 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 90/486 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/419 variables, and 486 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30021 ms.
Refiners :[State Equation: 147/147 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48908ms problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 48909ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49145 ms. Remains : 147/147 places, 350/350 transitions.
Computed a total of 3 stabilizing places and 22 stable transitions
Graph (complete) has 531 edges and 147 vertex of which 146 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 3 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 330 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (3142 resets) in 105 ms. (377 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (490 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (502 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
[2025-05-30 11:22:42] [INFO ] Flow matrix only has 272 transitions (discarded 78 similar events)
[2025-05-30 11:22:42] [INFO ] Invariant cache hit.
[2025-05-30 11:22:42] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 132/141 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 263/404 variables, 127/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/417 variables, 11/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/418 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/418 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/419 variables, and 149 constraints, problems are : Problem set: 0 solved, 2 unsolved in 145 ms.
Refiners :[State Equation: 147/147 constraints, ReadFeed: 2/2 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 132/141 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 263/404 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 13/417 variables, 11/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/418 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/418 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/419 variables, and 151 constraints, problems are : Problem set: 0 solved, 2 unsolved in 231 ms.
Refiners :[State Equation: 147/147 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 378ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 358 steps, including 36 resets, run visited all 2 properties in 10 ms. (steps per millisecond=35 )
Parikh walk visited 2 properties in 9 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 446 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 6968 steps with 451 reset in 17 ms.
FORMULA CloudReconfiguration-PT-401-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLFireability-09 finished in 53118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(G(p1) U (p0&&G(p1)))))))'
Support contains 1 out of 2119 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 : 2119/2119 places, 2715/2715 transitions.
Graph (trivial) has 2594 edges and 2119 vertex of which 985 / 2119 are part of one of the 88 SCC in 2 ms
Free SCC test removed 897 places
Ensure Unique test removed 1051 transitions
Reduce isomorphic transitions removed 1051 transitions.
Graph (complete) has 1894 edges and 1222 vertex of which 1210 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 661 transitions
Trivial Post-agglo rules discarded 661 transitions
Performed 661 trivial Post agglomeration. Transition count delta: 661
Iterating post reduction 0 with 662 rules applied. Total rules applied 664 place count 1209 transition count 994
Reduce places removed 661 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 693 rules applied. Total rules applied 1357 place count 548 transition count 962
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 1374 place count 532 transition count 961
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1375 place count 531 transition count 961
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 66 Pre rules applied. Total rules applied 1375 place count 531 transition count 895
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 1507 place count 465 transition count 895
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 1531 place count 441 transition count 859
Iterating global reduction 4 with 24 rules applied. Total rules applied 1555 place count 441 transition count 859
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1558 place count 441 transition count 856
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1561 place count 438 transition count 856
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1561 place count 438 transition count 854
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1565 place count 436 transition count 854
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1580 place count 421 transition count 834
Iterating global reduction 6 with 15 rules applied. Total rules applied 1595 place count 421 transition count 834
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1603 place count 421 transition count 826
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1605 place count 419 transition count 822
Iterating global reduction 7 with 2 rules applied. Total rules applied 1607 place count 419 transition count 822
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1609 place count 417 transition count 818
Iterating global reduction 7 with 2 rules applied. Total rules applied 1611 place count 417 transition count 818
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1613 place count 415 transition count 814
Iterating global reduction 7 with 2 rules applied. Total rules applied 1615 place count 415 transition count 814
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1617 place count 413 transition count 810
Iterating global reduction 7 with 2 rules applied. Total rules applied 1619 place count 413 transition count 810
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1621 place count 411 transition count 806
Iterating global reduction 7 with 2 rules applied. Total rules applied 1623 place count 411 transition count 806
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1625 place count 409 transition count 802
Iterating global reduction 7 with 2 rules applied. Total rules applied 1627 place count 409 transition count 802
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1629 place count 407 transition count 798
Iterating global reduction 7 with 2 rules applied. Total rules applied 1631 place count 407 transition count 798
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1632 place count 406 transition count 791
Iterating global reduction 7 with 1 rules applied. Total rules applied 1633 place count 406 transition count 791
Performed 188 Post agglomeration using F-continuation condition with reduction of 111 identical transitions.
Deduced a syphon composed of 188 places in 0 ms
Reduce places removed 188 places and 0 transitions.
Iterating global reduction 7 with 376 rules applied. Total rules applied 2009 place count 218 transition count 492
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 2025 place count 218 transition count 476
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2030 place count 213 transition count 466
Iterating global reduction 8 with 5 rules applied. Total rules applied 2035 place count 213 transition count 466
Performed 16 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 2067 place count 197 transition count 447
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 2084 place count 197 transition count 430
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2085 place count 196 transition count 428
Iterating global reduction 9 with 1 rules applied. Total rules applied 2086 place count 196 transition count 428
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 9 with 52 rules applied. Total rules applied 2138 place count 170 transition count 480
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 9 with 27 rules applied. Total rules applied 2165 place count 170 transition count 453
Discarding 12 places :
Symmetric choice reduction at 10 with 12 rule applications. Total rules 2177 place count 158 transition count 429
Iterating global reduction 10 with 12 rules applied. Total rules applied 2189 place count 158 transition count 429
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 2197 place count 158 transition count 421
Drop transitions (Redundant composition of simpler transitions.) removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 11 with 59 rules applied. Total rules applied 2256 place count 158 transition count 362
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2257 place count 157 transition count 361
Applied a total of 2257 rules in 108 ms. Remains 157 /2119 variables (removed 1962) and now considering 361/2715 (removed 2354) transitions.
[2025-05-30 11:22:43] [INFO ] Flow matrix only has 281 transitions (discarded 80 similar events)
// Phase 1: matrix 281 rows 157 cols
[2025-05-30 11:22:43] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:22:43] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-05-30 11:22:43] [INFO ] Flow matrix only has 281 transitions (discarded 80 similar events)
[2025-05-30 11:22:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:22:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 11:22:43] [INFO ] Implicit Places using invariants and state equation in 201 ms returned [17, 85, 118]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 265 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/2119 places, 361/2715 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 359
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 151 transition count 358
Applied a total of 3 rules in 12 ms. Remains 151 /154 variables (removed 3) and now considering 358/361 (removed 3) transitions.
[2025-05-30 11:22:43] [INFO ] Flow matrix only has 278 transitions (discarded 80 similar events)
// Phase 1: matrix 278 rows 151 cols
[2025-05-30 11:22:43] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:22:43] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-05-30 11:22:43] [INFO ] Flow matrix only has 278 transitions (discarded 80 similar events)
[2025-05-30 11:22:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:22:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 11:22:43] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 151/2119 places, 358/2715 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 557 ms. Remains : 151/2119 places, 358/2715 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-401-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLFireability-10 finished in 649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U (G(p1) U p2))&&X(X(F(p3)))))'
Support contains 4 out of 2119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2119/2119 places, 2715/2715 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 2103 transition count 2699
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 2103 transition count 2699
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 2103 transition count 2697
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 2097 transition count 2691
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 2097 transition count 2691
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 2092 transition count 2686
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 2092 transition count 2686
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 2092 transition count 2684
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 2089 transition count 2681
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 2089 transition count 2681
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 2086 transition count 2678
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 2086 transition count 2678
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 2083 transition count 2673
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 2083 transition count 2673
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 2081 transition count 2670
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 2081 transition count 2670
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 2079 transition count 2668
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 2079 transition count 2668
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 2079 transition count 2667
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 2078 transition count 2666
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 2078 transition count 2666
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 2077 transition count 2665
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 2077 transition count 2665
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 2076 transition count 2664
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 2076 transition count 2664
Applied a total of 91 rules in 1235 ms. Remains 2076 /2119 variables (removed 43) and now considering 2664/2715 (removed 51) transitions.
// Phase 1: matrix 2664 rows 2076 cols
[2025-05-30 11:22:45] [INFO ] Computed 5 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:22:45] [INFO ] Implicit Places using invariants in 324 ms returned []
[2025-05-30 11:22:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:22:46] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 1841 ms to find 0 implicit places.
Running 2663 sub problems to find dead transitions.
[2025-05-30 11:22:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2075 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2075/4740 variables, and 5 constraints, problems are : Problem set: 0 solved, 2663 unsolved in 30051 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2076 constraints, PredecessorRefiner: 2663/2663 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2663 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2075 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2075/4740 variables, and 5 constraints, problems are : Problem set: 0 solved, 2663 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2076 constraints, PredecessorRefiner: 0/2663 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60726ms problems are : Problem set: 0 solved, 2663 unsolved
Search for dead transitions found 0 dead transitions in 60729ms
Starting structural reductions in LTL mode, iteration 1 : 2076/2119 places, 2664/2715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63814 ms. Remains : 2076/2119 places, 2664/2715 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p2), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p3)]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-11
Stuttering criterion allowed to conclude after 138 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-401-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLFireability-11 finished in 64114 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(G((p1 U p2)))))))'
Support contains 3 out of 2119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2119/2119 places, 2715/2715 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 2105 transition count 2701
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 2105 transition count 2701
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 2105 transition count 2699
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 2099 transition count 2693
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 2099 transition count 2693
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 2093 transition count 2687
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 2093 transition count 2687
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 2093 transition count 2685
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 2089 transition count 2681
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 2089 transition count 2681
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 2089 transition count 2680
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 68 place count 2086 transition count 2677
Iterating global reduction 3 with 3 rules applied. Total rules applied 71 place count 2086 transition count 2677
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 74 place count 2083 transition count 2672
Iterating global reduction 3 with 3 rules applied. Total rules applied 77 place count 2083 transition count 2672
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 79 place count 2081 transition count 2669
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 2081 transition count 2669
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 83 place count 2079 transition count 2667
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 2079 transition count 2667
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 2079 transition count 2666
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 2078 transition count 2665
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 2078 transition count 2665
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 2077 transition count 2664
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 2077 transition count 2664
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 2076 transition count 2663
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 2076 transition count 2663
Applied a total of 92 rules in 1272 ms. Remains 2076 /2119 variables (removed 43) and now considering 2663/2715 (removed 52) transitions.
// Phase 1: matrix 2663 rows 2076 cols
[2025-05-30 11:23:49] [INFO ] Computed 5 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:23:49] [INFO ] Implicit Places using invariants in 341 ms returned []
[2025-05-30 11:23:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:23:51] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 1855 ms to find 0 implicit places.
Running 2662 sub problems to find dead transitions.
[2025-05-30 11:23: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/2075 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2662 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2075/4739 variables, and 5 constraints, problems are : Problem set: 0 solved, 2662 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2076 constraints, PredecessorRefiner: 2662/2662 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2662 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2075 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2662 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2075/4739 variables, and 5 constraints, problems are : Problem set: 0 solved, 2662 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2076 constraints, PredecessorRefiner: 0/2662 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60771ms problems are : Problem set: 0 solved, 2662 unsolved
Search for dead transitions found 0 dead transitions in 60775ms
Starting structural reductions in LTL mode, iteration 1 : 2076/2119 places, 2663/2715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63911 ms. Remains : 2076/2119 places, 2663/2715 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-12
Product exploration explored 100000 steps with 543 reset in 212 ms.
Product exploration explored 100000 steps with 551 reset in 211 ms.
Computed a total of 33 stabilizing places and 36 stable transitions
Graph (complete) has 2898 edges and 2076 vertex of which 2065 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.8 ms
Computed a total of 33 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 120 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (217 resets) in 131 ms. (303 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (52 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (52 resets) in 32 ms. (1212 steps per ms) remains 2/3 properties
[2025-05-30 11:24:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1258/1261 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1261 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 802/2063 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2063 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2651/4714 variables, 2063/2068 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4714 variables, 0/2068 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/4716 variables, 1/2069 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4716 variables, 0/2069 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/4718 variables, 1/2070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4718 variables, 0/2070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/4720 variables, 1/2071 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4720 variables, 0/2071 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/4722 variables, 1/2072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4722 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/4724 variables, 1/2073 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4724 variables, 0/2073 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/4726 variables, 1/2074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4726 variables, 0/2074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/4728 variables, 1/2075 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4728 variables, 0/2075 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/4730 variables, 1/2076 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4730 variables, 0/2076 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/4732 variables, 1/2077 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4732 variables, 0/2077 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/4734 variables, 1/2078 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4734 variables, 0/2078 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 2/4736 variables, 1/2079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4736 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 2/4738 variables, 1/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/4738 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 1/4739 variables, 1/2081 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/4739 variables, 0/2081 constraints. Problems are: Problem set: 0 solved, 2 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 4739/4739 variables, and 2081 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5019 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2076/2076 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1258/1261 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1261 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 802/2063 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2063 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2651/4714 variables, 2063/2068 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4714 variables, 2/2070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4714 variables, 0/2070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/4716 variables, 1/2071 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4716 variables, 0/2071 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/4718 variables, 1/2072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4718 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/4720 variables, 1/2073 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4720 variables, 0/2073 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/4722 variables, 1/2074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4722 variables, 0/2074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/4724 variables, 1/2075 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4724 variables, 0/2075 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/4726 variables, 1/2076 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4726 variables, 0/2076 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/4728 variables, 1/2077 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4728 variables, 0/2077 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/4730 variables, 1/2078 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4730 variables, 0/2078 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/4732 variables, 1/2079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/4732 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/4734 variables, 1/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/4734 variables, 0/2080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 2/4736 variables, 1/2081 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/4736 variables, 0/2081 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 2/4738 variables, 1/2082 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/4738 variables, 0/2082 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 1/4739 variables, 1/2083 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/4739 variables, 0/2083 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4739/4739 variables, and 2083 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5017 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2076/2076 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10045ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 2076 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2076/2076 places, 2663/2663 transitions.
Graph (trivial) has 2542 edges and 2076 vertex of which 980 / 2076 are part of one of the 88 SCC in 1 ms
Free SCC test removed 892 places
Drop transitions (Empty/Sink Transition effects.) removed 1133 transitions
Reduce isomorphic transitions removed 1133 transitions.
Graph (complete) has 1758 edges and 1184 vertex of which 1173 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 660 transitions
Trivial Post-agglo rules discarded 660 transitions
Performed 660 trivial Post agglomeration. Transition count delta: 660
Iterating post reduction 0 with 669 rules applied. Total rules applied 671 place count 1173 transition count 856
Reduce places removed 660 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 1 with 749 rules applied. Total rules applied 1420 place count 513 transition count 767
Reduce places removed 58 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 59 rules applied. Total rules applied 1479 place count 455 transition count 766
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1480 place count 454 transition count 766
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 66 Pre rules applied. Total rules applied 1480 place count 454 transition count 700
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 1612 place count 388 transition count 700
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1627 place count 373 transition count 678
Iterating global reduction 4 with 15 rules applied. Total rules applied 1642 place count 373 transition count 678
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 1646 place count 373 transition count 674
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1650 place count 369 transition count 674
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1660 place count 359 transition count 662
Iterating global reduction 6 with 10 rules applied. Total rules applied 1670 place count 359 transition count 662
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1678 place count 359 transition count 654
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1680 place count 357 transition count 642
Iterating global reduction 7 with 2 rules applied. Total rules applied 1682 place count 357 transition count 642
Performed 188 Post agglomeration using F-continuation condition with reduction of 127 identical transitions.
Deduced a syphon composed of 188 places in 0 ms
Reduce places removed 188 places and 0 transitions.
Iterating global reduction 7 with 376 rules applied. Total rules applied 2058 place count 169 transition count 327
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 2074 place count 169 transition count 311
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2078 place count 165 transition count 307
Iterating global reduction 8 with 4 rules applied. Total rules applied 2082 place count 165 transition count 307
Performed 17 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 2116 place count 148 transition count 286
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 2135 place count 148 transition count 267
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 9 with 2 rules applied. Total rules applied 2137 place count 147 transition count 266
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2139 place count 147 transition count 264
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 10 with 2 rules applied. Total rules applied 2141 place count 146 transition count 263
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2144 place count 146 transition count 260
Performed 43 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 11 with 86 rules applied. Total rules applied 2230 place count 103 transition count 302
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 11 with 66 rules applied. Total rules applied 2296 place count 103 transition count 236
Discarding 31 places :
Symmetric choice reduction at 12 with 31 rule applications. Total rules 2327 place count 72 transition count 198
Iterating global reduction 12 with 31 rules applied. Total rules applied 2358 place count 72 transition count 198
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 12 with 18 rules applied. Total rules applied 2376 place count 72 transition count 180
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 2384 place count 64 transition count 164
Iterating global reduction 13 with 8 rules applied. Total rules applied 2392 place count 64 transition count 164
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 2400 place count 64 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 14 with 36 rules applied. Total rules applied 2436 place count 64 transition count 120
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 2440 place count 60 transition count 110
Iterating global reduction 14 with 4 rules applied. Total rules applied 2444 place count 60 transition count 110
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 2447 place count 57 transition count 107
Iterating global reduction 14 with 3 rules applied. Total rules applied 2450 place count 57 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 2453 place count 57 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 2457 place count 57 transition count 100
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2462 place count 57 transition count 95
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 2468 place count 52 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 2469 place count 52 transition count 93
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 2472 place count 52 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 2473 place count 51 transition count 92
Applied a total of 2473 rules in 66 ms. Remains 51 /2076 variables (removed 2025) and now considering 92/2663 (removed 2571) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 51/2076 places, 92/2663 transitions.
RANDOM walk for 4242 steps (93 resets) in 13 ms. (303 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT p0)), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 8 factoid took 309 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Support contains 3 out of 2076 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2076/2076 places, 2663/2663 transitions.
Applied a total of 0 rules in 102 ms. Remains 2076 /2076 variables (removed 0) and now considering 2663/2663 (removed 0) transitions.
[2025-05-30 11:25:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:25:04] [INFO ] Implicit Places using invariants in 344 ms returned []
[2025-05-30 11:25:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:25:05] [INFO ] Implicit Places using invariants and state equation in 1505 ms returned []
Implicit Place search using SMT with State Equation took 1850 ms to find 0 implicit places.
Running 2662 sub problems to find dead transitions.
[2025-05-30 11:25:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2075 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2662 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2075/4739 variables, and 5 constraints, problems are : Problem set: 0 solved, 2662 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2076 constraints, PredecessorRefiner: 2662/2662 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2662 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2075 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2662 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2075/4739 variables, and 5 constraints, problems are : Problem set: 0 solved, 2662 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2076 constraints, PredecessorRefiner: 0/2662 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60723ms problems are : Problem set: 0 solved, 2662 unsolved
Search for dead transitions found 0 dead transitions in 60730ms
Finished structural reductions in LTL mode , in 1 iterations and 62702 ms. Remains : 2076/2076 places, 2663/2663 transitions.
Computed a total of 33 stabilizing places and 36 stable transitions
Graph (complete) has 2898 edges and 2076 vertex of which 2065 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.10 ms
Computed a total of 33 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (OR p1 p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 115 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (218 resets) in 213 ms. (186 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (50 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (50 resets) in 38 ms. (1025 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (50 resets) in 34 ms. (1142 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (47 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (52 resets) in 34 ms. (1142 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 232765 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 5
Probabilistic random walk after 232765 steps, saw 59526 distinct states, run finished after 3002 ms. (steps per millisecond=77 ) properties seen :0
[2025-05-30 11:26:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1258/1261 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1261 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 802/2063 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2063 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2651/4714 variables, 2063/2068 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4714 variables, 0/2068 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/4716 variables, 1/2069 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4716 variables, 0/2069 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 2/4718 variables, 1/2070 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4718 variables, 0/2070 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/4720 variables, 1/2071 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4720 variables, 0/2071 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/4722 variables, 1/2072 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4722 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/4724 variables, 1/2073 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4724 variables, 0/2073 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/4726 variables, 1/2074 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4726/4739 variables, and 2074 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5023 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2069/2076 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1258/1261 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1261 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 802/2063 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2063 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2651/4714 variables, 2063/2068 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4714 variables, 5/2073 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4714 variables, 0/2073 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 2/4716 variables, 1/2074 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4716 variables, 0/2074 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2/4718 variables, 1/2075 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4718 variables, 0/2075 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2/4720 variables, 1/2076 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4720 variables, 0/2076 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2/4722 variables, 1/2077 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4722 variables, 0/2077 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 2/4724 variables, 1/2078 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 2)
(t1 2)
(t2 2)
(t3 2)
(t4 2)
(t12 4)
(t13 4)
(t14 4)
(t15 4)
(t16 4)
(t17 4)
(t18 4)
(t19 4)
(t20 4)
(t21 4)
(t22 4)
(t23 4)
(t24 4)
(t25 4)
(t26 4)
(t27 4)
(t28 4)
(t29 4)
(t30 4)
(t31 4)
(t32 2)
(t33 2)
(t34 2)
(t35 0)
(t36 0)
(t37 0)
(t38 0)
(t39 0)
(t40 0)
(t41 0)
(t42 0)
(t43 0)
(t44 0)
(t45 0)
(t46 0)
(t47 0)
(t48 0)
(t49 0)
(t50 0)
(t51 0)
(t52 0)
(t53 0)
(t54 0)
(t55 0)
(t56 0)
(t57 0)
(t58 0)
(t59 0)
(t60 0)
(t61 0)
(t62 0)
(t63 0)
(t64 0)
(t65 0)
(t66 0)
(t67 0)
(t68 0)
(t69 0)
(t70 0)
(t71 0)
(t72 0)
(t73 0)
(t74 0)
(t75 0)
(t76 0)
(t77 0)
(t78 0)
(t79 0)
(t80 0)
(t81 0)
(t82 0)
(t83 0)
(t84 0)
(t85 0)
(t86 0)
(t87 0)
(t88 0)
(t89 0)
(t90 0)
(t91 0)
(t92 0)
(t93 0)
(t94 0)
(t95 0)
(t96 0)
(t97 0)
(t98 0)
(t99 0)
(t100 0)
(t101 0)
(t102 0)
(t103 0)
(t104 0)
(t105 0)
(t106 0)
(t107 0)
(t108 0)
(t109 0)
(t110 0)
(t111 0)
(t112 0)
(t113 0)
(t114 0)
(t115 0)
(t116 0)
(t117 0)
(t118 0)
(t119 0)
(t120 0)
(t121 0)
(t122 0)
(t123 0)
(t124 0)
(t125 0)
(t126 0)
(t127 0)
(t128 0)
(t129 0)
(t130 0)
(t131 0)
(t132 0)
(t133 0)
(t134 0)
(t135 0)
(t136 0)
(t137 0)
(t138 0)
(t139 0)
(t140 0)
(t141 0)
(t142 0)
(t143 0)
(t144 0)
(t145 0)
(t146 0)
(t147 0)
(t148 0)
(t149 0)
(t150 0)
(t151 0)
(t152 0)
(t153 0)
(t154 0)
(t155 0)
(t156 0)
(t157 0)
(t158 0)
(t159 0)
(t160 0)
(t161 0)
(t162 0)
(t163 0)
(t164 0)
(t165 0)
(t166 0)
(t167 0)
(t168 0)
(t169 0)
(t170 0)
(t171 0)
(t172 0)
(t173 0)
(t174 0)
(t175 0)
(t176 0)
(t177 0)
(t178 0)
(t179 0)
(t180 0)
(t181 0)
(t182 0)
(t183 0)
(t184 0)
(t185 0)
(t186 0)
(t187 0)
(t188 0)
(t189 0)
(t190 0)
(t191 0)
(t192 0)
(t193 0)
(t194 0)
(t195 0)
(t196 0)
(t197 0)
(t198 0)
(t199 0)
(t200 0)
(t201 0)
(t202 0)
(t203 0)
(t204 0)
(t205 0)
(t206 0)
(t207 0)
(t208 0)
(t209 0)
(t210 0)
(t211 0)
(t212 0)
(t213 0)
(t214 0)
(t215 0)
(t216 0)
(t217 0)
(t218 0)
(t219 0)
(t220 0)
(t221 0)
(t222 0)
(t223 0)
(t224 0)
(t225 0)
(t226 0)
(t227 0)
(t228 0)
(t229 0)
(t230 0)
(t231 0)
(t232 0)
(t233 0)
(t234 0)
(t235 0)
(t236 0)
(t237 0)
(t238 0)
(t239 0)
(t240 0)
(t241 0)
(t242 0)
(t243 0)
(t244 0)
(t245 0)
(t246 0)
(t247 0)
(t248 0)
(t249 0)
(t250 0)
(t251 0)
(t252 0)
(t253 0)
(t254 0)
(t255 0)
(t256 0)
(t257 0)
(t258 0)
(t259 0)
(t260 0)
(t261 0)
(t262 0)
(t263 0)
(t264 0)
(t265 0)
(t266 0)
(t267 0)
(t268 0)
(t269 0)
(t270 0)
(t271 0)
(t272 0)
(t273 0)
(t274 0)
(t275 0)
(t276 0)
(t277 0)
(t278 0)
(t279 0)
(t280 0)
(t281 0)
(t282 0)
(t283 0)
(t284 0)
(t285 0)
(t286 0)
(t287 0)
(t288 0)
(t289 0)
(t290 0)
(t291 0)
(t292 0)
(t293 0)
(t294 0)
(t295 0)
(t296 0)
(t297 0)
(t298 0)
(t299 0)
(t300 0)
(t301 0)
(t302 0)
(t303 0)
(t304 0)
(t305 0)
(t306 0)
(t307 0)
(t308 0)
(t309 0)
(t310 0)
(t311 0)
(t312 0)
(t313 0)
(t314 0)
(t315 0)
(t316 0)
(t317 0)
(t318 0)
(t319 0)
(t320 0)
(t321 0)
(t322 0)
(t323 0)
(t324 0)
(t325 0)
(t326 0)
(t327 0)
(t328 0)
(t329 0)
(t330 0)
(t331 0)
(t332 0)
(t333 0)
(t334 0)
(t335 0)
(t336 0)
(t337 0)
(t338 0)
(t339 0)
(t340 0)
(t341 0)
(t342 0)
(t343 0)
(t344 0)
(t345 0)
(t346 0)
(t347 0)
(t348 0)
(t349 0)
(t350 0)
(t351 0)
(t352 0)
(t353 0)
(t354 0)
(t355 0)
(t356 0)
(t357 0)
(t358 0)
(t359 0)
(t360 0)
(t361 0)
(t362 0)
(t363 0)
(t364 0)
(t365 0)
(t366 0)
(t367 0)
(t368 0)
(t369 0)
(t370 0)
(t371 0)
(t372 0)
(t373 0)
(t374 0)
(t375 0)
(t376 0)
(t377 0)
(t378 0)
(t379 0)
(t380 0)
(t381 0)
(t382 0)
(t383 0)
(t384 0)
(t385 0)
(t386 0)
(t387 0)
(t388 0)
(t389 2)
(t390 2)
(t391 2)
(t392 2)
(t393 2)
(t394 2)
(t395 2)
(t396 0)
(t397 2)
(t398 2)
(t399 0)
(t400 2)
(t401 2)
(t402 2)
(t403 2)
(t404 2)
(t405 2)
(t406 0)
(t407 0)
(t408 2)
(t409 2)
(t410 2)
(t411 0)
(t412 2)
(t413 2)
(t414 2)
(t415 2)
(t416 2)
(t417 1)
(t418 0)
(t419 0)
(t420 0)
(t421 0)
(t422 0)
(t423 2)
(t424 2)
(t425 0)
(t426 2)
(t427 2)
(t428 0)
(t429 2)
(t430 2)
(t431 2)
(t432 2)
(t433 0)
(t434 0)
(t435 0)
(t436 0)
(t437 0)
(t438 0)
(t439 0)
(t440 0)
(t441 0)
(t442 0)
(t443 0)
(t444 0)
(t445 0)
(t446 4)
(t447 0)
(t448 0)
(t449 0)
(t450 0)
(t451 4)
(t452 0)
(t453 0)
(t454 0)
(t455 0)
(t456 0)
(t457 0)
(t458 0)
(t459 0)
(t460 0)
(t461 0)
(t462 0)
(t463 0)
(t464 0)
(t465 0)
(t466 0)
(t467 0)
(t468 0)
(t469 0)
(t470 0)
(t471 0)
(t472 0)
(t473 4)
(t474 4)
(t475 0)
(t476 0)
(t477 0)
(t478 0)
(t479 0)
(t480 0)
(t481 0)
(t482 0)
(t483 0)
(t484 0)
(t485 0)
(t486 0)
(t487 0)
(t488 0)
(t489 0)
(t490 0)
(t491 4)
(t492 0)
(t493 0)
(t494 4)
(t495 4)
(t496 4)
(t497 4)
(t498 4)
(t499 4)
(t500 4)
(t501 0)
(t502 0)
(t503 0)
(t504 0)
(t505 0)
(t506 0)
(t507 0)
(t508 0)
(t509 0)
(t510 0)
(t511 0)
(t512 0)
(t513 0)
(t514 0)
(t515 0)
(t516 0)
(t517 0)
(t518 0)
(t519 0)
(t520 0)
(t521 0)
(t522 0)
(t523 0)
(t524 0)
(t525 0)
(t526 0)
(t527 0)
(t528 0)
(t529 0)
(t530 0)
(t531 0)
(t532 0)
(t533 0)
(t534 0)
(t535 0)
(t536 0)
(t537 0)
(t538 0)
(t539 0)
(t540 0)
(t541 0)
(t542 0)
(t543 0)
(t544 0)
(t545 0)
(t546 0)
(t547 0)
(t548 0)
(t549 0)
(t550 0)
(t551 0)
(t552 0)
(t553 0)
(t554 0)
(t555 0)
(t556 0)
(t557 0)
(t558 0)
(t559 0)
(t560 0)
(t561 0)
(t562 0)
(t563 0)
(t564 0)
(t565 0)
(t566 0)
(t567 0)
(t568 0)
(t569 0)
(t570 0)
(t571 0)
(t572 0)
(t573 0)
(t574 0)
(t575 0)
(t576 0)
(t577 0)
(t578 0)
(t579 0)
(t580 0)
(t581 0)
(t582 0)
(t583 0)
(t584 0)
(t585 0)
(t586 0)
(t587 0)
(t588 0)
(t589 0)
(t590 0)
(t591 0)
(t592 0)
(t593 0)
(t594 0)
(t595 0)
(t596 0)
(t597 0)
(t598 0)
(t599 0)
(t600 0)
(t601 0)
(t602 0)
(t603 0)
(t604 0)
(t605 0)
(t606 0)
(t607 0)
(t608 0)
(t609 0)
(t610 0)
(t611 0)
(t612 0)
(t613 0)
(t614 0)
(t615 0)
(t616 0)
(t617 0)
(t618 0)
(t619 0)
(t620 0)
(t621 0)
(t622 0)
(t623 0)
(t624 0)
(t625 0)
(t626 0)
(t627 0)
(t628 0)
(t629 0)
(t630 0)
(t631 0)
(t632 0)
(t633 0)
(t634 0)
(t635 0)
(t636 0)
(t637 2)
(t638 2)
(t639 2)
(t640 2)
(t641 2)
(t642 2)
(t643 0)
(t644 0)
(t645 0)
(t646 0)
(t647 0)
(t648 0)
(t649 0)
(t650 0)
(t651 0)
(t652 0)
(t653 0)
(t654 0)
(t655 0)
(t656 0)
(t657 0)
(t658 0)
(t659 0)
(t660 0)
(t661 0)
(t662 0)
(t663 0)
(t664 0)
(t665 0)
(t666 0)
(t667 0)
(t668 0)
(t669 0)
(t670 0)
(t671 0)
(t672 0)
(t673 0)
(t674 0)
(t675 0)
(t676 0)
(t677 0)
(t678 0)
(t679 0)
(t680 0)
(t681 0)
(t682 0)
(t683 0)
(t684 0)
(t685 0)
(t686 0)
(t687 0)
(t688 0)
(t689 0)
(t690 0)
(t691 0)
(t692 0)
(t693 0)
(t694 0)
(t695 0)
(t696 0)
(t697 0)
(t698 0)
(t699 0)
(t700 0)
(t701 0)
(t702 0)
(t703 0)
(t704 0)
(t705 0)
(t706 0)
(t707 0)
(t708 0)
(t709 0)
(t710 0)
(t711 0)
(t712 0)
(t713 0)
(t714 0)
(t715 0)
(t716 0)
(t717 0)
(t718 0)
(t719 0)
(t720 0)
(t721 0)
(t722 0)
(t723 0)
(t724 0)
(t725 0)
(t726 0)
(t727 0)
(t728 0)
(t729 0)
(t730 0)
(t731 0)
(t732 0)
(t733 0)
(t734 0)
(t735 0)
(t736 0)
(t737 0)
(t738 0)
(t739 0)
(t740 0)
(t741 0)
(t742 0)
(t743 0)
(t744 0)
(t745 0)
(t746 0)
(t747 0)
(t748 0)
(t749 0)
(t750 0)
(t751 0)
(t752 0)
(t753 0)
(t754 0)
(t755 0)
(t756 0)
(t757 0)
(t758 0)
(t759 0)
(t760 0)
(t761 0)
(t762 0)
(t763 0)
(t764 0)
(t765 0)
(t766 0)
(t767 0)
(t768 0)
(t769 0)
(t770 0)
(t771 0)
(t772 0)
(t773 0)
(t774 0)
(t775 0)
(t776 0)
(t777 0)
(t778 0)
(t779 0)
(t780 0)
(t781 0)
(t782 0)
(t783 0)
(t784 0)
(t785 0)
(t786 0)
(t787 0)
(t788 0)
(t789 0)
(t790 0)
(t791 0)
(t792 0)
(t793 0)
(t794 0)
(t795 0)
(t796 0)
(t797 0)
(t798 0)
(t799 0)
(t800 0)
(t801 0)
(t802 0)
(t803 0)
(t804 0)
(t805 0)
(t806 0)
(t807 0)
(t808 0)
(t809 0)
(t810 0)
(t811 0)
(t812 0)
(t813 0)
(t814 0)
(t815 0)
(t816 0)
(t817 0)
(t818 0)
(t819 0)
(t820 0)
(t821 0)
(t822 0)
(t823 0)
(t824 0)
(t825 0)
(t826 0)
(t827 0)
(t828 0)
(t829 0)
(t830 0)
(t831 0)
(t832 0)
(t833 0)
(t834 0)
(t835 0)
(t836 0)
(t837 0)
(t838 0)
(t839 0)
(t840 0)
(t841 0)
(t842 0)
(t843 0)
(t844 0)
(t845 0)
(t846 0)
(t847 0)
(t848 0)
(t849 0)
(t850 0)
(t851 0)
(t852 0)
(t853 0)
(t854 0)
(t855 2)
(t856 0)
(t857 0)
(t858 0)
(t859 0)
(t860 0)
(t861 0)
(t862 0)
(t863 0)
(t864 0)
(t865 0)
(t866 0)
(t867 0)
(t868 0)
(t869 0)
(t870 0)
(t871 0)
(t872 0)
(t873 0)
(t874 0)
(t875 0)
(t876 0)
(t877 0)
(t878 0)
(t879 0)
(t880 0)
(t881 0)
(t882 0)
(t883 0)
(t884 0)
(t885 0)
(t886 0)
(t887 0)
(t888 0)
(t889 0)
(t890 0)
(t891 0)
(t892 0)
(t893 0)
(t894 0)
(t895 0)
(t896 0)
(t897 0)
(t898 0)
(t899 0)
(t900 0)
(t901 0)
(t902 0)
(t903 0)
(t904 0)
(t905 0)
(t906 0)
(t907 0)
(t908 0)
(t909 0)
(t910 0)
(t911 0)
(t912 4)
(t913 0)
(t914 0)
(t915 0)
(t916 0)
(t917 4)
(t918 0)
(t919 0)
(t920 0)
(t921 0)
(t922 0)
(t923 0)
(t924 0)
(t925 0)
(t926 0)
(t927 0)
(t928 0)
(t929 0)
(t930 0)
(t931 0)
(t932 0)
(t933 0)
(t934 0)
(t935 0)
(t936 0)
(t937 0)
(t938 0)
(t939 4)
(t940 4)
(t941 0)
(t942 0)
(t943 0)
(t944 0)
(t945 0)
(t946 0)
(t947 0)
(t948 0)
(t949 0)
(t950 0)
(t951 0)
(t952 0)
(t953 0)
(t954 0)
(t955 0)
(t956 0)
(t957 4)
(t958 0)
(t959 0)
(t960 4)
(t961 6)
(t962 6)
(t963 6)
(t964 4)
(t965 4)
(t966 4)
(t967 0)
(t968 0)
(t969 0)
(t970 0)
(t971 0)
(t972 0)
(t973 0)
(t974 0)
(t975 0)
(t976 0)
(t977 0)
(t978 0)
(t979 0)
(t980 0)
(t981 0)
(t982 0)
(t983 0)
(t984 0)
(t985 0)
(t986 0)
(t987 0)
(t988 0)
(t989 0)
(t990 0)
(t991 0)
(t992 0)
(t993 0)
(t994 0)
(t995 0)
(t996 0)
(t997 0)
(t998 0)
(t999 0)
(t1000 0)
(t1001 0)
(t1002 0)
(t1003 0)
(t1004 0)
(t1005 0)
(t1006 0)
(t1007 0)
(t1008 0)
(t1009 0)
(t1010 0)
(t1011 0)
(t1012 0)
(t1013 0)
(t1014 0)
(t1015 0)
(t1016 0)
(t1017 0)
(t1018 0)
(t1019 0)
(t1020 0)
(t1021 0)
(t1022 0)
(t1023 0)
(t1024 0)
(t1025 0)
(t1026 0)
(t1027 0)
(t1028 0)
(t1029 0)
(t1030 0)
(t1031 0)
(t1032 0)
(t1033 0)
(t1034 0)
(t1035 0)
(t1036 0)
(t1037 0)
(t1038 0)
(t1039 0)
(t1040 0)
(t1041 0)
(t1042 0)
(t1043 0)
(t1044 0)
(t1045 0)
(t1046 0)
(t1047 0)
(t1048 0)
(t1049 0)
(t1050 0)
(t1051 0)
(t1052 0)
(t1053 0)
(t1054 0)
(t1055 0)
(t1056 0)
(t1057 0)
(t1058 0)
(t1059 0)
(t1060 0)
(t1061 0)
(t1062 0)
(t1063 0)
(t1064 0)
(t1065 0)
(t1066 0)
(t1067 0)
(t1068 0)
(t1069 0)
(t1070 0)
(t1071 0)
(t1072 0)
(t1073 0)
(t1074 0)
(t1075 0)
(t1076 0)
(t1077 0)
(t1078 0)
(t1079 0)
(t1080 0)
(t1081 0)
(t1082 0)
(t1083 0)
(t1084 0)
(t1085 0)
(t1086 0)
(t1087 0)
(t1088 0)
(t1089 0)
(t1090 0)
(t1091 0)
(t1092 0)
(t1093 0)
(t1094 0)
(t1095 0)
(t1096 0)
(t1097 0)
(t1098 0)
(t1099 0)
(t1100 0)
(t1101 0)
(t1102 0)
(t1103 0)
(t1104 0)
(t1105 0)
(t1106 0)
(t1107 0)
(t1108 0)
(t1109 0)
(t1110 0)
(t1111 0)
(t1112 0)
(t1113 0)
(t1114 0)
(t1115 0)
(t1116 0)
(t1117 0)
(t1118 0)
(t1119 0)
(t1120 0)
(t1121 0)
(t1122 0)
(t1123 0)
(t1124 0)
(t1125 0)
(t1126 0)
(t1127 0)
(t1128 0)
(t1129 0)
(t1130 0)
(t1131 0)
(t1132 0)
(t1133 0)
(t1134 0)
(t1135 0)
(t1136 0)
(t1137 0)
(t1138 0)
(t1139 0)
(t1140 0)
(t1141 0)
(t1142 0)
(t1143 0)
(t1144 0)
(t1145 0)
(t1146 0)
(t1147 0)
(t1148 0)
(t1149 0)
(t1150 0)
(t1151 0)
(t1152 0)
(t1153 0)
(t1154 0)
(t1155 0)
(t1156 0)
(t1157 0)
(t1158 0)
(t1159 0)
(t1160 0)
(t1161 0)
(t1162 0)
(t1163 0)
(t1164 0)
(t1165 0)
(t1166 0)
(t1167 0)
(t1168 0)
(t1169 0)
(t1170 0)
(t1171 0)
(t1172 0)
(t1173 0)
(t1174 0)
(t1175 0)
(t1176 0)
(t1177 0)
(t1178 0)
(t1179 0)
(t1180 0)
(t1181 0)
(t1182 0)
(t1183 0)
(t1184 0)
(t1185 0)
(t1186 0)
(t1187 0)
(t1188 0)
(t1189 0)
(t1190 0)
(t1191 0)
(t1192 0)
(t1193 0)
(t1194 0)
(t1195 0)
(t1196 0)
(t1197 0)
(t1198 0)
(t1199 0)
(t1200 0)
(t1201 0)
(t1202 0)
(t1203 0)
(t1204 0)
(t1205 0)
(t1206 0)
(t1207 0)
(t1208 0)
(t1209 0)
(t1210 0)
(t1211 0)
(t1212 0)
(t1213 0)
(t1214 0)
(t1215 0)
(t1216 0)
(t1217 0)
(t1218 2)
(t1219 2)
(t1220 2)
(t1221 2)
(t1222 0)
(t1223 0)
(t1224 0)
(t1225 0)
(t1226 0)
(t1227 0)
(t1228 0)
(t1229 0)
(t1230 0)
(t1231 0)
(t1232 0)
(t1233 0)
(t1234 0)
(t1235 0)
(t1236 0)
(t1237 0)
(t1238 0)
(t1239 0)
(t1240 0)
(t1241 0)
(t1242 0)
(t1243 0)
(t1244 0)
(t1245 0)
(t1246 0)
(t1247 0)
(t1248 0)
(t1249 0)
(t1250 0)
(t1251 0)
(t1252 0)
(t1253 0)
(t1254 0)
(t1255 0)
(t1256 0)
(t1257 0)
(t1258 0)
(t1259 0)
(t1260 0)
(t1261 0)
(t1262 0)
(t1263 0)
(t1264 0)
(t1265 0)
(t1266 0)
(t1267 0)
(t1268 0)
(t1269 0)
(t1270 2)
(t1271 2)
(t1272 0)
(t1273 2)
(t1274 2)
(t1275 2)
(t1276 0)
(t1277 2)
(t1278 2)
(t1279 2)
(t1280 2)
(t1281 0)
(t1282 0)
(t1283 2)
(t1284 2)
(t1285 2)
(t1286 0)
(t1287 2)
(t1288 2)
(t1289 0)
(t1290 0)
(t1291 0)
(t1292 0)
(t1293 0)
(t1294 0)
(t1295 0)
(t1296 0)
(t1297 0)
(t1298 2)
(t1299 2)
(t1300 0)
(t1301 2)
(t1302 2)
(t1303 0)
(t1304 2)
(t1305 2)
(t1306 0)
(t1307 2)
(t1308 2)
(t1309 2)
(t1310 2)
(t1311 2)
(t1312 2)
(t1313 2)
(t1314 2)
(t1315 0)
(t1316 2)
(t1317 0)
(t1318 2)
(t1319 0)
(t1320 0)
(t1321 2)
(t1322 0)
(t1323 0)
(t1324 0)
(t1325 0)
(t1326 0)
(t1327 0)
(t1328 0)
(t1329 0)
(t1330 0)
(t1331 0)
(t1332 0)
(t1333 0)
(t1334 0)
(t1335 0)
(t1336 0)
(t1337 0)
(t1338 0)
(t1339 0)
(t1340 0)
(t1341 0)
(t1342 0)
(t1343 0)
(t1344 0)
(t1345 0)
(t1346 0)
(t1347 0)
(t1348 0)
(t1349 0)
(t1350 0)
(t1351 0)
(t1352 0)
(t1353 0)
(t1354 0)
(t1355 0)
(t1356 0)
(t1357 0)
(t1358 0)
(t1359 0)
(t1360 0)
(t1361 0)
(t1362 0)
(t1363 0)
(t1364 0)
(t1365 0)
(t1366 0)
(t1367 0)
(t1368 0)
(t1369 0)
(t1370 0)
(t1371 0)
(t1372 0)
(t1373 0)
(t1374 0)
(t1375 0)
(t1376 0)
(t1377 0)
(t1378 6)
(t1379 2)
(t1380 2)
(t1381 0)
(t1382 0)
(t1383 6)
(t1384 2)
(t1385 2)
(t1386 2)
(t1387 2)
(t1388 2)
(t1389 0)
(t1390 2)
(t1391 2)
(t1392 0)
(t1393 0)
(t1394 0)
(t1395 0)
(t1396 0)
(t1397 0)
(t1398 0)
(t1399 0)
(t1400 0)
(t1401 0)
(t1402 0)
(t1403 0)
(t1404 0)
(t1405 6)
(t1406 6)
(t1407 0)
(t1408 0)
(t1409 0)
(t1410 0)
(t1411 0)
(t1412 0)
(t1413 0)
(t1414 0)
(t1415 0)
(t1416 0)
(t1417 0)
(t1418 0)
(t1419 0)
(t1420 0)
(t1421 0)
(t1422 0)
(t1423 6)
(t1424 0)
(t1425 0)
(t1426 4)
(t1427 4)
(t1428 4)
(t1429 4)
(t1430 4)
(t1431 4)
(t1432 0)
(t1433 0)
(t1434 0)
(t1435 0)
(t1436 0)
(t1437 0)
(t1438 0)
(t1439 0)
(t1440 0)
(t1441 0)
(t1442 0)
(t1443 0)
(t1444 0)
(t1445 0)
(t1446 0)
(t1447 0)
(t1448 0)
(t1449 0)
(t1450 0)
(t1451 0)
(t1452 0)
(t1453 0)
(t1454 0)
(t1455 0)
(t1456 0)
(t1457 0)
(t1458 0)
(t1459 0)
(t1460 0)
(t1461 0)
(t1462 0)
(t1463 0)
(t1464 0)
(t1465 0)
(t1466 0)
(t1467 0)
(t1468 0)
(t1469 0)
(t1470 0)
(t1471 0)
(t1472 0)
(t1473 0)
(t1474 0)
(t1475 0)
(t1476 0)
(t1477 0)
(t1478 0)
(t1479 0)
(t1480 0)
(t1481 0)
(t1482 0)
(t1483 0)
(t1484 0)
(t1485 0)
(t1486 0)
(t1487 0)
(t1488 0)
(t1489 0)
(t1490 0)
(t1491 0)
(t1492 0)
(t1493 0)
(t1494 0)
(t1495 0)
(t1496 0)
(t1497 0)
(t1498 0)
(t1499 0)
(t1500 0)
(t1501 0)
(t1502 0)
(t1503 0)
(t1504 0)
(t1505 0)
(t1506 0)
(t1507 0)
(t1508 0)
(t1509 0)
(t1510 0)
(t1511 0)
(t1512 0)
(t1513 0)
(t1514 0)
(t1515 0)
(t1516 0)
(t1517 0)
(t1518 0)
(t1519 0)
(t1520 0)
(t1521 0)
(t1522 0)
(t1523 0)
(t1524 0)
(t1525 0)
(t1526 0)
(t1527 0)
(t1528 0)
(t1529 0)
(t1530 0)
(t1531 0)
(t1532 0)
(t1533 0)
(t1534 0)
(t1535 0)
(t1536 0)
(t1537 0)
(t1538 0)
(t1539 0)
(t1540 0)
(t1541 0)
(t1542 0)
(t1543 0)
(t1544 0)
(t1545 0)
(t1546 0)
(t1547 0)
(t1548 0)
(t1549 0)
(t1550 0)
(t1551 0)
(t1552 0)
(t1553 0)
(t1554 0)
(t1555 0)
(t1556 0)
(t1557 0)
(t1558 0)
(t1559 0)
(t1560 0)
(t1561 0)
(t1562 0)
(t1563 0)
(t1564 0)
(t1565 0)
(t1566 0)
(t1567 0)
(t1568 0)
(t1569 0)
(t1570 0)
(t1571 0)
(t1572 0)
(t1573 0)
(t1574 0)
(t1575 0)
(t1576 0)
(t1577 0)
(t1578 0)
(t1579 0)
(t1580 0)
(t1581 0)
(t1582 0)
(t1583 0)
(t1584 0)
(t1585 0)
(t1586 0)
(t1587 0)
(t1588 0)
(t1589 0)
(t1590 0)
(t1591 0)
(t1592 0)
(t1593 0)
(t1594 0)
(t1595 0)
(t1596 0)
(t1597 0)
(t1598 0)
(t1599 0)
(t1600 0)
(t1601 0)
(t1602 0)
(t1603 0)
(t1604 0)
(t1605 0)
(t1606 0)
(t1607 0)
(t1608 0)
(t1609 0)
(t1610 0)
(t1611 0)
(t1612 0)
(t1613 0)
(t1614 0)
(t1615 0)
(t1616 0)
(t1617 0)
(t1618 0)
(t1619 0)
(t1620 0)
(t1621 0)
(t1622 0)
(t1623 0)
(t1624 0)
(t1625 0)
(t1626 0)
(t1627 0)
(t1628 0)
(t1629 0)
(t1630 0)
(t1631 0)
(t1632 0)
(t1633 0)
(t1634 0)
(t1635 0)
(t1636 0)
(t1637 0)
(t1638 0)
(t1639 0)
(t1640 0)
(t1641 0)
(t1642 0)
(t1643 0)
(t1644 0)
(t1645 0)
(t1646 0)
(t1647 0)
(t1648 0)
(t1649 0)
(t1650 0)
(t1651 0)
(t1652 0)
(t1653 0)
(t1654 0)
(t1655 0)
(t1656 0)
(t1657 0)
(t1658 0)
(t1659 0)
(t1660 0)
(t1661 0)
(t1662 0)
(t1663 0)
(t1664 0)
(t1665 0)
(t1666 0)
(t1667 0)
(t1668 0)
(t1669 0)
(t1670 0)
(t1671 0)
(t1672 0)
(t1673 0)
(t1674 0)
(t1675 0)
(t1676 0)
(t1677 0)
(t1678 0)
(t1679 0)
(t1680 0)
(t1681 0)
(t1682 0)
(t1683 2)
(t1684 2)
(t1685 2)
(t1686 2)
(t1687 2)
(t1688 2)
(t1689 0)
(t1690 2)
(t1691 2)
(t1692 2)
(t1693 2)
(t1694 1)
(t1695 0)
(t1696 0)
(t1697 0)
(t1698 0)
(t1699 0)
(t1700 0)
(t1701 0)
(t1702 0)
(t1703 0)
(t1704 0)
(t1705 0)
(t1706 0)
(t1707 0)
(t1708 0)
(t1709 0)
(t1710 0)
(t1711 0)
(t1712 0)
(t1713 0)
(t1714 0)
(t1715 0)
(t1716 0)
(t1717 0)
(t1718 0)
(t1719 0)
(t1720 0)
(t1721 0)
(t1722 0)
(t1723 0)
(t1724 0)
(t1725 2)
(t1726 2)
(t1727 2)
(t1728 2)
(t1729 2)
(t1730 2)
(t1731 2)
(t1732 2)
(t1733 0)
(t1734 2)
(t1735 0)
(t1736 2)
(t1737 0)
(t1738 0)
(t1739 0)
(t1740 0)
(t1741 0)
(t1742 0)
(t1743 0)
(t1744 0)
(t1745 0)
(t1746 0)
(t1747 0)
(t1748 0)
(t1749 0)
(t1750 0)
(t1751 0)
(t1752 0)
(t1753 0)
(t1754 0)
(t1755 0)
(t1756 0)
(t1757 0)
(t1758 0)
(t1759 0)
(t1760 0)
(t1761 0)
(t1762 0)
(t1763 0)
(t1764 0)
(t1765 0)
(t1766 0)
(t1767 0)
(t1768 0)
(t1769 0)
(t1770 0)
(t1771 0)
(t1772 0)
(t1773 0)
(t1774 0)
(t1775 0)
(t1776 0)
(t1777 0)
(t1778 0)
(t1779 0)
(t1780 0)
(t1781 0)
(t1782 0)
(t1783 0)
(t1784 0)
(t1785 0)
(t1786 0)
(t1787 0)
(t1788 2)
(t1789 0)
(t1790 0)
(t1791 0)
(t1792 0)
(t1793 0)
(t1794 0)
(t1795 0)
(t1796 0)
(t1797 0)
(t1798 0)
(t1799 0)
(t1800 0)
(t1801 0)
(t1802 0)
(t1803 0)
(t1804 0)
(t1805 0)
(t1806 0)
(t1807 0)
(t1808 0)
(t1809 0)
(t1810 0)
(t1811 0)
(t1812 0)
(t1813 0)
(t1814 0)
(t1815 0)
(t1816 0)
(t1817 0)
(t1818 0)
(t1819 0)
(t1820 0)
(t1821 0)
(t1822 0)
(t1823 0)
(t1824 0)
(t1825 0)
(t1826 0)
(t1827 0)
(t1828 0)
(t1829 0)
(t1830 0)
(t1831 0)
(t1832 0)
(t1833 0)
(t1834 0)
(t1835 0)
(t1836 0)
(t1837 0)
(t1838 0)
(t1839 0)
(t1840 0)
(t1841 0)
(t1842 0)
(t1843 0)
(t1844 0)
(t1845 4)
(t1846 0)
(t1847 0)
(t1848 0)
(t1849 0)
(t1850 4)
(t1851 0)
(t1852 0)
(t1853 0)
(t1854 0)
(t1855 0)
(t1856 0)
(t1857 0)
(t1858 0)
(t1859 0)
(t1860 0)
(t1861 0)
(t1862 0)
(t1863 0)
(t1864 0)
(t1865 0)
(t1866 0)
(t1867 0)
(t1868 0)
(t1869 0)
(t1870 0)
(t1871 0)
(t1872 4)
(t1873 4)
(t1874 0)
(t1875 0)
(t1876 0)
(t1877 0)
(t1878 0)
(t1879 0)
(t1880 0)
(t1881 0)
(t1882 0)
(t1883 0)
(t1884 0)
(t1885 0)
(t1886 0)
(t1887 0)
(t1888 0)
(t1889 0)
(t1890 4)
(t1891 0)
(t1892 0)
(t1893 18)
(t1894 18)
(t1895 18)
(t1896 18)
(t1897 18)
(t1898 18)
(t1899 18)
(t1900 18)
(t1901 18)
(t1902 18)
(t1903 18)
(t1904 2)
(t1905 2)
(t1906 2)
(t1907 2)
(t1908 2)
(t1909 2)
(t1910 2)
(t1911 2)
(t1912 2)
(t1913 2)
(t1914 2)
(t1915 2)
(t1916 2)
(t1917 2)
(t1918 2)
(t1919 2)
(t1920 2)
(t1921 2)
(t1922 0)
(t1923 0)
(t1924 0)
(t1925 0)
(t1926 0)
(t1927 0)
(t1928 0)
(t1929 0)
(t1930 0)
(t1931 0)
(t1932 0)
(t1933 0)
(t1934 0)
(t1935 0)
(t1936 0)
(t1937 0)
(t1938 0)
(t1939 0)
(t1940 0)
(t1941 0)
(t1942 0)
(t1943 0)
(t1944 0)
(t1945 0)
(t1946 0)
(t1947 0)
(t1948 0)
(t1949 0)
(t1950 0)
(t1951 0)
(t1952 0)
(t1953 0)
(t1954 0)
(t1955 0)
(t1956 0)
(t1957 0)
(t1958 0)
(t1959 0)
(t1960 0)
(t1961 0)
(t1962 0)
(t1963 0)
(t1964 0)
(t1965 0)
(t1966 2)
(t1967 0)
(t1968 0)
(t1969 0)
(t1970 0)
(t1971 0)
(t1972 0)
(t1973 0)
(t1974 0)
(t1975 2)
(t1976 2)
(t1977 0)
(t1978 0)
(t1979 0)
(t1980 0)
(t1981 0)
(t1982 0)
(t1983 0)
(t1984 0)
(t1985 0)
(t1986 2)
(t1987 0)
(t1988 0)
(t1989 0)
(t1990 0)
(t1991 0)
(t1992 0)
(t1993 0)
(t1994 2)
(t1995 2)
(t1996 0)
(t1997 0)
(t1998 0)
(t1999 0)
(t2000 0)
(t2001 0)
(t2002 0)
(t2003 0)
(t2004 0)
(t2005 2)
(t2006 0)
(t2007 0)
(t2008 0)
(t2009 0)
(t2010 0)
(t2011 0)
(t2012 0)
(t2013 0)
(t2014 0)
(t2015 0)
(t2016 0)
(t2017 0)
(t2018 0)
(t2019 0)
(t2020 0)
(t2021 0)
(t2022 0)
(t2023 0)
(t2024 0)
(t2025 0)
(t2026 0)
(t2027 0)
(t2028 0)
(t2029 0)
(t2030 0)
(t2031 0)
(t2032 0)
(t2033 0)
(t2034 0)
(t2035 0)
(t2036 0)
(t2037 0)
(t2038 0)
(t2039 0)
(t2040 0)
(t2041 0)
(t2042 0)
(t2043 0)
(t2044 0)
(t2045 0)
(t2046 0)
(t2047 0)
(t2048 0)
(t2049 0)
(t2050 0)
(t2051 0)
(t2052 0)
(t2053 0)
(t2054 0)
(t2055 0)
(t2056 0)
(t2057 0)
(t2058 0)
(t2059 0)
(t2060 0)
(t2061 0)
(t2062 0)
(t2063 0)
(t2064 0)
(t2065 0)
(t2066 0)
(t2067 0)
(t2068 0)
(t2069 0)
(t2070 0)
(t2071 0)
(t2072 0)
(t2073 0)
(t2074 0)
(t2075 0)
(t2076 0)
(t2077 0)
(t2078 0)
(t2079 0)
(t2080 0)
(t2081 0)
(t2082 0)
(t2083 0)
(t2084 0)
(t2085 0)
(t2086 0)
(t2087 0)
(t2088 0)
(t2089 0)
(t2090 0)
(t2091 0)
(t2092 0)
(t2093 0)
(t2094 0)
(t2095 0)
(t2096 0)
(t2097 0)
(t2098 0)
(t2099 0)
(t2100 0)
(t2101 0)
(t2102 0)
(t2103 0)
(t2104 0)
(t2105 0)
(t2106 0)
(t2107 0)
(t2108 0)
(t2109 0)
(t2110 0)
(t2111 0)
(t2112 0)
(t2113 0)
(t2114 0)
(t2115 0)
(t2116 0)
(t2117 0)
(t2118 0)
(t2119 0)
(t2120 0)
(t2121 0)
(t2122 0)
(t2123 0)
(t2124 0)
(t2125 0)
(t2126 0)
(t2127 0)
(t2128 0)
(t2129 0)
(t2130 0)
(t2131 0)
(t2132 0)
(t2133 0)
(t2134 0)
(t2135 0)
(t2136 0)
(t2137 0)
(t2138 0)
(t2139 0)
(t2140 0)
(t2141 0)
(t2142 0)
(t2143 0)
(t2144 0)
(t2145 0)
(t2146 0)
(t2147 0)
(t2148 0)
(t2149 0)
(t2150 0)
(t2151 0)
(t2152 0)
(t2153 0)
(t2154 0)
(t2155 0)
(t2156 0)
(t2157 0)
(t2158 0)
(t2159 0)
(t2160 0)
(t2161 0)
(t2162 0)
(t2163 0)
(t2164 0)
(t2165 0)
(t2166 0)
(t2167 0)
(t2168 0)
(t2169 0)
(t2170 0)
(t2171 0)
(t2172 0)
(t2173 0)
(t2174 0)
(t2175 0)
(t2176 0)
(t2177 0)
(t2178 0)
(t2179 0)
(t2180 0)
(t2181 2)
(t2182 2)
(t2183 2)
(t2184 0)
(t2185 0)
(t2186 0)
(t2187 0)
(t2188 0)
(t2189 0)
(t2190 0)
(t2191 0)
(t2192 0)
(t2193 0)
(t2194 0)
(t2195 0)
(t2196 0)
(t2197 0)
(t2198 0)
(t2199 0)
(t2200 0)
(t2201 0)
(t2202 0)
(t2203 0)
(t2204 0)
(t2205 0)
(t2206 0)
(t2207 0)
(t2208 0)
(t2209 0)
(t2210 0)
(t2211 0)
(t2212 0)
(t2213 0)
(t2214 0)
(t2215 0)
(t2216 0)
(t2217 0)
(t2218 0)
(t2219 0)
(t2220 0)
(t2221 0)
(t2222 0)
(t2223 0)
(t2224 0)
(t2225 0)
(t2226 0)
(t2227 0)
(t2228 0)
(t2229 0)
(t2230 0)
(t2231 0)
(t2232 0)
(t2233 0)
(t2234 0)
(t2235 0)
(t2236 0)
(t2237 0)
(t2238 0)
(t2239 0)
(t2240 0)
(t2241 0)
(t2242 0)
(t2243 0)
(t2244 0)
(t2245 0)
(t2246 0)
(t2247 0)
(t2248 0)
(t2249 0)
(t2250 0)
(t2251 0)
(t2252 0)
(t2253 0)
(t2254 0)
(t2255 0)
(t2256 0)
(t2257 0)
(t2258 0)
(t2259 0)
(t2260 0)
(t2261 0)
(t2262 0)
(t2263 0)
(t2264 0)
(t2265 0)
(t2266 0)
(t2267 0)
(t2268 0)
(t2269 0)
(t2270 0)
(t2271 0)
(t2272 0)
(t2273 0)
(t2274 0)
(t2275 0)
(t2276 0)
(t2277 0)
(t2278 0)
(t2279 0)
(t2280 0)
(t2281 0)
(t2282 0)
(t2283 0)
(t2284 0)
(t2285 0)
(t2286 0)
(t2287 0)
(t2288 0)
(t2289 0)
(t2290 0)
(t2291 0)
(t2292 0)
(t2293 0)
(t2294 0)
(t2295 0)
(t2296 0)
(t2297 0)
(t2298 0)
(t2299 0)
(t2300 0)
(t2301 0)
(t2302 0)
(t2303 0)
(t2304 0)
(t2305 0)
(t2306 0)
(t2307 0)
(t2308 0)
(t2309 0)
(t2310 0)
(t2311 0)
(t2312 0)
(t2313 0)
(t2314 0)
(t2315 0)
(t2316 0)
(t2317 0)
(t2318 2)
(t2319 0)
(t2320 0)
(t2321 0)
(t2322 0)
(t2323 0)
(t2324 0)
(t2325 0)
(t2326 0)
(t2327 0)
(t2328 0)
(t2329 0)
(t2330 0)
(t2331 0)
(t2332 0)
(t2333 0)
(t2334 0)
(t2335 0)
(t2336 0)
(t2337 0)
(t2338 0)
(t2339 0)
(t2340 0)
(t2341 0)
(t2342 0)
(t2343 0)
(t2344 0)
(t2345 0)
(t2346 0)
(t2347 0)
(t2348 0)
(t2349 0)
(t2350 0)
(t2351 0)
(t2352 0)
(t2353 0)
(t2354 0)
(t2355 0)
(t2356 0)
(t2357 0)
(t2358 0)
(t2359 0)
(t2360 0)
(t2361 0)
(t2362 0)
(t2363 0)
(t2364 0)
(t2365 0)
(t2366 0)
(t2367 0)
(t2368 0)
(t2369 0)
(t2370 0)
(t2371 0)
(t2372 0)
(t2373 0)
(t2374 0)
(t2375 0)
(t2376 0)
(t2377 0)
(t2378 0)
(t2379 0)
(t2380 0)
(t2381 0)
(t2382 0)
(t2383 0)
(t2384 0)
(t2385 0)
(t2386 0)
(t2387 0)
(t2388 0)
(t2389 0)
(t2390 0)
(t2391 0)
(t2392 0)
(t2393 0)
(t2394 0)
(t2395 0)
(t2396 0)
(t2397 0)
(t2398 0)
(t2399 0)
(t2400 0)
(t2401 0)
(t2402 0)
(t2403 0)
(t2404 0)
(t2405 0)
(t2406 0)
(t2407 0)
(t2408 0)
(t2409 0)
(t2410 0)
(t2411 0)
(t2412 0)
(t2413 0)
(t2414 0)
(t2415 0)
(t2416 0)
(t2417 0)
(t2418 0)
(t2419 0)
(t2420 0)
(t2421 0)
(t2422 0)
(t2423 0)
(t2424 0)
(t2425 0)
(t2426 0)
(t2427 0)
(t2428 0)
(t2429 0)
(t2430 0)
(t2431 0)
(t2432 0)
(t2433 0)
(t2434 0)
(t2435 0)
(t2436 0)
(t2437 0)
(t2438 0)
(t2439 0)
(t2440 0)
(t2441 0)
(t2442 0)
(t2443 0)
(t2444 0)
(t2445 0)
(t2446 0)
(t2447 0)
(t2448 0)
(t2449 0)
(t2450 0)
(t2451 0)
(t2452 0)
(t2453 0)
(t2454 0)
(t2455 0)
(t2456 0)
(t2457 0)
(t2458 0)
(t2459 0)
(t2460 0)
(t2461 0)
(t2462 2)
(t2463 2)
(t2464 4)
(t2465 4)
(t2466 4)
(t2467 4)
(t2468 4)
(t2469 4)
(t2470 14)
(t2471 14)
(t2472 0)
(t2473 2)
(t2474 2)
(t2475 0)
(t2476 0)
(t2477 0)
(t2478 2)
(t2479 4)
(t2480 4)
(t2481 4)
(t2482 4)
(t2483 0)
(t2484 0)
(t2485 0)
(t2486 0)
(t2487 0)
(t2488 0)
(t2489 0)
(t2490 0)
(t2491 0)
(t2492 0)
(t2493 0)
(t2494 0)
(t2495 0)
(t2496 0)
(t2497 0)
(t2498 0)
(t2499 0)
(t2500 0)
(t2501 0)
(t2502 0)
(t2503 0)
(t2504 0)
(t2505 0)
(t2506 0)
(t2507 0)
(t2508 0)
(t2509 0)
(t2510 0)
(t2511 2)
(t2512 0)
(t2513 0)
(t2514 0)
(t2515 0)
(t2516 0)
(t2517 0)
(t2518 0)
(t2519 0)
(t2520 0)
(t2521 0)
(t2522 0)
(t2523 0)
(t2524 0)
(t2525 0)
(t2526 0)
(t2527 0)
(t2528 0)
(t2529 0)
(t2530 0)
(t2531 2)
(t2532 0)
(t2533 0)
(t2534 0)
(t2535 0)
(t2536 0)
(t2537 0)
(t2538 0)
(t2539 0)
(t2540 0)
(t2541 0)
(t2542 0)
(t2543 0)
(t2544 0)
(t2545 0)
(t2546 0)
(t2547 0)
(t2548 0)
(t2549 0)
(t2550 0)
(t2551 2)
(t2552 0)
(t2553 0)
(t2554 0)
(t2555 0)
(t2556 0)
(t2557 0)
(t2558 0)
(t2559 0)
(t2560 0)
(t2561 0)
(t2562 0)
(t2563 0)
(t2564 0)
(t2565 0)
(t2566 0)
(t2567 0)
(t2568 0)
(t2569 0)
(t2570 0)
(t2571 0)
(t2572 0)
(t2573 0)
(t2574 0)
(t2575 0)
(t2576 0)
(t2577 0)
(t2578 0)
(t2579 0)
(t2580 0)
(t2581 0)
(t2582 0)
(t2583 0)
(t2584 0)
(t2585 0)
(t2586 0)
(t2587 4)
(t2588 4)
(t2589 0)
(t2590 0)
(t2591 0)
(t2592 0)
(t2593 0)
(t2594 0)
(t2595 0)
(t2596 0)
(t2597 0)
(t2598 0)
(t2599 0)
(t2600 0)
(t2601 0)
(t2602 0)
(t2603 0)
(t2604 0)
(t2605 0)
(t2606 0)
(t2607 0)
(t2608 0)
(t2609 0)
(t2610 0)
(t2611 0)
(t2612 0)
(t2613 4)
(t2614 0)
(t2615 0)
(t2616 0)
(t2617 0)
(t2618 0)
(t2619 0)
(t2620 0)
(t2621 0)
(t2622 0)
(t2623 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4724/4739 variables, and 2078 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5026 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 2068/2076 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10063ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 2076 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2076/2076 places, 2663/2663 transitions.
Graph (trivial) has 2542 edges and 2076 vertex of which 980 / 2076 are part of one of the 88 SCC in 2 ms
Free SCC test removed 892 places
Drop transitions (Empty/Sink Transition effects.) removed 1133 transitions
Reduce isomorphic transitions removed 1133 transitions.
Graph (complete) has 1758 edges and 1184 vertex of which 1173 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 660 transitions
Trivial Post-agglo rules discarded 660 transitions
Performed 660 trivial Post agglomeration. Transition count delta: 660
Iterating post reduction 0 with 669 rules applied. Total rules applied 671 place count 1173 transition count 856
Reduce places removed 660 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 1 with 749 rules applied. Total rules applied 1420 place count 513 transition count 767
Reduce places removed 58 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 59 rules applied. Total rules applied 1479 place count 455 transition count 766
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1480 place count 454 transition count 766
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 66 Pre rules applied. Total rules applied 1480 place count 454 transition count 700
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 1612 place count 388 transition count 700
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1627 place count 373 transition count 678
Iterating global reduction 4 with 15 rules applied. Total rules applied 1642 place count 373 transition count 678
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 1646 place count 373 transition count 674
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1650 place count 369 transition count 674
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1660 place count 359 transition count 662
Iterating global reduction 6 with 10 rules applied. Total rules applied 1670 place count 359 transition count 662
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1678 place count 359 transition count 654
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1680 place count 357 transition count 642
Iterating global reduction 7 with 2 rules applied. Total rules applied 1682 place count 357 transition count 642
Performed 188 Post agglomeration using F-continuation condition with reduction of 127 identical transitions.
Deduced a syphon composed of 188 places in 0 ms
Reduce places removed 188 places and 0 transitions.
Iterating global reduction 7 with 376 rules applied. Total rules applied 2058 place count 169 transition count 327
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 2074 place count 169 transition count 311
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2078 place count 165 transition count 307
Iterating global reduction 8 with 4 rules applied. Total rules applied 2082 place count 165 transition count 307
Performed 17 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 2116 place count 148 transition count 286
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 2135 place count 148 transition count 267
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 9 with 2 rules applied. Total rules applied 2137 place count 147 transition count 266
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2139 place count 147 transition count 264
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 10 with 2 rules applied. Total rules applied 2141 place count 146 transition count 263
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2144 place count 146 transition count 260
Performed 43 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 11 with 86 rules applied. Total rules applied 2230 place count 103 transition count 302
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 11 with 66 rules applied. Total rules applied 2296 place count 103 transition count 236
Discarding 31 places :
Symmetric choice reduction at 12 with 31 rule applications. Total rules 2327 place count 72 transition count 198
Iterating global reduction 12 with 31 rules applied. Total rules applied 2358 place count 72 transition count 198
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 12 with 18 rules applied. Total rules applied 2376 place count 72 transition count 180
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 2384 place count 64 transition count 164
Iterating global reduction 13 with 8 rules applied. Total rules applied 2392 place count 64 transition count 164
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 2400 place count 64 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 14 with 36 rules applied. Total rules applied 2436 place count 64 transition count 120
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 2440 place count 60 transition count 110
Iterating global reduction 14 with 4 rules applied. Total rules applied 2444 place count 60 transition count 110
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 2447 place count 57 transition count 107
Iterating global reduction 14 with 3 rules applied. Total rules applied 2450 place count 57 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 2453 place count 57 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 2457 place count 57 transition count 100
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2462 place count 57 transition count 95
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 2468 place count 52 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 2469 place count 52 transition count 93
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 2472 place count 52 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 2473 place count 51 transition count 92
Applied a total of 2473 rules in 73 ms. Remains 51 /2076 variables (removed 2025) and now considering 92/2663 (removed 2571) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 51/2076 places, 92/2663 transitions.
RANDOM walk for 2809 steps (58 resets) in 13 ms. (200 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (OR p1 p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT p0)), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 8 factoid took 327 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Product exploration explored 100000 steps with 545 reset in 180 ms.
Product exploration explored 100000 steps with 549 reset in 191 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Support contains 3 out of 2076 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2076/2076 places, 2663/2663 transitions.
Graph (trivial) has 2542 edges and 2076 vertex of which 980 / 2076 are part of one of the 88 SCC in 2 ms
Free SCC test removed 892 places
Ensure Unique test removed 1044 transitions
Reduce isomorphic transitions removed 1044 transitions.
Graph (complete) has 1846 edges and 1184 vertex of which 1173 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 637 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 637 rules applied. Total rules applied 639 place count 1173 transition count 1613
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 655 place count 1173 transition count 1597
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 655 place count 1173 transition count 1614
Deduced a syphon composed of 665 places in 1 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 683 place count 1173 transition count 1614
Discarding 379 places :
Symmetric choice reduction at 2 with 379 rule applications. Total rules 1062 place count 794 transition count 1221
Deduced a syphon composed of 308 places in 1 ms
Iterating global reduction 2 with 379 rules applied. Total rules applied 1441 place count 794 transition count 1221
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1458 place count 777 transition count 1198
Deduced a syphon composed of 305 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1475 place count 777 transition count 1198
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1483 place count 777 transition count 1190
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1500 place count 760 transition count 1173
Deduced a syphon composed of 291 places in 0 ms
Iterating global reduction 3 with 17 rules applied. Total rules applied 1517 place count 760 transition count 1173
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1520 place count 757 transition count 1167
Deduced a syphon composed of 291 places in 1 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 1523 place count 757 transition count 1167
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1525 place count 755 transition count 1163
Deduced a syphon composed of 291 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1527 place count 755 transition count 1163
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1531 place count 751 transition count 1159
Deduced a syphon composed of 289 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1535 place count 751 transition count 1159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1537 place count 749 transition count 1155
Deduced a syphon composed of 289 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1539 place count 749 transition count 1155
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1541 place count 747 transition count 1151
Deduced a syphon composed of 289 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1543 place count 747 transition count 1151
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1547 place count 743 transition count 1147
Deduced a syphon composed of 287 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1551 place count 743 transition count 1147
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1553 place count 741 transition count 1143
Deduced a syphon composed of 287 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1555 place count 741 transition count 1143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1557 place count 739 transition count 1139
Deduced a syphon composed of 287 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1559 place count 739 transition count 1139
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1563 place count 735 transition count 1133
Deduced a syphon composed of 285 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1567 place count 735 transition count 1133
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1571 place count 731 transition count 1117
Deduced a syphon composed of 283 places in 1 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1575 place count 731 transition count 1117
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1579 place count 727 transition count 1113
Deduced a syphon composed of 281 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1583 place count 727 transition count 1113
Performed 142 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 423 places in 0 ms
Iterating global reduction 3 with 142 rules applied. Total rules applied 1725 place count 727 transition count 1213
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 3 with 53 rules applied. Total rules applied 1778 place count 727 transition count 1160
Discarding 135 places :
Symmetric choice reduction at 4 with 135 rule applications. Total rules 1913 place count 592 transition count 1012
Deduced a syphon composed of 301 places in 0 ms
Iterating global reduction 4 with 135 rules applied. Total rules applied 2048 place count 592 transition count 1012
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 2056 place count 584 transition count 1000
Deduced a syphon composed of 293 places in 1 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 2064 place count 584 transition count 1000
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 302 places in 0 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 2073 place count 584 transition count 1000
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2079 place count 584 transition count 994
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 2098 place count 565 transition count 970
Deduced a syphon composed of 288 places in 0 ms
Iterating global reduction 5 with 19 rules applied. Total rules applied 2117 place count 565 transition count 970
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 2125 place count 565 transition count 962
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 2130 place count 560 transition count 957
Deduced a syphon composed of 283 places in 0 ms
Iterating global reduction 6 with 5 rules applied. Total rules applied 2135 place count 560 transition count 957
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 287 places in 0 ms
Iterating global reduction 6 with 4 rules applied. Total rules applied 2139 place count 560 transition count 957
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2147 place count 560 transition count 949
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2151 place count 556 transition count 945
Deduced a syphon composed of 283 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2155 place count 556 transition count 945
Performed 96 Post agglomeration using F-continuation condition with reduction of 160 identical transitions.
Deduced a syphon composed of 379 places in 1 ms
Iterating global reduction 7 with 96 rules applied. Total rules applied 2251 place count 556 transition count 1385
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 162 transitions.
Iterating post reduction 7 with 162 rules applied. Total rules applied 2413 place count 556 transition count 1223
Discarding 169 places :
Symmetric choice reduction at 8 with 169 rule applications. Total rules 2582 place count 387 transition count 773
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 8 with 169 rules applied. Total rules applied 2751 place count 387 transition count 773
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 2771 place count 387 transition count 753
Discarding 36 places :
Symmetric choice reduction at 9 with 36 rule applications. Total rules 2807 place count 351 transition count 677
Deduced a syphon composed of 186 places in 0 ms
Iterating global reduction 9 with 36 rules applied. Total rules applied 2843 place count 351 transition count 677
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 190 places in 1 ms
Iterating global reduction 9 with 4 rules applied. Total rules applied 2847 place count 351 transition count 741
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2851 place count 347 transition count 705
Deduced a syphon composed of 186 places in 0 ms
Iterating global reduction 9 with 4 rules applied. Total rules applied 2855 place count 347 transition count 705
Deduced a syphon composed of 186 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 9 with 72 rules applied. Total rules applied 2927 place count 347 transition count 633
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 2932 place count 342 transition count 628
Deduced a syphon composed of 181 places in 0 ms
Iterating global reduction 9 with 5 rules applied. Total rules applied 2937 place count 342 transition count 628
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 185 places in 0 ms
Iterating global reduction 9 with 4 rules applied. Total rules applied 2941 place count 342 transition count 708
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2945 place count 338 transition count 688
Deduced a syphon composed of 181 places in 0 ms
Iterating global reduction 9 with 4 rules applied. Total rules applied 2949 place count 338 transition count 688
Deduced a syphon composed of 181 places in 0 ms
Applied a total of 2949 rules in 366 ms. Remains 338 /2076 variables (removed 1738) and now considering 688/2663 (removed 1975) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:26:22] [INFO ] Redundant transitions in 6 ms returned []
Running 687 sub problems to find dead transitions.
[2025-05-30 11:26:22] [INFO ] Flow matrix only has 610 transitions (discarded 78 similar events)
// Phase 1: matrix 610 rows 338 cols
[2025-05-30 11:26:22] [INFO ] Computed 0 invariants in 2 ms
[2025-05-30 11:26:22] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 687 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 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 TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 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 TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
At refinement iteration 1 (OVERLAPS) 609/946 variables, 337/337 constraints. Problems are: Problem set: 326 solved, 361 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/946 variables, 3/340 constraints. Problems are: Problem set: 326 solved, 361 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/946 variables, 0/340 constraints. Problems are: Problem set: 326 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 1/947 variables, 1/341 constraints. Problems are: Problem set: 326 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/947 variables, 0/341 constraints. Problems are: Problem set: 326 solved, 361 unsolved
SMT process timed out in 30165ms, After SMT, problems are : Problem set: 326 solved, 361 unsolved
Search for dead transitions found 326 dead transitions in 30167ms
Found 326 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 326 transitions
Dead transitions reduction (with SMT) removed 326 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 338/2076 places, 362/2663 transitions.
Graph (complete) has 560 edges and 338 vertex of which 157 are kept as prefixes of interest. Removing 181 places using SCC suffix rule.1 ms
Discarding 181 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 157 /338 variables (removed 181) and now considering 362/362 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 157/2076 places, 362/2663 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30556 ms. Remains : 157/2076 places, 362/2663 transitions.
Built C files in :
/tmp/ltsmin13483721914283016220
[2025-05-30 11:26:52] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13483721914283016220
Running compilation step : cd /tmp/ltsmin13483721914283016220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13483721914283016220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13483721914283016220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 2076 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2076/2076 places, 2663/2663 transitions.
Applied a total of 0 rules in 105 ms. Remains 2076 /2076 variables (removed 0) and now considering 2663/2663 (removed 0) transitions.
// Phase 1: matrix 2663 rows 2076 cols
[2025-05-30 11:26:55] [INFO ] Computed 5 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:26:55] [INFO ] Implicit Places using invariants in 359 ms returned []
[2025-05-30 11:26:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:26:57] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 1874 ms to find 0 implicit places.
Running 2662 sub problems to find dead transitions.
[2025-05-30 11:26:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2075 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2662 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2075/4739 variables, and 5 constraints, problems are : Problem set: 0 solved, 2662 unsolved in 30052 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2076 constraints, PredecessorRefiner: 2662/2662 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2662 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2075 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2662 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2075/4739 variables, and 5 constraints, problems are : Problem set: 0 solved, 2662 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2076 constraints, PredecessorRefiner: 0/2662 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60777ms problems are : Problem set: 0 solved, 2662 unsolved
Search for dead transitions found 0 dead transitions in 60781ms
Finished structural reductions in LTL mode , in 1 iterations and 62770 ms. Remains : 2076/2076 places, 2663/2663 transitions.
Built C files in :
/tmp/ltsmin10924254635833887469
[2025-05-30 11:27:58] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10924254635833887469
Running compilation step : cd /tmp/ltsmin10924254635833887469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10924254635833887469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10924254635833887469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-30 11:28:01] [INFO ] Flatten gal took : 37 ms
[2025-05-30 11:28:01] [INFO ] Flatten gal took : 37 ms
[2025-05-30 11:28:01] [INFO ] Time to serialize gal into /tmp/LTL12023136575346346568.gal : 7 ms
[2025-05-30 11:28:01] [INFO ] Time to serialize properties into /tmp/LTL2947127926799162362.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12023136575346346568.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11374619054363503850.hoa' '-atoms' '/tmp/LTL2947127926799162362.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2947127926799162362.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11374619054363503850.hoa
Detected timeout of ITS tools.
[2025-05-30 11:28:16] [INFO ] Flatten gal took : 39 ms
[2025-05-30 11:28:16] [INFO ] Flatten gal took : 54 ms
[2025-05-30 11:28:16] [INFO ] Time to serialize gal into /tmp/LTL18152337287152375705.gal : 6 ms
[2025-05-30 11:28:16] [INFO ] Time to serialize properties into /tmp/LTL1104979322543418006.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/LTL18152337287152375705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1104979322543418006.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p2963==0)")||(X(G(("(p778==1)")U("(p1129!=1)"))))))))
Formula 0 simplified : XF(!"(p2963==0)" & XF(!"(p778==1)" R !"(p1129!=1)"))
Detected timeout of ITS tools.
[2025-05-30 11:28:31] [INFO ] Flatten gal took : 42 ms
[2025-05-30 11:28:31] [INFO ] Applying decomposition
[2025-05-30 11:28:31] [INFO ] Flatten gal took : 40 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/graph407192295979779462.txt' '-o' '/tmp/graph407192295979779462.bin' '-w' '/tmp/graph407192295979779462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph407192295979779462.bin' '-l' '-1' '-v' '-w' '/tmp/graph407192295979779462.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:28:31] [INFO ] Decomposing Gal with order
[2025-05-30 11:28:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:28:32] [INFO ] Removed a total of 681 redundant transitions.
[2025-05-30 11:28:32] [INFO ] Flatten gal took : 76 ms
[2025-05-30 11:28:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 20 ms.
[2025-05-30 11:28:32] [INFO ] Time to serialize gal into /tmp/LTL3682873833374382988.gal : 18 ms
[2025-05-30 11:28:32] [INFO ] Time to serialize properties into /tmp/LTL3649814332435783761.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/LTL3682873833374382988.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3649814332435783761.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i35.i0.i1.u692.p2963==0)")||(X(G(("(i7.i1.i2.u151.p778==1)")U("(i14.i2.i1.u241.p1129!=1)"))))))))
Formula 0 simplified : XF(!"(i35.i0.i1.u692.p2963==0)" & XF(!"(i7.i1.i2.u151.p778==1)" R !"(i14.i2.i1.u241.p1129!=1)"))
Detected timeout of ITS tools.
Treatment of property CloudReconfiguration-PT-401-LTLFireability-12 finished in 299235 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(X(F(p0)))))))'
Support contains 1 out of 2119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2119/2119 places, 2715/2715 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 2103 transition count 2699
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 2103 transition count 2699
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 2103 transition count 2697
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 2096 transition count 2690
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 2096 transition count 2690
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 2090 transition count 2684
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 2090 transition count 2684
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 2090 transition count 2682
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 2086 transition count 2678
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 2086 transition count 2678
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 2086 transition count 2677
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 74 place count 2083 transition count 2674
Iterating global reduction 3 with 3 rules applied. Total rules applied 77 place count 2083 transition count 2674
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 80 place count 2080 transition count 2669
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 2080 transition count 2669
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 2078 transition count 2666
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 2078 transition count 2666
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 2076 transition count 2664
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 2076 transition count 2664
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 2076 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 2075 transition count 2662
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 2075 transition count 2662
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 95 place count 2074 transition count 2661
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 2074 transition count 2661
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 2073 transition count 2660
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 2073 transition count 2660
Applied a total of 98 rules in 1274 ms. Remains 2073 /2119 variables (removed 46) and now considering 2660/2715 (removed 55) transitions.
// Phase 1: matrix 2660 rows 2073 cols
[2025-05-30 11:28:48] [INFO ] Computed 5 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:28:48] [INFO ] Implicit Places using invariants in 327 ms returned []
[2025-05-30 11:28:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:28:50] [INFO ] Implicit Places using invariants and state equation in 1373 ms returned []
Implicit Place search using SMT with State Equation took 1701 ms to find 0 implicit places.
Running 2659 sub problems to find dead transitions.
[2025-05-30 11:28:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2072 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2072/4733 variables, and 5 constraints, problems are : Problem set: 0 solved, 2659 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2073 constraints, PredecessorRefiner: 2659/2659 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2659 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2072 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2072/4733 variables, and 5 constraints, problems are : Problem set: 0 solved, 2659 unsolved in 30047 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/2073 constraints, PredecessorRefiner: 0/2659 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60718ms problems are : Problem set: 0 solved, 2659 unsolved
Search for dead transitions found 0 dead transitions in 60722ms
Starting structural reductions in LTL mode, iteration 1 : 2073/2119 places, 2660/2715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63706 ms. Remains : 2073/2119 places, 2660/2715 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-15
Stuttering criterion allowed to conclude after 161 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-401-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-401-LTLFireability-15 finished in 64001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(F(p0))||G(p1)) U X((X(p2) U ((p3&&X(p2))||X(G(p2))))))))'
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||F((G(F((G(F(!p1))||(p2&&F(!p1)))))||(X(X(p3))&&F((G(F(!p1))||(p2&&F(!p1)))))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(G((p1 U p2)))))))'
Found a Lengthening insensitive property : CloudReconfiguration-PT-401-LTLFireability-12
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Support contains 3 out of 2119 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2119/2119 places, 2715/2715 transitions.
Graph (trivial) has 2592 edges and 2119 vertex of which 988 / 2119 are part of one of the 88 SCC in 2 ms
Free SCC test removed 900 places
Ensure Unique test removed 1055 transitions
Reduce isomorphic transitions removed 1055 transitions.
Graph (complete) has 1890 edges and 1219 vertex of which 1207 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.4 ms
Discarding 12 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 658 transitions
Trivial Post-agglo rules discarded 658 transitions
Performed 658 trivial Post agglomeration. Transition count delta: 658
Iterating post reduction 0 with 659 rules applied. Total rules applied 661 place count 1206 transition count 993
Reduce places removed 658 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 690 rules applied. Total rules applied 1351 place count 548 transition count 961
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 1368 place count 532 transition count 960
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1369 place count 531 transition count 960
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 66 Pre rules applied. Total rules applied 1369 place count 531 transition count 894
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 1501 place count 465 transition count 894
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 1526 place count 440 transition count 856
Iterating global reduction 4 with 25 rules applied. Total rules applied 1551 place count 440 transition count 856
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1554 place count 440 transition count 853
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1557 place count 437 transition count 853
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1557 place count 437 transition count 851
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1561 place count 435 transition count 851
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1577 place count 419 transition count 829
Iterating global reduction 6 with 16 rules applied. Total rules applied 1593 place count 419 transition count 829
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1601 place count 419 transition count 821
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1604 place count 416 transition count 815
Iterating global reduction 7 with 3 rules applied. Total rules applied 1607 place count 416 transition count 815
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1609 place count 414 transition count 811
Iterating global reduction 7 with 2 rules applied. Total rules applied 1611 place count 414 transition count 811
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1613 place count 412 transition count 807
Iterating global reduction 7 with 2 rules applied. Total rules applied 1615 place count 412 transition count 807
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1617 place count 410 transition count 803
Iterating global reduction 7 with 2 rules applied. Total rules applied 1619 place count 410 transition count 803
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1621 place count 408 transition count 799
Iterating global reduction 7 with 2 rules applied. Total rules applied 1623 place count 408 transition count 799
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1625 place count 406 transition count 795
Iterating global reduction 7 with 2 rules applied. Total rules applied 1627 place count 406 transition count 795
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1629 place count 404 transition count 791
Iterating global reduction 7 with 2 rules applied. Total rules applied 1631 place count 404 transition count 791
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1633 place count 402 transition count 777
Iterating global reduction 7 with 2 rules applied. Total rules applied 1635 place count 402 transition count 777
Performed 189 Post agglomeration using F-continuation condition with reduction of 111 identical transitions.
Deduced a syphon composed of 189 places in 0 ms
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 7 with 378 rules applied. Total rules applied 2013 place count 213 transition count 477
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 2027 place count 213 transition count 463
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2031 place count 209 transition count 458
Iterating global reduction 8 with 4 rules applied. Total rules applied 2035 place count 209 transition count 458
Performed 15 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 8 with 30 rules applied. Total rules applied 2065 place count 194 transition count 440
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 2082 place count 194 transition count 423
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2083 place count 193 transition count 421
Iterating global reduction 9 with 1 rules applied. Total rules applied 2084 place count 193 transition count 421
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 9 with 48 rules applied. Total rules applied 2132 place count 169 transition count 471
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 9 with 26 rules applied. Total rules applied 2158 place count 169 transition count 445
Discarding 12 places :
Symmetric choice reduction at 10 with 12 rule applications. Total rules 2170 place count 157 transition count 421
Iterating global reduction 10 with 12 rules applied. Total rules applied 2182 place count 157 transition count 421
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 2190 place count 157 transition count 413
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2191 place count 156 transition count 412
Applied a total of 2191 rules in 117 ms. Remains 156 /2119 variables (removed 1963) and now considering 412/2715 (removed 2303) transitions.
[2025-05-30 11:29:52] [INFO ] Flow matrix only has 334 transitions (discarded 78 similar events)
// Phase 1: matrix 334 rows 156 cols
[2025-05-30 11:29:52] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:29:52] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-05-30 11:29:52] [INFO ] Flow matrix only has 334 transitions (discarded 78 similar events)
[2025-05-30 11:29:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:29:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-30 11:29:52] [INFO ] Implicit Places using invariants and state equation in 168 ms returned [15, 83, 116]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 235 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 153/2119 places, 412/2715 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 151 transition count 410
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 150 transition count 409
Applied a total of 3 rules in 9 ms. Remains 150 /153 variables (removed 3) and now considering 409/412 (removed 3) transitions.
[2025-05-30 11:29:52] [INFO ] Flow matrix only has 331 transitions (discarded 78 similar events)
// Phase 1: matrix 331 rows 150 cols
[2025-05-30 11:29:52] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:29:52] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-05-30 11:29:52] [INFO ] Flow matrix only has 331 transitions (discarded 78 similar events)
[2025-05-30 11:29:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:29:52] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 11:29:52] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 150/2119 places, 409/2715 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 543 ms. Remains : 150/2119 places, 409/2715 transitions.
Running random walk in product with property : CloudReconfiguration-PT-401-LTLFireability-12
Product exploration explored 100000 steps with 7278 reset in 170 ms.
Product exploration explored 100000 steps with 7288 reset in 173 ms.
Computed a total of 3 stabilizing places and 22 stable transitions
Computed a total of 3 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 121 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (3515 resets) in 108 ms. (366 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (511 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (519 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
[2025-05-30 11:29:53] [INFO ] Flow matrix only has 331 transitions (discarded 78 similar events)
[2025-05-30 11:29:53] [INFO ] Invariant cache hit.
[2025-05-30 11:29:53] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 154/164 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 304/468 variables, 129/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 6/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/480 variables, 11/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/480 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/481 variables, and 157 constraints, problems are : Problem set: 0 solved, 2 unsolved in 127 ms.
Refiners :[State Equation: 150/150 constraints, ReadFeed: 7/7 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 154/164 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 304/468 variables, 129/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 6/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/480 variables, 11/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/480 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/480 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/481 variables, and 159 constraints, problems are : Problem set: 0 solved, 2 unsolved in 212 ms.
Refiners :[State Equation: 150/150 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 343ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 14 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=7 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT p0)), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 8 factoid took 308 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 409/409 transitions.
Applied a total of 0 rules in 1 ms. Remains 150 /150 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2025-05-30 11:29:54] [INFO ] Flow matrix only has 331 transitions (discarded 78 similar events)
[2025-05-30 11:29:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:29:54] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-05-30 11:29:54] [INFO ] Flow matrix only has 331 transitions (discarded 78 similar events)
[2025-05-30 11:29:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:29:54] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-30 11:29:54] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 397 sub problems to find dead transitions.
[2025-05-30 11:29:54] [INFO ] Flow matrix only has 331 transitions (discarded 78 similar events)
[2025-05-30 11:29:54] [INFO ] Invariant cache hit.
[2025-05-30 11:29:54] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (OVERLAPS) 330/477 variables, 147/147 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 7/154 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (OVERLAPS) 3/480 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 6 (OVERLAPS) 0/480 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 397 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/481 variables, and 157 constraints, problems are : Problem set: 0 solved, 397 unsolved in 24519 ms.
Refiners :[State Equation: 150/150 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (OVERLAPS) 330/477 variables, 147/147 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 7/154 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 297/451 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (OVERLAPS) 3/480 variables, 3/454 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 100/554 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/481 variables, and 554 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30022 ms.
Refiners :[State Equation: 150/150 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54630ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 54632ms
Finished structural reductions in LTL mode , in 1 iterations and 54845 ms. Remains : 150/150 places, 409/409 transitions.
Computed a total of 3 stabilizing places and 22 stable transitions
Computed a total of 3 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (OR p1 p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 120 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (3554 resets) in 110 ms. (360 steps per ms) remains 1/5 properties
BEST_FIRST walk for 39971 steps (500 resets) in 20 ms. (1903 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (OR p1 p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT p0)), (F p1), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 8 factoid took 316 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Product exploration explored 100000 steps with 7254 reset in 167 ms.
Product exploration explored 100000 steps with 7275 reset in 177 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 409/409 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 0 with 54 rules applied. Total rules applied 54 place count 150 transition count 355
Applied a total of 54 rules in 10 ms. Remains 150 /150 variables (removed 0) and now considering 355/409 (removed 54) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:30:51] [INFO ] Redundant transitions in 35 ms returned []
Running 343 sub problems to find dead transitions.
[2025-05-30 11:30:51] [INFO ] Flow matrix only has 277 transitions (discarded 78 similar events)
// Phase 1: matrix 277 rows 150 cols
[2025-05-30 11:30:51] [INFO ] Computed 0 invariants in 1 ms
[2025-05-30 11:30:51] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (OVERLAPS) 276/423 variables, 147/147 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 4 (OVERLAPS) 3/426 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 6 (OVERLAPS) 0/426 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 343 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/427 variables, and 153 constraints, problems are : Problem set: 0 solved, 343 unsolved in 19783 ms.
Refiners :[State Equation: 150/150 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 343 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (OVERLAPS) 276/423 variables, 147/147 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 250/400 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 5 (OVERLAPS) 3/426 variables, 3/403 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 93/496 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 8 (OVERLAPS) 0/426 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 343 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/427 variables, and 496 constraints, problems are : Problem set: 0 solved, 343 unsolved in 30011 ms.
Refiners :[State Equation: 150/150 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49891ms problems are : Problem set: 0 solved, 343 unsolved
Search for dead transitions found 0 dead transitions in 49892ms
Starting structural reductions in SI_LTL mode, iteration 1 : 150/150 places, 355/409 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49944 ms. Remains : 150/150 places, 355/409 transitions.
Built C files in :
/tmp/ltsmin14380646453338449965
[2025-05-30 11:31:41] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14380646453338449965
Running compilation step : cd /tmp/ltsmin14380646453338449965;'/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 550 ms.
Running link step : cd /tmp/ltsmin14380646453338449965;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14380646453338449965;'/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/stateBased7111045579200264974.hoa' '--buchi-type=spotba'
LTSmin run took 7648 ms.
Treatment of property CloudReconfiguration-PT-401-LTLFireability-12 finished in 117707 ms.
FORMULA CloudReconfiguration-PT-401-LTLFireability-12 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2025-05-30 11:31:49] [INFO ] Flatten gal took : 38 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5849488263719093145
[2025-05-30 11:31:49] [INFO ] Too many transitions (2715) to apply POR reductions. Disabling POR matrices.
[2025-05-30 11:31:49] [INFO ] Applying decomposition
[2025-05-30 11:31:49] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5849488263719093145
Running compilation step : cd /tmp/ltsmin5849488263719093145;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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-05-30 11:31:49] [INFO ] Flatten gal took : 40 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/graph5142754082710013212.txt' '-o' '/tmp/graph5142754082710013212.bin' '-w' '/tmp/graph5142754082710013212.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5142754082710013212.bin' '-l' '-1' '-v' '-w' '/tmp/graph5142754082710013212.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:31:49] [INFO ] Decomposing Gal with order
[2025-05-30 11:31:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:31:49] [INFO ] Removed a total of 709 redundant transitions.
[2025-05-30 11:31:49] [INFO ] Flatten gal took : 82 ms
[2025-05-30 11:31:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 21 ms.
[2025-05-30 11:31:49] [INFO ] Time to serialize gal into /tmp/LTLFireability10307380807494827474.gal : 21 ms
[2025-05-30 11:31:49] [INFO ] Time to serialize properties into /tmp/LTLFireability16422821362806775046.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/LTLFireability10307380807494827474.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16422821362806775046.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 2 LTL properties
Checking formula 0 : !((X(((X(F("(i11.i0.i3.u157.p860!=1)")))||(G("(i13.i1.i1.u186.p999!=1)")))U(X((X("(i0.u34.p187!=1)"))U((("(i28.i0.i0.u456.p1955!=1)")&...214
Formula 0 simplified : X((XG!"(i11.i0.i3.u157.p860!=1)" & F!"(i13.i1.i1.u186.p999!=1)") R X(X!"(i0.u34.p187!=1)" R (XF!"(i0.u34.p187!=1)" & (!"(i28.i0.i0.u...196
Compilation finished in 5743 ms.
Running link step : cd /tmp/ltsmin5849488263719093145;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin5849488263719093145;'/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(<>((LTLAPp0==true)))||[]((LTLAPp1==true))) U X((X((LTLAPp2==true)) U (((LTLAPp3==true)&&X((LTLAPp2==true)))||X([]((LTLAPp2==true))))))))' '--buchi-type=spotba'
LTSmin run took 1239 ms.
FORMULA CloudReconfiguration-PT-401-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin5849488263719093145;'/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([](((LTLAPp4==true)||<>(([](<>(([](<>(!(LTLAPp5==true)))||((LTLAPp6==true)&&<>(!(LTLAPp5==true))))))||(X(X((LTLAPp7==true)))&&<>(([](<>(!(LTLAPp5==true)))||((LTLAPp6==true)&&<>(!(LTLAPp5==true)))))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t32, t214, t266, t297, t447, t499, t671, t752, t783, t932, t984, t1166, t1189, t1218, t1249, ...3013
Computing Next relation with stutter on 4.35879e+06 deadlock states
6 unique states visited
0 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
2936 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,29.6416,554484,1,0,803172,19611,27277,2.26109e+06,670,193534,5166584
no accepting run found
Formula 0 is TRUE no accepting run found.
Checking formula 1 : !((X(G(("(i18.i4.i7.u317.p1526==0)")||(F((G(F((G(F(!("((i11.i0.i3.u47.p872==1)&&(i28.i0.i5.u494.p2153==1))"))))||(("(i42.u764.p3152!=1...434
Formula 1 simplified : XF(!"(i18.i4.i7.u317.p1526==0)" & G(FG"((i11.i0.i3.u47.p872==1)&&(i28.i0.i5.u494.p2153==1))" & (G(FG"((i11.i0.i3.u47.p872==1)&&(i28....299
Computing Next relation with stutter on 4.35879e+06 deadlock states
47 unique states visited
47 strongly connected components in search stack
48 transitions explored
47 items max in DFS search stack
1191 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,41.5617,839728,1,0,1.33383e+06,21118,31654,3.78492e+06,722,193534,6410026
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-401-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1749154 ms.
BK_STOP 1748604814579
--------------------
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="CloudReconfiguration-PT-401"
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 CloudReconfiguration-PT-401, 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 r044-tall-174854028300364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-401.tgz
mv CloudReconfiguration-PT-401 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 ;