About the Execution of ITS-Tools for ShieldPPPs-PT-010B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | F?FTTFFFF??FFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533200692.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 ShieldPPPs-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533200692
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 172K May 29 14:33 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 ShieldPPPs-PT-010B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-010B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749227643789
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-010B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 16:34:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 16:34:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 16:34:05] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2025-06-06 16:34:05] [INFO ] Transformed 683 places.
[2025-06-06 16:34:05] [INFO ] Transformed 633 transitions.
[2025-06-06 16:34:05] [INFO ] Found NUPN structural information;
[2025-06-06 16:34:05] [INFO ] Parsed PT model containing 683 places and 633 transitions and 1746 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPs-PT-010B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 633/633 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 622 transition count 572
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 622 transition count 572
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 621 transition count 571
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 621 transition count 571
Applied a total of 124 rules in 128 ms. Remains 621 /683 variables (removed 62) and now considering 571/633 (removed 62) transitions.
// Phase 1: matrix 571 rows 621 cols
[2025-06-06 16:34:05] [INFO ] Computed 111 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:34:06] [INFO ] Implicit Places using invariants in 446 ms returned []
[2025-06-06 16:34:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:34:06] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 972 ms to find 0 implicit places.
Running 570 sub problems to find dead transitions.
[2025-06-06 16:34:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (OVERLAPS) 1/621 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:22] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:22] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:22] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:23] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:23] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:23] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:23] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:23] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:23] [INFO ] Deduced a trap composed of 19 places in 256 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:23] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:24] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:24] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:24] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:24] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:24] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:24] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:24] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:25] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:25] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:25] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:27] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:27] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:27] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:27] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:27] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:27] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:27] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:27] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:28] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:28] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:28] [INFO ] Deduced a trap composed of 20 places in 184 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:28] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:28] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:28] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:28] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:28] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:29] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:29] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:29] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:29] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:36] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:36] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:36] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:36] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:36] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 621/1192 variables, and 156 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 570/570 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (OVERLAPS) 1/621 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 45/156 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:43] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:44] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:44] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:44] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:44] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:44] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:44] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:44] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:44] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:45] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:45] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:45] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:45] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:45] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:45] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:45] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:45] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:46] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:46] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:46] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/621 variables, 20/176 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:48] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:49] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:49] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:49] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:49] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:49] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:49] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:49] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:49] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:50] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:50] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:50] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:50] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:50] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:50] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:50] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:50] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:51] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:51] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:51] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 20/196 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:52] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:53] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:54] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:54] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:54] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:55] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:55] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:55] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:55] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:55] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:55] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:55] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:55] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:56] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:56] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:56] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:56] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:56] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:56] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:56] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/621 variables, 20/216 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:59] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:34:59] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:00] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:00] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:01] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:01] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:01] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:01] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:01] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:02] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:02] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:02] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:02] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:02] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:02] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:02] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:02] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:02] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:03] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:03] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 20/236 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:05] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:06] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 621/1192 variables, and 238 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/621 constraints, PredecessorRefiner: 0/570 constraints, Known Traps: 127/127 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 60203ms
Starting structural reductions in LTL mode, iteration 1 : 621/683 places, 571/633 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61327 ms. Remains : 621/683 places, 571/633 transitions.
Support contains 44 out of 621 places after structural reductions.
[2025-06-06 16:35:07] [INFO ] Flatten gal took : 56 ms
[2025-06-06 16:35:07] [INFO ] Flatten gal took : 30 ms
[2025-06-06 16:35:07] [INFO ] Input system was already deterministic with 571 transitions.
Support contains 42 out of 621 places (down from 44) after GAL structural reductions.
RANDOM walk for 40000 steps (22 resets) in 1911 ms. (20 steps per ms) remains 1/31 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
[2025-06-06 16:35:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 586/621 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:07] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:08] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:08] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/621 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 571/1192 variables, 621/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:08] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:08] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:08] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:08] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:08] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:09] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:09] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:09] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:09] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:09] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:09] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:09] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:09] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1192 variables, 13/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:10] [INFO ] Deduced a trap along path composed of 5 places in 35 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1192 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1192 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1192 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1192/1192 variables, and 749 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2291 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 621/621 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 586/621 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/621 variables, 16/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:10] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:10] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/621 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 571/1192 variables, 621/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1192 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:10] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:10] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:10] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:10] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:10] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:11] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:11] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:11] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:11] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:11] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:11] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:11] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1192 variables, 12/763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1192 variables, 1/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:11] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1192 variables, 1/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1192 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1192 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1192/1192 variables, and 765 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1935 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 621/621 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4235ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 101 ms.
Support contains 3 out of 621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 571/571 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 621 transition count 500
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 550 transition count 500
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 142 place count 550 transition count 450
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 242 place count 500 transition count 450
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 250 place count 492 transition count 442
Iterating global reduction 2 with 8 rules applied. Total rules applied 258 place count 492 transition count 442
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 258 place count 492 transition count 438
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 266 place count 488 transition count 438
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 3 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 2 with 344 rules applied. Total rules applied 610 place count 316 transition count 266
Partial Free-agglomeration rule applied 85 times.
Drop transitions (Partial Free agglomeration) removed 85 transitions
Iterating global reduction 2 with 85 rules applied. Total rules applied 695 place count 316 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 696 place count 315 transition count 265
Applied a total of 696 rules in 117 ms. Remains 315 /621 variables (removed 306) and now considering 265/571 (removed 306) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 315/621 places, 265/571 transitions.
RANDOM walk for 40000 steps (23 resets) in 537 ms. (74 steps per ms) remains 1/1 properties
BEST_FIRST walk for 22596 steps (4 resets) in 111 ms. (201 steps per ms) remains 0/1 properties
FORMULA ShieldPPPs-PT-010B-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 126 stabilizing places and 126 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&G(p0)&&X(X(F(p2))))))'
Support contains 3 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 571/571 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 613 transition count 563
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 613 transition count 563
Applied a total of 16 rules in 20 ms. Remains 613 /621 variables (removed 8) and now considering 563/571 (removed 8) transitions.
// Phase 1: matrix 563 rows 613 cols
[2025-06-06 16:35:12] [INFO ] Computed 111 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:35:13] [INFO ] Implicit Places using invariants in 210 ms returned []
[2025-06-06 16:35:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:35:13] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
Running 562 sub problems to find dead transitions.
[2025-06-06 16:35:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (OVERLAPS) 1/613 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:28] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:28] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:28] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:28] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:28] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:28] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:29] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:29] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:29] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:29] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:29] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:29] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:29] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:29] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:29] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:30] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:30] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:30] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:30] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:30] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:32] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:32] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:32] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:32] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:32] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:33] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:33] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:33] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:33] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:33] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:33] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:33] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:33] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:33] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:34] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:34] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:34] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:34] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:34] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:34] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:40] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:40] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:41] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:42] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:42] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:42] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:42] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:42] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:42] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:42] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:42] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:42] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:43] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:43] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:43] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:43] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:43] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:35:43] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 5 ms to minimize.
SMT process timed out in 30113ms, After SMT, problems are : Problem set: 0 solved, 562 unsolved
Search for dead transitions found 0 dead transitions in 30116ms
Starting structural reductions in LTL mode, iteration 1 : 613/621 places, 563/571 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30762 ms. Remains : 613/621 places, 563/571 transitions.
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-00 finished in 31259 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(!p0) U (p1||F(G(p2)))))))'
Support contains 4 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 571/571 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 614 transition count 564
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 614 transition count 564
Applied a total of 14 rules in 23 ms. Remains 614 /621 variables (removed 7) and now considering 564/571 (removed 7) transitions.
// Phase 1: matrix 564 rows 614 cols
[2025-06-06 16:35:44] [INFO ] Computed 111 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:35:44] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-06-06 16:35:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:35:44] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Running 563 sub problems to find dead transitions.
[2025-06-06 16:35:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 1 (OVERLAPS) 1/614 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:00] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:00] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:00] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:00] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:00] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:00] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:00] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:00] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:01] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:01] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:01] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:01] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:01] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:01] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:01] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:01] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:01] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:02] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:02] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:02] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:03] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:03] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:04] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:04] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:04] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:04] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:05] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:05] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:05] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:05] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:05] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:05] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:05] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:05] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:05] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:06] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:06] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:06] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:06] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:06] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/614 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:12] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:12] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:13] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:13] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:13] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:14] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:14] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:14] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:14] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:14] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:14] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:14] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.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 1.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 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.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 1.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 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.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 1.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 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1178 variables, and 163 constraints, problems are : Problem set: 0 solved, 563 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/614 constraints, PredecessorRefiner: 563/563 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 1 (OVERLAPS) 1/614 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 52/163 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:20] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:21] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:21] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:22] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:22] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:22] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:23] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:23] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:23] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:23] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:23] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:23] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:23] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:23] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:24] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:24] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:24] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:24] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:24] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:24] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/614 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:27] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:28] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:28] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:28] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:28] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:28] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:28] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:28] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:28] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:29] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:29] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:29] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:29] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:29] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:29] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:29] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:29] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:29] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:29] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:29] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:31] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:33] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:33] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:33] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:34] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:34] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:34] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:34] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:34] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:34] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:34] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 11/214 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:37] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:38] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:44] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1178 variables, and 217 constraints, problems are : Problem set: 0 solved, 563 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/614 constraints, PredecessorRefiner: 0/563 constraints, Known Traps: 106/106 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 563 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 614/621 places, 564/571 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60752 ms. Remains : 614/621 places, 564/571 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-01
Product exploration explored 100000 steps with 19990 reset in 305 ms.
Product exploration explored 100000 steps with 19972 reset in 181 ms.
Computed a total of 121 stabilizing places and 121 stable transitions
Computed a total of 121 stabilizing places and 121 stable transitions
Detected a total of 121/614 stabilizing places and 121/564 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 186 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
RANDOM walk for 40000 steps (22 resets) in 343 ms. (116 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
[2025-06-06 16:36:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 579/614 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:46] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:46] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:46] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:46] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:46] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 564/1178 variables, 614/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1178 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1178 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1178/1178 variables, and 730 constraints, problems are : Problem set: 0 solved, 1 unsolved in 596 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 614/614 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 579/614 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:46] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:46] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 564/1178 variables, 614/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1178 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:47] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:47] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:47] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:47] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1178 variables, 4/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1178 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:47] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/1178 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1178 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:47] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:47] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:48] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:48] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:48] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:36:48] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 5 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/1178 variables, 6/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1178 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1178 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1178/1178 variables, and 744 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1623 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 614/614 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2227ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 3 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 564/564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 614 transition count 493
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 543 transition count 493
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 142 place count 543 transition count 443
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 242 place count 493 transition count 443
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 243 place count 492 transition count 442
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 492 transition count 442
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 244 place count 492 transition count 441
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 246 place count 491 transition count 441
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 596 place count 316 transition count 266
Partial Free-agglomeration rule applied 85 times.
Drop transitions (Partial Free agglomeration) removed 85 transitions
Iterating global reduction 2 with 85 rules applied. Total rules applied 681 place count 316 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 682 place count 315 transition count 265
Applied a total of 682 rules in 64 ms. Remains 315 /614 variables (removed 299) and now considering 265/564 (removed 299) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 315/614 places, 265/564 transitions.
RANDOM walk for 40000 steps (22 resets) in 255 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 19579 steps (3 resets) in 71 ms. (271 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 7 factoid took 465 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Applied a total of 0 rules in 15 ms. Remains 614 /614 variables (removed 0) and now considering 564/564 (removed 0) transitions.
[2025-06-06 16:36:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:36:49] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-06-06 16:36:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:36:50] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Running 563 sub problems to find dead transitions.
[2025-06-06 16:36:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 1 (OVERLAPS) 1/614 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:05] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:05] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:05] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:05] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:05] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:06] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:06] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:06] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:06] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:06] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:06] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:06] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:06] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:07] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:07] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:07] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:07] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:07] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:07] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:07] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:09] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:09] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:09] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:10] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:10] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:10] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:10] [INFO ] Deduced a trap composed of 20 places in 184 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:10] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:10] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:10] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:11] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:11] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:11] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:11] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:11] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:11] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:12] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:12] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:12] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:12] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/614 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:18] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:18] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:19] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:19] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:19] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:20] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 13 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1178 variables, and 157 constraints, problems are : Problem set: 0 solved, 563 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/614 constraints, PredecessorRefiner: 563/563 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 1 (OVERLAPS) 1/614 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 46/157 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:26] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:26] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:27] [INFO ] Deduced a trap composed of 20 places in 184 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:28] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:28] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:28] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:28] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:28] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:28] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:28] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:28] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:29] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:29] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:29] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:29] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:29] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:29] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:29] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:29] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:29] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/614 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:32] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:32] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:33] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:33] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:33] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:34] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:34] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:34] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:34] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:34] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:34] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:34] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:34] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:34] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:35] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:35] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:35] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:35] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:35] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:35] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:39] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:39] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:39] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:39] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:40] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:40] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:40] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:40] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:40] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:40] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:40] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:40] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:41] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:41] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:41] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:41] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:41] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:41] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:41] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:41] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:44] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:45] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:46] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:46] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:47] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 5/222 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:49] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:50] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1178 variables, and 224 constraints, problems are : Problem set: 0 solved, 563 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/614 constraints, PredecessorRefiner: 0/563 constraints, Known Traps: 113/113 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 563 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Finished structural reductions in LTL mode , in 1 iterations and 60756 ms. Remains : 614/614 places, 564/564 transitions.
Computed a total of 121 stabilizing places and 121 stable transitions
Computed a total of 121 stabilizing places and 121 stable transitions
Detected a total of 121/614 stabilizing places and 121/564 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 183 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
RANDOM walk for 40000 steps (23 resets) in 216 ms. (184 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
[2025-06-06 16:37: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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 579/614 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:50] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:51] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:51] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:51] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:51] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 564/1178 variables, 614/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1178 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1178 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1178/1178 variables, and 730 constraints, problems are : Problem set: 0 solved, 1 unsolved in 579 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 614/614 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 579/614 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:51] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:51] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/614 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 564/1178 variables, 614/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1178 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:51] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:51] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:52] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:52] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1178 variables, 4/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1178 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:52] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/1178 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1178 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:52] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:52] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:52] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:52] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:52] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:37:52] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 5 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/1178 variables, 6/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1178 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1178 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1178/1178 variables, and 744 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1647 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 614/614 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2234ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 3 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 564/564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 614 transition count 493
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 543 transition count 493
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 142 place count 543 transition count 443
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 242 place count 493 transition count 443
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 243 place count 492 transition count 442
Iterating global reduction 2 with 1 rules applied. Total rules applied 244 place count 492 transition count 442
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 244 place count 492 transition count 441
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 246 place count 491 transition count 441
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 596 place count 316 transition count 266
Partial Free-agglomeration rule applied 85 times.
Drop transitions (Partial Free agglomeration) removed 85 transitions
Iterating global reduction 2 with 85 rules applied. Total rules applied 681 place count 316 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 682 place count 315 transition count 265
Applied a total of 682 rules in 52 ms. Remains 315 /614 variables (removed 299) and now considering 265/564 (removed 299) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 315/614 places, 265/564 transitions.
RANDOM walk for 40000 steps (22 resets) in 272 ms. (146 steps per ms) remains 1/1 properties
BEST_FIRST walk for 9288 steps (0 resets) in 22 ms. (403 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 7 factoid took 482 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 20023 reset in 137 ms.
Product exploration explored 100000 steps with 19932 reset in 137 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (NOT p2)]
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 614 transition count 564
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 69 place count 614 transition count 567
Deduced a syphon composed of 92 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 92 place count 614 transition count 567
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 296 places in 0 ms
Iterating global reduction 1 with 204 rules applied. Total rules applied 296 place count 614 transition count 567
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 364 place count 546 transition count 499
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 1 with 68 rules applied. Total rules applied 432 place count 546 transition count 499
Deduced a syphon composed of 228 places in 0 ms
Applied a total of 432 rules in 100 ms. Remains 546 /614 variables (removed 68) and now considering 499/564 (removed 65) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 16:37:55] [INFO ] Redundant transitions in 25 ms returned []
Running 498 sub problems to find dead transitions.
// Phase 1: matrix 499 rows 546 cols
[2025-06-06 16:37:55] [INFO ] Computed 111 invariants in 4 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/545 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/546 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:06] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:06] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:06] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:06] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:06] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:07] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 3 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:07] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:07] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:07] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:07] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:07] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:07] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 3 ms to minimize.
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:07] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:07] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:07] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:07] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:07] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:07] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:07] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:07] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD471 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 20/131 constraints. Problems are: Problem set: 84 solved, 414 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:08] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Problem TDEAD60 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:08] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:08] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:08] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
Problem TDEAD69 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:08] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Problem TDEAD72 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:08] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
Problem TDEAD75 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:08] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:08] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Problem TDEAD81 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:08] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:08] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:08] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD89 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:09] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 3 ms to minimize.
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:09] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD97 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:09] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:09] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD105 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD495 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/546 variables, 20/151 constraints. Problems are: Problem set: 146 solved, 352 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:12] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:12] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 4 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:12] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD113 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:12] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:12] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:12] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 4 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:12] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD121 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:13] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:13] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:13] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 4 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:13] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD129 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:13] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:13] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:13] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 4 ms to minimize.
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 3 ms to minimize.
Problem TDEAD137 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:13] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:13] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:13] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 5 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:13] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 6 ms to minimize.
Problem TDEAD148 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:13] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 20/171 constraints. Problems are: Problem set: 196 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:14] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:14] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 5 ms to minimize.
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:14] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 3 ms to minimize.
Problem TDEAD156 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:14] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 4 ms to minimize.
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:14] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 3 ms to minimize.
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:14] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Problem TDEAD167 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:14] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:14] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:15] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:15] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD275 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:15] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 4 ms to minimize.
Problem TDEAD281 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:15] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:15] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 3 ms to minimize.
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:15] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 6 ms to minimize.
Problem TDEAD293 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:16] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
Problem TDEAD316 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:16] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
Problem TDEAD338 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:16] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
Problem TDEAD361 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:16] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD384 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 20/191 constraints. Problems are: Problem set: 227 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:18] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Problem TDEAD407 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:18] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD430 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:18] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD453 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:19] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD475 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 4/195 constraints. Problems are: Problem set: 231 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/1045 variables, and 195 constraints, problems are : Problem set: 231 solved, 267 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/546 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 84/84 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 231 solved, 267 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/317 variables, 0/0 constraints. Problems are: Problem set: 231 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 229/546 variables, 111/111 constraints. Problems are: Problem set: 231 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 84/195 constraints. Problems are: Problem set: 231 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/546 variables, 0/195 constraints. Problems are: Problem set: 231 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 499/1045 variables, 546/741 constraints. Problems are: Problem set: 231 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1045 variables, 267/1008 constraints. Problems are: Problem set: 231 solved, 267 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:52] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:53] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:53] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:53] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:38:53] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1045/1045 variables, and 1013 constraints, problems are : Problem set: 231 solved, 267 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 546/546 constraints, PredecessorRefiner: 267/498 constraints, Known Traps: 89/89 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60125ms problems are : Problem set: 231 solved, 267 unsolved
Search for dead transitions found 231 dead transitions in 60127ms
Found 231 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 231 transitions
Dead transitions reduction (with SMT) removed 231 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 546/614 places, 268/564 transitions.
Graph (complete) has 831 edges and 546 vertex of which 318 are kept as prefixes of interest. Removing 228 places using SCC suffix rule.2 ms
Discarding 228 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 318 /546 variables (removed 228) and now considering 268/268 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 318/614 places, 268/564 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60270 ms. Remains : 318/614 places, 268/564 transitions.
Built C files in :
/tmp/ltsmin7522863749080366333
[2025-06-06 16:38:55] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7522863749080366333
Running compilation step : cd /tmp/ltsmin7522863749080366333;'/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 977 ms.
Running link step : cd /tmp/ltsmin7522863749080366333;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin7522863749080366333;'/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/stateBased15730133532346736004.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 564/564 transitions.
Applied a total of 0 rules in 13 ms. Remains 614 /614 variables (removed 0) and now considering 564/564 (removed 0) transitions.
// Phase 1: matrix 564 rows 614 cols
[2025-06-06 16:39:10] [INFO ] Computed 111 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:39:10] [INFO ] Implicit Places using invariants in 175 ms returned []
[2025-06-06 16:39:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:39:11] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Running 563 sub problems to find dead transitions.
[2025-06-06 16:39:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 1 (OVERLAPS) 1/614 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:26] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:26] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:26] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:26] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:26] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:27] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:27] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:27] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:27] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:27] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:27] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:27] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:27] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:27] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:28] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:28] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:28] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:28] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:28] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:28] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:29] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:30] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:30] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:30] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:30] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:31] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:31] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:31] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:31] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:31] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:31] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:31] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:31] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:31] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:32] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:32] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:32] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:32] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:32] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:32] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/614 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:39] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:39] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:40] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:40] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:40] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:40] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:40] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:41] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:39:41] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 20 ms to minimize.
SMT process timed out in 30166ms, After SMT, problems are : Problem set: 0 solved, 563 unsolved
Search for dead transitions found 0 dead transitions in 30168ms
Finished structural reductions in LTL mode , in 1 iterations and 30784 ms. Remains : 614/614 places, 564/564 transitions.
Built C files in :
/tmp/ltsmin10727322827948521646
[2025-06-06 16:39:41] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10727322827948521646
Running compilation step : cd /tmp/ltsmin10727322827948521646;'/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 861 ms.
Running link step : cd /tmp/ltsmin10727322827948521646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10727322827948521646;'/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/stateBased14539754287294845759.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 16:39:56] [INFO ] Flatten gal took : 26 ms
[2025-06-06 16:39:56] [INFO ] Flatten gal took : 35 ms
[2025-06-06 16:39:56] [INFO ] Time to serialize gal into /tmp/LTL12219253797306337951.gal : 12 ms
[2025-06-06 16:39:56] [INFO ] Time to serialize properties into /tmp/LTL2409185479591741850.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/LTL12219253797306337951.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9442661712579174463.hoa' '-atoms' '/tmp/LTL2409185479591741850.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2409185479591741850.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9442661712579174463.hoa
Detected timeout of ITS tools.
[2025-06-06 16:40:11] [INFO ] Flatten gal took : 21 ms
[2025-06-06 16:40:11] [INFO ] Flatten gal took : 22 ms
[2025-06-06 16:40:11] [INFO ] Time to serialize gal into /tmp/LTL4655442008069391040.gal : 4 ms
[2025-06-06 16:40:11] [INFO ] Time to serialize properties into /tmp/LTL15939030031801482402.ltl : 2 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/LTL4655442008069391040.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15939030031801482402.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((X(!("(((p54==1)&&(p10==1))&&(p61==1))")))U(("(p202==1)")||(F(G("(p54!=1)"))))))))
Formula 0 simplified : XX(X"(((p54==1)&&(p10==1))&&(p61==1))" R (!"(p202==1)" & GF!"(p54!=1)"))
Detected timeout of ITS tools.
[2025-06-06 16:40:26] [INFO ] Flatten gal took : 22 ms
[2025-06-06 16:40:26] [INFO ] Applying decomposition
[2025-06-06 16:40:26] [INFO ] Flatten gal took : 25 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/graph3092721459079421306.txt' '-o' '/tmp/graph3092721459079421306.bin' '-w' '/tmp/graph3092721459079421306.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3092721459079421306.bin' '-l' '-1' '-v' '-w' '/tmp/graph3092721459079421306.weights' '-q' '0' '-e' '0.001'
[2025-06-06 16:40:27] [INFO ] Decomposing Gal with order
[2025-06-06 16:40:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 16:40:27] [INFO ] Removed a total of 90 redundant transitions.
[2025-06-06 16:40:27] [INFO ] Flatten gal took : 86 ms
[2025-06-06 16:40:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2025-06-06 16:40:27] [INFO ] Time to serialize gal into /tmp/LTL18430750048088568864.gal : 15 ms
[2025-06-06 16:40:27] [INFO ] Time to serialize properties into /tmp/LTL15661068353129411455.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/LTL18430750048088568864.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15661068353129411455.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X((X(!("(((i0.u21.p54==1)&&(i0.u5.p10==1))&&(i0.u24.p61==1))")))U(("(i2.i2.i1.u73.p202==1)")||(F(G("(i0.u21.p54!=1)"))))))))
Formula 0 simplified : XX(X"(((i0.u21.p54==1)&&(i0.u5.p10==1))&&(i0.u24.p61==1))" R (!"(i2.i2.i1.u73.p202==1)" & GF!"(i0.u21.p54!=1)"))
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010B-LTLFireability-01 finished in 298326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X((!p0||F(p1))))) U ((p2&&X(X(X((!p0||F(p1))))))||X(X(X(G((!p0||F(p1))))))))))'
Support contains 4 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 571/571 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 613 transition count 563
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 613 transition count 563
Applied a total of 16 rules in 25 ms. Remains 613 /621 variables (removed 8) and now considering 563/571 (removed 8) transitions.
// Phase 1: matrix 563 rows 613 cols
[2025-06-06 16:40:42] [INFO ] Computed 111 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:40:42] [INFO ] Implicit Places using invariants in 189 ms returned []
[2025-06-06 16:40:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:40:43] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Running 562 sub problems to find dead transitions.
[2025-06-06 16:40: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/612 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (OVERLAPS) 1/613 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:40:58] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:40:58] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:40:58] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:40:58] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:40:58] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:40:59] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:40:59] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:40:59] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:40:59] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:40:59] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:40:59] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:40:59] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:40:59] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:00] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:00] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:00] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:00] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:00] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:00] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:00] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:02] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:02] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:03] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:03] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:03] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:03] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:03] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:03] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:03] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:03] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:03] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:04] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:04] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:04] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:04] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:04] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:04] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:04] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:05] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:05] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:10] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:11] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:11] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:11] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:12] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:12] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:12] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:12] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:12] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:13] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 13 ms to minimize.
SMT process timed out in 30140ms, After SMT, problems are : Problem set: 0 solved, 562 unsolved
Search for dead transitions found 0 dead transitions in 30142ms
Starting structural reductions in LTL mode, iteration 1 : 613/621 places, 563/571 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30741 ms. Remains : 613/621 places, 563/571 transitions.
Stuttering acceptance computed with spot in 296 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-03
Product exploration explored 100000 steps with 20000 reset in 125 ms.
Product exploration explored 100000 steps with 20000 reset in 125 ms.
Computed a total of 120 stabilizing places and 120 stable transitions
Computed a total of 120 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p2), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p2)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 168 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
RANDOM walk for 14920 steps (7 resets) in 100 ms. (147 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X p2), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p2)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 226 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 613 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 563/563 transitions.
Applied a total of 0 rules in 13 ms. Remains 613 /613 variables (removed 0) and now considering 563/563 (removed 0) transitions.
[2025-06-06 16:41:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:41:15] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-06-06 16:41:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:41:15] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Running 562 sub problems to find dead transitions.
[2025-06-06 16:41:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (OVERLAPS) 1/613 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:30] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:30] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:30] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:30] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:31] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:31] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:31] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:31] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:31] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:31] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:31] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:31] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:32] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:32] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:32] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:32] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:32] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:32] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:32] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:32] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:34] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:34] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:35] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:35] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:35] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:35] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:35] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:35] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:36] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:36] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:36] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:36] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:36] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:36] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:36] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:37] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:37] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:37] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:37] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:37] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:43] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:43] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:43] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:43] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:44] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:44] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:44] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:45] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:45] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:45] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:45] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:45] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 4 ms to minimize.
SMT process timed out in 30089ms, After SMT, problems are : Problem set: 0 solved, 562 unsolved
Search for dead transitions found 0 dead transitions in 30091ms
Finished structural reductions in LTL mode , in 1 iterations and 30772 ms. Remains : 613/613 places, 563/563 transitions.
Computed a total of 120 stabilizing places and 120 stable transitions
Computed a total of 120 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
RANDOM walk for 15752 steps (7 resets) in 92 ms. (169 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 20000 reset in 114 ms.
Product exploration explored 100000 steps with 20000 reset in 130 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 247 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 563/563 transitions.
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 613 transition count 563
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 70 place count 613 transition count 565
Deduced a syphon composed of 93 places in 1 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 93 place count 613 transition count 565
Performed 206 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 299 places in 0 ms
Iterating global reduction 1 with 206 rules applied. Total rules applied 299 place count 613 transition count 565
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 368 place count 544 transition count 496
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 1 with 69 rules applied. Total rules applied 437 place count 544 transition count 496
Deduced a syphon composed of 230 places in 0 ms
Applied a total of 437 rules in 59 ms. Remains 544 /613 variables (removed 69) and now considering 496/563 (removed 67) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 16:41:47] [INFO ] Redundant transitions in 10 ms returned []
Running 495 sub problems to find dead transitions.
// Phase 1: matrix 496 rows 544 cols
[2025-06-06 16:41:47] [INFO ] Computed 111 invariants in 9 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/543 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 495 unsolved
At refinement iteration 1 (OVERLAPS) 1/544 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 495 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:58] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:58] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:58] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:58] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:58] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:58] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:58] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:58] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:58] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:58] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:58] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:59] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:59] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:59] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 2 ms to minimize.
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:59] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:59] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:59] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
Problem TDEAD48 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:59] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:59] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Problem TDEAD54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:59] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD468 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/544 variables, 20/131 constraints. Problems are: Problem set: 86 solved, 409 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:41:59] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:00] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
Problem TDEAD63 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:00] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
Problem TDEAD66 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:00] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:00] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Problem TDEAD72 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:00] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
Problem TDEAD75 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:00] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
Problem TDEAD78 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:00] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 2 ms to minimize.
Problem TDEAD81 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:00] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
Problem TDEAD84 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:00] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD89 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:00] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:00] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:00] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:00] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Problem TDEAD97 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:00] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:00] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:00] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 3 ms to minimize.
Problem TDEAD105 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:00] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD492 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/544 variables, 20/151 constraints. Problems are: Problem set: 148 solved, 347 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:04] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:04] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:04] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Problem TDEAD113 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:04] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:04] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:04] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD121 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:04] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:04] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:04] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 4 ms to minimize.
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:04] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Problem TDEAD131 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:04] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:04] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 3 ms to minimize.
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:04] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 4 ms to minimize.
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
Problem TDEAD139 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:04] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:04] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 3 ms to minimize.
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:04] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 5 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
Problem TDEAD147 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:05] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 20/171 constraints. Problems are: Problem set: 197 solved, 298 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:05] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:05] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 5 ms to minimize.
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
Problem TDEAD155 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:05] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:05] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:05] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 6 ms to minimize.
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:05] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Problem TDEAD164 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:06] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 5 ms to minimize.
Problem TDEAD168 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:06] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:07] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
Problem TDEAD271 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD291 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:07] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Problem TDEAD314 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD337 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Problem TDEAD360 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:07] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Problem TDEAD381 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD404 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:08] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD427 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD450 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 20/191 constraints. Problems are: Problem set: 231 solved, 264 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:10] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 4 ms to minimize.
Problem TDEAD472 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 1/192 constraints. Problems are: Problem set: 232 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 0/192 constraints. Problems are: Problem set: 232 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 496/1040 variables, 544/736 constraints. Problems are: Problem set: 232 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1040/1040 variables, and 736 constraints, problems are : Problem set: 232 solved, 263 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 544/544 constraints, PredecessorRefiner: 495/495 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 232 solved, 263 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 0/0 constraints. Problems are: Problem set: 232 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 231/544 variables, 111/111 constraints. Problems are: Problem set: 232 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/544 variables, 81/192 constraints. Problems are: Problem set: 232 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/544 variables, 0/192 constraints. Problems are: Problem set: 232 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 496/1040 variables, 544/736 constraints. Problems are: Problem set: 232 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1040 variables, 263/999 constraints. Problems are: Problem set: 232 solved, 263 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:44] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:45] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:45] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:42:45] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1040/1040 variables, and 1003 constraints, problems are : Problem set: 232 solved, 263 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 544/544 constraints, PredecessorRefiner: 263/495 constraints, Known Traps: 85/85 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60117ms problems are : Problem set: 232 solved, 263 unsolved
Search for dead transitions found 232 dead transitions in 60119ms
Found 232 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 232 transitions
Dead transitions reduction (with SMT) removed 232 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 544/613 places, 264/563 transitions.
Graph (complete) has 824 edges and 544 vertex of which 314 are kept as prefixes of interest. Removing 230 places using SCC suffix rule.1 ms
Discarding 230 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 314 /544 variables (removed 230) and now considering 264/264 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 314/613 places, 264/563 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60209 ms. Remains : 314/613 places, 264/563 transitions.
Built C files in :
/tmp/ltsmin12579217062350304871
[2025-06-06 16:42:47] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12579217062350304871
Running compilation step : cd /tmp/ltsmin12579217062350304871;'/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 866 ms.
Running link step : cd /tmp/ltsmin12579217062350304871;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12579217062350304871;'/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/stateBased8415946155998891477.hoa' '--buchi-type=spotba'
LTSmin run took 517 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-010B-LTLFireability-03 finished in 126568 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 (F(p1) U p2)) U X((p3&&X((p3 U (!p4||G(p3))))))))'
Support contains 7 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 571/571 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 614 transition count 564
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 614 transition count 564
Applied a total of 14 rules in 26 ms. Remains 614 /621 variables (removed 7) and now considering 564/571 (removed 7) transitions.
// Phase 1: matrix 564 rows 614 cols
[2025-06-06 16:42:49] [INFO ] Computed 111 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:42:49] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-06-06 16:42:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:42:49] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Running 563 sub problems to find dead transitions.
[2025-06-06 16:42: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/613 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 563 unsolved
At refinement iteration 1 (OVERLAPS) 1/614 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:04] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:04] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:05] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:05] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:05] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:05] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:05] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:05] [INFO ] Deduced a trap composed of 19 places in 219 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:06] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:06] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:06] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:06] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:06] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:06] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:06] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:06] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:06] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:07] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:07] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:07] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:09] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:09] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:09] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:09] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:09] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:09] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:09] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:10] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:10] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:10] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:10] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:10] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:10] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:10] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:10] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:11] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:11] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:11] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:11] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:11] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/614 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 563 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:17] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:17] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:18] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:19] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:19] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:19] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:19] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:19] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:19] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:19] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:19] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:19] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 12 ms to minimize.
SMT process timed out in 30141ms, After SMT, problems are : Problem set: 0 solved, 563 unsolved
Search for dead transitions found 0 dead transitions in 30142ms
Starting structural reductions in LTL mode, iteration 1 : 614/621 places, 564/571 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30813 ms. Remains : 614/621 places, 564/571 transitions.
Stuttering acceptance computed with spot in 496 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND p0 (NOT p1) p2 (NOT p3)), (AND (NOT p1) p0), (AND p0 (NOT p1) (NOT p3) p4), (NOT p2), (AND (NOT p2) (NOT p3) p4), (AND (NOT p3) p4)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-04
Product exploration explored 100000 steps with 40029 reset in 173 ms.
Product exploration explored 100000 steps with 40006 reset in 226 ms.
Computed a total of 120 stabilizing places and 120 stable transitions
Computed a total of 120 stabilizing places and 120 stable transitions
Detected a total of 120/614 stabilizing places and 120/564 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/5 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) p3 (NOT p4)), (X (NOT p2)), (X p3), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) p0 p3))), (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))), (X (NOT (AND p2 (NOT p1) p0 p3))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p2 (NOT p1) p0 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3) p4)))), (X (X p3)), (X (X (NOT p4))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p2) (NOT p3) p4)))), (X (X (NOT (AND (NOT p3) p4)))), (X (X (NOT (AND (NOT p2) p3 p4)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) p0 p3 p4)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) p4)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 p3 p4)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p3 p4)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 33 factoid took 163 ms. Reduced automaton from 9 states, 26 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-010B-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-010B-LTLFireability-04 finished in 31953 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((X(X(X(p0)))&&(X(p2)||p1))))'
Support contains 5 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 571/571 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 612 transition count 562
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 612 transition count 562
Applied a total of 18 rules in 24 ms. Remains 612 /621 variables (removed 9) and now considering 562/571 (removed 9) transitions.
// Phase 1: matrix 562 rows 612 cols
[2025-06-06 16:43:20] [INFO ] Computed 111 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:43:21] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-06-06 16:43:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:43:21] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2025-06-06 16:43:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:36] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:36] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:36] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:36] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:37] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:37] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:37] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:37] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:37] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:37] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:37] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:37] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:37] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:38] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:38] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:38] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:38] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:38] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:38] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:38] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:40] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:40] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:40] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:41] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:41] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:41] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:41] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:41] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:41] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:41] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:41] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:42] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:42] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:42] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:42] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:42] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:42] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:42] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:42] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:43] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:49] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:49] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:49] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:50] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:50] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:51] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:51] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:51] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:51] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:51] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:51] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:51] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:51] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 3 ms to minimize.
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 612/1174 variables, and 164 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 53/164 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:57] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:57] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:58] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:58] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:59] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:59] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:43:59] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:00] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:00] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:00] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:00] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:00] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:00] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:00] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:00] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:00] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:01] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:01] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:01] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:01] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:04] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:04] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:04] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:04] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:04] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:05] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:05] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:05] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:05] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:05] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:05] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:05] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:05] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:05] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:05] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:06] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:06] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:06] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:06] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:06] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:09] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:10] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:10] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:11] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:11] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:11] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:12] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 7/211 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:17] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/1174 variables, and 212 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 0/561 constraints, Known Traps: 101/101 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Starting structural reductions in LTL mode, iteration 1 : 612/621 places, 562/571 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60800 ms. Remains : 612/621 places, 562/571 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-08 finished in 61028 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)&&F(G(p1)))))'
Support contains 2 out of 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 571/571 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 620 transition count 498
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 548 transition count 498
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 144 place count 548 transition count 449
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 242 place count 499 transition count 449
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 249 place count 492 transition count 442
Iterating global reduction 2 with 7 rules applied. Total rules applied 256 place count 492 transition count 442
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 256 place count 492 transition count 437
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 266 place count 487 transition count 437
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 0 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 2 with 346 rules applied. Total rules applied 612 place count 314 transition count 264
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 614 place count 312 transition count 262
Applied a total of 614 rules in 47 ms. Remains 312 /621 variables (removed 309) and now considering 262/571 (removed 309) transitions.
// Phase 1: matrix 262 rows 312 cols
[2025-06-06 16:44:22] [INFO ] Computed 111 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:44:22] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-06-06 16:44:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:44:22] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 16:44:22] [INFO ] Redundant transitions in 9 ms returned []
Running 260 sub problems to find dead transitions.
[2025-06-06 16:44: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/312 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:24] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:24] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:24] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:25] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:25] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:25] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:25] [INFO ] Deduced a trap composed of 111 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:25] [INFO ] Deduced a trap composed of 125 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:25] [INFO ] Deduced a trap composed of 140 places in 77 ms of which 10 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 262/574 variables, 312/432 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:32] [INFO ] Deduced a trap along path composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:35] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:38] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/574 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 435 constraints, problems are : Problem set: 0 solved, 260 unsolved in 22381 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 11/122 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 262/574 variables, 312/434 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 260/694 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:44:48] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 696 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 52422ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 52422ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/621 places, 262/571 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52907 ms. Remains : 312/621 places, 262/571 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-09
Product exploration explored 100000 steps with 141 reset in 495 ms.
Product exploration explored 100000 steps with 142 reset in 496 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 2610 steps (2 resets) in 22 ms. (113 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 120 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2025-06-06 16:45:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:45:16] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-06 16:45:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:45:16] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 16:45:16] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2025-06-06 16:45: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/312 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:45:19] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:45:19] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:45:19] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:45:19] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:45:19] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:45:19] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:45:19] [INFO ] Deduced a trap composed of 111 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:45:20] [INFO ] Deduced a trap composed of 125 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:45:20] [INFO ] Deduced a trap composed of 140 places in 79 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 262/574 variables, 312/432 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:45:27] [INFO ] Deduced a trap along path composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:45:29] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:45:32] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/574 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 435 constraints, problems are : Problem set: 0 solved, 260 unsolved in 21816 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 11/122 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 262/574 variables, 312/434 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 260/694 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:45:41] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 696 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51854ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 51855ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52252 ms. Remains : 312/312 places, 262/262 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1708 steps (0 resets) in 27 ms. (61 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 127 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 139 reset in 407 ms.
Product exploration explored 100000 steps with 140 reset in 438 ms.
Built C files in :
/tmp/ltsmin16670433891187293078
[2025-06-06 16:46:10] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2025-06-06 16:46:10] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 16:46:10] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2025-06-06 16:46:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 16:46:10] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2025-06-06 16:46:10] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 16:46:10] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16670433891187293078
Running compilation step : cd /tmp/ltsmin16670433891187293078;'/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 556 ms.
Running link step : cd /tmp/ltsmin16670433891187293078;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin16670433891187293078;'/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/stateBased17034471878376362436.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 14 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2025-06-06 16:46:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:46:25] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-06-06 16:46:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:46:25] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 16:46:25] [INFO ] Redundant transitions in 0 ms returned []
Running 260 sub problems to find dead transitions.
[2025-06-06 16:46:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:46:28] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:46:28] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:46:28] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:46:28] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:46:28] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:46:28] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:46:28] [INFO ] Deduced a trap composed of 111 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:46:29] [INFO ] Deduced a trap composed of 125 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:46:29] [INFO ] Deduced a trap composed of 140 places in 81 ms of which 10 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 262/574 variables, 312/432 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:46:36] [INFO ] Deduced a trap along path composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:46:38] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:46:41] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/574 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 435 constraints, problems are : Problem set: 0 solved, 260 unsolved in 21649 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 11/122 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 262/574 variables, 312/434 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/574 variables, 260/694 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:46:50] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/574 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 1/696 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 696 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 51703ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 51704ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52083 ms. Remains : 312/312 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin3942656335057046464
[2025-06-06 16:47:17] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2025-06-06 16:47:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 16:47:17] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2025-06-06 16:47:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 16:47:17] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2025-06-06 16:47:17] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 16:47:17] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3942656335057046464
Running compilation step : cd /tmp/ltsmin3942656335057046464;'/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/ltsmin3942656335057046464;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3942656335057046464;'/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/stateBased12508339081321582371.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 16:47:32] [INFO ] Flatten gal took : 11 ms
[2025-06-06 16:47:32] [INFO ] Flatten gal took : 10 ms
[2025-06-06 16:47:32] [INFO ] Time to serialize gal into /tmp/LTL18020219141192169233.gal : 2 ms
[2025-06-06 16:47:32] [INFO ] Time to serialize properties into /tmp/LTL4473849139468288177.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/LTL18020219141192169233.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13508035171287742282.hoa' '-atoms' '/tmp/LTL4473849139468288177.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/LTL4473849139468288177.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13508035171287742282.hoa
Detected timeout of ITS tools.
[2025-06-06 16:47:47] [INFO ] Flatten gal took : 9 ms
[2025-06-06 16:47:47] [INFO ] Flatten gal took : 8 ms
[2025-06-06 16:47:47] [INFO ] Time to serialize gal into /tmp/LTL6830389716189176192.gal : 2 ms
[2025-06-06 16:47:47] [INFO ] Time to serialize properties into /tmp/LTL2850281536443058877.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/LTL6830389716189176192.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2850281536443058877.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("(p450!=1)"))&&(F(G("(p659!=1)"))))))
Formula 0 simplified : F(G!"(p450!=1)" | GF!"(p659!=1)")
Detected timeout of ITS tools.
[2025-06-06 16:48:02] [INFO ] Flatten gal took : 18 ms
[2025-06-06 16:48:02] [INFO ] Applying decomposition
[2025-06-06 16:48:02] [INFO ] Flatten gal took : 8 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/graph2922906929060116099.txt' '-o' '/tmp/graph2922906929060116099.bin' '-w' '/tmp/graph2922906929060116099.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2922906929060116099.bin' '-l' '-1' '-v' '-w' '/tmp/graph2922906929060116099.weights' '-q' '0' '-e' '0.001'
[2025-06-06 16:48:03] [INFO ] Decomposing Gal with order
[2025-06-06 16:48:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 16:48:03] [INFO ] Removed a total of 60 redundant transitions.
[2025-06-06 16:48:03] [INFO ] Flatten gal took : 57 ms
[2025-06-06 16:48:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 8 ms.
[2025-06-06 16:48:03] [INFO ] Time to serialize gal into /tmp/LTL982918988863983621.gal : 4 ms
[2025-06-06 16:48:03] [INFO ] Time to serialize properties into /tmp/LTL3164575985192701080.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/LTL982918988863983621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3164575985192701080.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...253
Read 1 LTL properties
Checking formula 0 : !((G((F("(i6.i2.u74.p450!=1)"))&&(F(G("(i9.i0.u108.p659!=1)"))))))
Formula 0 simplified : F(G!"(i6.i2.u74.p450!=1)" | GF!"(i9.i0.u108.p659!=1)")
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010B-LTLFireability-09 finished in 236270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(F(p1))))'
Support contains 1 out of 621 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 : 621/621 places, 571/571 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 620 transition count 499
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 549 transition count 499
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 142 place count 549 transition count 449
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 242 place count 499 transition count 449
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 250 place count 491 transition count 441
Iterating global reduction 2 with 8 rules applied. Total rules applied 258 place count 491 transition count 441
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 258 place count 491 transition count 437
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 266 place count 487 transition count 437
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 2 with 342 rules applied. Total rules applied 608 place count 316 transition count 266
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 610 place count 314 transition count 264
Applied a total of 610 rules in 41 ms. Remains 314 /621 variables (removed 307) and now considering 264/571 (removed 307) transitions.
// Phase 1: matrix 264 rows 314 cols
[2025-06-06 16:48:18] [INFO ] Computed 111 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:48:18] [INFO ] Implicit Places using invariants in 295 ms returned []
[2025-06-06 16:48:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:48:18] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 16:48:18] [INFO ] Redundant transitions in 0 ms returned []
Running 260 sub problems to find dead transitions.
[2025-06-06 16:48:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:21] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 2/314 variables, 9/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:25] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:25] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:25] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:26] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:26] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:26] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:26] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:26] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:26] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 9/121 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 264/578 variables, 314/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:33] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:33] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/578 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:35] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:35] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:35] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:35] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:35] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:35] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 6/443 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:38] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:45] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/578 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/578 variables, and 445 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 314/314 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 2/314 variables, 9/131 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 264/578 variables, 314/445 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 260/705 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:54] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:54] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:55] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:55] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:48:56] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 5/710 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:04] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:05] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:05] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:06] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:06] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:07] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 6/716 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/578 variables, and 716 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 314/314 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60049ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Starting structural reductions in SI_LTL mode, iteration 1 : 314/621 places, 264/571 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60729 ms. Remains : 314/621 places, 264/571 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-10
Product exploration explored 100000 steps with 19193 reset in 233 ms.
Product exploration explored 100000 steps with 18999 reset in 270 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/314 stabilizing places and 4/264 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
[2025-06-06 16:49:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 16:49:20] [INFO ] [Real]Absence check using 111 positive place invariants in 28 ms returned sat
[2025-06-06 16:49:20] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2025-06-06 16:49:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 16:49:20] [INFO ] [Nat]Absence check using 111 positive place invariants in 28 ms returned sat
[2025-06-06 16:49:20] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:20] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:20] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 2 ms to minimize.
[2025-06-06 16:49:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2025-06-06 16:49:21] [INFO ] Computed and/alt/rep : 260/511/260 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-06 16:49:23] [INFO ] Added : 214 causal constraints over 43 iterations in 2358 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 314 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 : 314/314 places, 264/264 transitions.
Applied a total of 0 rules in 4 ms. Remains 314 /314 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2025-06-06 16:49:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:49:23] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-06-06 16:49:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:49:23] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 16:49:23] [INFO ] Redundant transitions in 1 ms returned []
Running 260 sub problems to find dead transitions.
[2025-06-06 16:49:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:26] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 2/314 variables, 9/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:30] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:30] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:30] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:31] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:31] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:31] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:31] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:31] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:31] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 9/121 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (OVERLAPS) 264/578 variables, 314/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:37] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:37] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/578 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:40] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:40] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:40] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:40] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:40] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:40] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 6/443 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:43] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/578 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:49] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/578 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/578 variables, and 445 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 314/314 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 2/314 variables, 9/131 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 264/578 variables, 314/445 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 260/705 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:59] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:49:59] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:50:00] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:50:00] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:50:01] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 5/710 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:50:09] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:50:09] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:50:10] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:50:11] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:50:11] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:50:12] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 6/716 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 578/578 variables, and 716 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 314/314 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60071ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60549 ms. Remains : 314/314 places, 264/264 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/314 stabilizing places and 4/264 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 210 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
[2025-06-06 16:50:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 16:50:24] [INFO ] [Real]Absence check using 111 positive place invariants in 30 ms returned sat
[2025-06-06 16:50:24] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2025-06-06 16:50:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 16:50:25] [INFO ] [Nat]Absence check using 111 positive place invariants in 30 ms returned sat
[2025-06-06 16:50:25] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:50:25] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:50:25] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 2 ms to minimize.
[2025-06-06 16:50:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2025-06-06 16:50:25] [INFO ] Computed and/alt/rep : 260/511/260 causal constraints (skipped 0 transitions) in 16 ms.
[2025-06-06 16:50:27] [INFO ] Added : 214 causal constraints over 43 iterations in 2364 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Product exploration explored 100000 steps with 19038 reset in 254 ms.
Product exploration explored 100000 steps with 19019 reset in 272 ms.
Built C files in :
/tmp/ltsmin3820449687251515188
[2025-06-06 16:50:28] [INFO ] Computing symmetric may disable matrix : 264 transitions.
[2025-06-06 16:50:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 16:50:28] [INFO ] Computing symmetric may enable matrix : 264 transitions.
[2025-06-06 16:50:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 16:50:28] [INFO ] Computing Do-Not-Accords matrix : 264 transitions.
[2025-06-06 16:50:28] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 16:50:28] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3820449687251515188
Running compilation step : cd /tmp/ltsmin3820449687251515188;'/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 529 ms.
Running link step : cd /tmp/ltsmin3820449687251515188;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin3820449687251515188;'/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/stateBased11977152356763483551.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 314 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 314/314 places, 264/264 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 262
Applied a total of 1 rules in 18 ms. Remains 312 /314 variables (removed 2) and now considering 262/264 (removed 2) transitions.
// Phase 1: matrix 262 rows 312 cols
[2025-06-06 16:50:43] [INFO ] Computed 111 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:50:43] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-06 16:50:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:50:43] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 16:50:43] [INFO ] Redundant transitions in 1 ms returned []
Running 259 sub problems to find dead transitions.
[2025-06-06 16:50: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/311 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:50:46] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 8/112 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:50:51] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:50:51] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:50:51] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:50:51] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:50:51] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:50:51] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/118 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/430 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 0/574 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 430 constraints, problems are : Problem set: 0 solved, 259 unsolved in 18763 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 262/574 variables, 312/430 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/574 variables, 259/689 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:51:09] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:51:10] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:51:10] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:51:10] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 4/693 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:51:19] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:51:20] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:51:20] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:51:20] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:51:20] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:51:20] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:51:20] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 7/700 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 700 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48797ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 48797ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/314 places, 262/264 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49207 ms. Remains : 312/314 places, 262/264 transitions.
Built C files in :
/tmp/ltsmin4420586239115355257
[2025-06-06 16:51:32] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2025-06-06 16:51:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 16:51:32] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2025-06-06 16:51:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 16:51:32] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2025-06-06 16:51:32] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 16:51:32] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4420586239115355257
Running compilation step : cd /tmp/ltsmin4420586239115355257;'/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 526 ms.
Running link step : cd /tmp/ltsmin4420586239115355257;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4420586239115355257;'/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/stateBased8133127324450270988.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-06 16:51:47] [INFO ] Flatten gal took : 9 ms
[2025-06-06 16:51:47] [INFO ] Flatten gal took : 7 ms
[2025-06-06 16:51:47] [INFO ] Time to serialize gal into /tmp/LTL12906116123407968250.gal : 1 ms
[2025-06-06 16:51:47] [INFO ] Time to serialize properties into /tmp/LTL7118029191294297527.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/LTL12906116123407968250.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7457961018885548124.hoa' '-atoms' '/tmp/LTL7118029191294297527.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7118029191294297527.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7457961018885548124.hoa
Detected timeout of ITS tools.
[2025-06-06 16:52:03] [INFO ] Flatten gal took : 9 ms
[2025-06-06 16:52:03] [INFO ] Flatten gal took : 7 ms
[2025-06-06 16:52:03] [INFO ] Time to serialize gal into /tmp/LTL17641099960643809854.gal : 1 ms
[2025-06-06 16:52:03] [INFO ] Time to serialize properties into /tmp/LTL11118256579606173992.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/LTL17641099960643809854.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11118256579606173992.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((("(p403==1)")U("(p85==1)"))||(X(F("(p85==1)")))))
Formula 0 simplified : (!"(p403==1)" R !"(p85==1)") & XG!"(p85==1)"
Detected timeout of ITS tools.
[2025-06-06 16:52:18] [INFO ] Flatten gal took : 11 ms
[2025-06-06 16:52:18] [INFO ] Applying decomposition
[2025-06-06 16:52:18] [INFO ] Flatten gal took : 7 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/graph9786176265153081125.txt' '-o' '/tmp/graph9786176265153081125.bin' '-w' '/tmp/graph9786176265153081125.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9786176265153081125.bin' '-l' '-1' '-v' '-w' '/tmp/graph9786176265153081125.weights' '-q' '0' '-e' '0.001'
[2025-06-06 16:52:18] [INFO ] Decomposing Gal with order
[2025-06-06 16:52:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 16:52:18] [INFO ] Removed a total of 61 redundant transitions.
[2025-06-06 16:52:18] [INFO ] Flatten gal took : 15 ms
[2025-06-06 16:52:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 4 ms.
[2025-06-06 16:52:18] [INFO ] Time to serialize gal into /tmp/LTL9478728040644742629.gal : 3 ms
[2025-06-06 16:52:18] [INFO ] Time to serialize properties into /tmp/LTL9683945815812935067.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/LTL9478728040644742629.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9683945815812935067.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 : !(((("(i5.i1.u67.p403==1)")U("(i1.i3.u12.p85==1)"))||(X(F("(i1.i3.u12.p85==1)")))))
Formula 0 simplified : (!"(i5.i1.u67.p403==1)" R !"(i1.i3.u12.p85==1)") & XG!"(i1.i3.u12.p85==1)"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-010B-LTLFireability-10 finished in 254988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 571/571 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 612 transition count 562
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 612 transition count 562
Applied a total of 18 rules in 23 ms. Remains 612 /621 variables (removed 9) and now considering 562/571 (removed 9) transitions.
// Phase 1: matrix 562 rows 612 cols
[2025-06-06 16:52:33] [INFO ] Computed 111 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:52:33] [INFO ] Implicit Places using invariants in 194 ms returned []
[2025-06-06 16:52:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:52:33] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2025-06-06 16:52:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:48] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:48] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:48] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:48] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:49] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:49] [INFO ] Deduced a trap composed of 18 places in 193 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:49] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:49] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:49] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:49] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:49] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:49] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:50] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:50] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:50] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:50] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:50] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:50] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:50] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:50] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:52] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:52] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:52] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:53] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:53] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:53] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:53] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:53] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:53] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:53] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:53] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:54] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:54] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:54] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:54] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:54] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:54] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:54] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:54] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:52:55] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:01] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:01] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:01] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:02] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:02] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:03] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:03] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:03] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:03] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:03] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:03] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:03] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:03] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:04] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 11 ms to minimize.
SMT process timed out in 30112ms, After SMT, problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 30113ms
Starting structural reductions in LTL mode, iteration 1 : 612/621 places, 562/571 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30779 ms. Remains : 612/621 places, 562/571 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-11
Entered a terminal (fully accepting) state of product in 692 steps with 0 reset in 6 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-11 finished in 30936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 571/571 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 612 transition count 562
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 612 transition count 562
Applied a total of 18 rules in 23 ms. Remains 612 /621 variables (removed 9) and now considering 562/571 (removed 9) transitions.
[2025-06-06 16:53:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:53:04] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-06-06 16:53:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:53:04] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2025-06-06 16:53:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:20] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:20] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:20] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:20] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:20] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:20] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:20] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:21] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:21] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:21] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:21] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:21] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:21] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:21] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:21] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:22] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:22] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:22] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:22] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:22] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:23] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:24] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:24] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:24] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:25] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:25] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:25] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:25] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:25] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:25] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:25] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:25] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:26] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:26] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:26] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:26] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:26] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:26] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:26] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:26] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:32] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:32] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:33] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:33] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:34] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:34] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:34] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:34] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 19 ms to minimize.
SMT process timed out in 30156ms, After SMT, problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 30158ms
Starting structural reductions in LTL mode, iteration 1 : 612/621 places, 562/571 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30807 ms. Remains : 612/621 places, 562/571 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-12 finished in 30965 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((G(p0)||(p1 U (p2||G(p1)))))))'
Support contains 4 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 571/571 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 612 transition count 562
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 612 transition count 562
Applied a total of 18 rules in 28 ms. Remains 612 /621 variables (removed 9) and now considering 562/571 (removed 9) transitions.
[2025-06-06 16:53:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:53:35] [INFO ] Implicit Places using invariants in 197 ms returned []
[2025-06-06 16:53:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:53:35] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2025-06-06 16:53:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:50] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:50] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:50] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:50] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:51] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:51] [INFO ] Deduced a trap composed of 18 places in 232 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:51] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:51] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:51] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:51] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:51] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:51] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:52] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:52] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:52] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:52] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:52] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:52] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:52] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:53] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:54] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:54] [INFO ] Deduced a trap composed of 20 places in 186 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:55] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:55] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:55] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:55] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:56] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:56] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:56] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:56] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:56] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:56] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:56] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:56] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:57] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:57] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:57] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:57] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:57] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:53:57] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:03] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:03] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:04] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:04] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:04] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:05] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:05] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:05] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:05] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:05] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:05] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 3 ms to minimize.
SMT process timed out in 30076ms, After SMT, problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 30078ms
Starting structural reductions in LTL mode, iteration 1 : 612/621 places, 562/571 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30725 ms. Remains : 612/621 places, 562/571 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-13
Entered a terminal (fully accepting) state of product in 208 steps with 0 reset in 5 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-13 finished in 30929 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 621 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 621/621 places, 571/571 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 620 transition count 499
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 549 transition count 499
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 142 place count 549 transition count 449
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 242 place count 499 transition count 449
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 251 place count 490 transition count 440
Iterating global reduction 2 with 9 rules applied. Total rules applied 260 place count 490 transition count 440
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 260 place count 490 transition count 435
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 270 place count 485 transition count 435
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 2 with 342 rules applied. Total rules applied 612 place count 314 transition count 264
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 614 place count 312 transition count 262
Applied a total of 614 rules in 43 ms. Remains 312 /621 variables (removed 309) and now considering 262/571 (removed 309) transitions.
// Phase 1: matrix 262 rows 312 cols
[2025-06-06 16:54:06] [INFO ] Computed 111 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:54:06] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-06-06 16:54:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:54:06] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 16:54:06] [INFO ] Redundant transitions in 0 ms returned []
Running 259 sub problems to find dead transitions.
[2025-06-06 16:54:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:08] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:08] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:09] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:09] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:09] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:09] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:14] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:15] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:15] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:15] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/433 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:22] [INFO ] Deduced a trap along path composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:24] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:26] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (OVERLAPS) 0/574 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 436 constraints, problems are : Problem set: 0 solved, 259 unsolved in 28633 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (OVERLAPS) 1/312 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (OVERLAPS) 262/574 variables, 312/435 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 259/694 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:37] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:37] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:37] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:37] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:37] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:38] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:38] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:39] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 8/702 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:51] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:52] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:54:53] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 3/705 constraints. Problems are: Problem set: 0 solved, 259 unsolved
SMT process timed out in 58668ms, After SMT, problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 58669ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/621 places, 262/571 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59112 ms. Remains : 312/621 places, 262/571 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-14
Stuttering criterion allowed to conclude after 34886 steps with 141 reset in 126 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-14 finished in 59332 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)||p1))) U p1))'
Support contains 3 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 571/571 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 612 transition count 562
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 612 transition count 562
Applied a total of 18 rules in 21 ms. Remains 612 /621 variables (removed 9) and now considering 562/571 (removed 9) transitions.
// Phase 1: matrix 562 rows 612 cols
[2025-06-06 16:55:05] [INFO ] Computed 111 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:55:05] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-06-06 16:55:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 16:55:06] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2025-06-06 16:55:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:21] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:21] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:21] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:21] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:21] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:21] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:21] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:22] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:22] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:22] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:22] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:22] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:22] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:22] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:22] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:22] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:23] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:23] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:23] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:23] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:24] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:25] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:25] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:25] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:25] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:26] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:26] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:26] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:26] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:26] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:26] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:26] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:26] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:27] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:27] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:27] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:27] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:27] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:27] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:27] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:33] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:33] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:34] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:34] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:35] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:35] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:35] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:35] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:35] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:35] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:36] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:36] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:36] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 3 ms to minimize.
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 612/1174 variables, and 164 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/611 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 1/612 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 53/164 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:42] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:42] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:42] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:43] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:43] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:44] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:44] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:44] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:44] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:44] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:44] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:44] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:44] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:44] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:45] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:45] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:45] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:45] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:45] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:45] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/612 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:48] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:48] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:48] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:49] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:49] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:49] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:49] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:49] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:49] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:49] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:49] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:49] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:49] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:50] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:50] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:50] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:50] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:50] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:50] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:50] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/612 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:53] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:54] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:54] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:55] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:55] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:55] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:55:56] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/612 variables, 7/211 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 16:56:00] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/1174 variables, and 212 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/612 constraints, PredecessorRefiner: 0/561 constraints, Known Traps: 101/101 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in LTL mode, iteration 1 : 612/621 places, 562/571 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60745 ms. Remains : 612/621 places, 562/571 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), true, p0, (OR p1 p0), true]
Running random walk in product with property : ShieldPPPs-PT-010B-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-010B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010B-LTLFireability-15 finished in 60953 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(!p0) U (p1||F(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' '!(G((F(p0)&&F(G(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' '!(((p0 U p1)||X(F(p1))))'
[2025-06-06 16:56:06] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6667914151272522761
[2025-06-06 16:56:06] [INFO ] Applying decomposition
[2025-06-06 16:56:06] [INFO ] Computing symmetric may disable matrix : 571 transitions.
[2025-06-06 16:56:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 16:56:06] [INFO ] Computing symmetric may enable matrix : 571 transitions.
[2025-06-06 16:56:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 16:56:06] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3306663401046777164.txt' '-o' '/tmp/graph3306663401046777164.bin' '-w' '/tmp/graph3306663401046777164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3306663401046777164.bin' '-l' '-1' '-v' '-w' '/tmp/graph3306663401046777164.weights' '-q' '0' '-e' '0.001'
[2025-06-06 16:56:06] [INFO ] Decomposing Gal with order
[2025-06-06 16:56:06] [INFO ] Computing Do-Not-Accords matrix : 571 transitions.
[2025-06-06 16:56:06] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 16:56:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 16:56:06] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6667914151272522761
Running compilation step : cd /tmp/ltsmin6667914151272522761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-06 16:56:06] [INFO ] Removed a total of 90 redundant transitions.
[2025-06-06 16:56:06] [INFO ] Flatten gal took : 24 ms
[2025-06-06 16:56:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-06 16:56:06] [INFO ] Time to serialize gal into /tmp/LTLFireability7110423775844248028.gal : 7 ms
[2025-06-06 16:56:06] [INFO ] Time to serialize properties into /tmp/LTLFireability1664033505754275626.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/LTLFireability7110423775844248028.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1664033505754275626.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...276
Read 3 LTL properties
Checking formula 0 : !((X(X((X(!("(((i0.i1.i1.u21.p54==1)&&(i1.i0.i0.u5.p10==1))&&(i0.i2.i1.u24.p61==1))")))U(("(i2.i1.i1.u72.p202==1)")||(F(G("(i0.i1.i1.u...174
Formula 0 simplified : XX(X"(((i0.i1.i1.u21.p54==1)&&(i1.i0.i0.u5.p10==1))&&(i0.i2.i1.u24.p61==1))" R (!"(i2.i1.i1.u72.p202==1)" & GF!"(i0.i1.i1.u21.p54!=1...159
Compilation finished in 1302 ms.
Running link step : cd /tmp/ltsmin6667914151272522761;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin6667914151272522761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((X(!(LTLAPp0==true)) U ((LTLAPp1==true)||<>([]((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin6667914151272522761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((X(!(LTLAPp0==true)) U ((LTLAPp1==true)||<>([]((LTLAPp2==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6667914151272522761;'/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' '--ltl' '[]((<>((LTLAPp3==true))&&<>([]((LTLAPp4==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin6667914151272522761;'/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' '--ltl' '[]((<>((LTLAPp3==true))&&<>([]((LTLAPp4==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6667914151272522761;'/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' '(((LTLAPp5==true) U (LTLAPp6==true))||X(<>((LTLAPp6==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin6667914151272522761;'/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' '(((LTLAPp5==true) U (LTLAPp6==true))||X(<>((LTLAPp6==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin6667914151272522761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((X(!(LTLAPp0==true)) U ((LTLAPp1==true)||<>([]((LTLAPp2==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-06 17:23:28] [INFO ] Applying decomposition
[2025-06-06 17:23:29] [INFO ] Flatten gal took : 140 ms
[2025-06-06 17:23:29] [INFO ] Decomposing Gal with order
[2025-06-06 17:23:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 17:23:29] [INFO ] Removed a total of 60 redundant transitions.
[2025-06-06 17:23:29] [INFO ] Flatten gal took : 211 ms
[2025-06-06 17:23:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 125 ms.
[2025-06-06 17:23:29] [INFO ] Time to serialize gal into /tmp/LTLFireability14745153337762718292.gal : 35 ms
[2025-06-06 17:23:29] [INFO ] Time to serialize properties into /tmp/LTLFireability9051758217131515534.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14745153337762718292.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9051758217131515534.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...277
Read 3 LTL properties
Checking formula 0 : !((X(X((X(!("(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u28.p54==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.p10==1))&&(i0.i0.i0.i0.i0.i0.i0.i0...295
Formula 0 simplified : XX(X"(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u28.p54==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.p10==1))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i1...280
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-010B"
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 ShieldPPPs-PT-010B, 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 r198-tall-174894533200692"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-010B.tgz
mv ShieldPPPs-PT-010B 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 ;