About the Execution of ITS-Tools for PolyORBLF-COL-S02J06T10
| 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 | ?FT?TFFFTF??TFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253800307.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 PolyORBLF-COL-S02J06T10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253800307
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K 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.6K 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 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 154K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748922613074
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-03 03:50:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 03:50:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 03:50:14] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-03 03:50:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 03:50:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 614 ms
[2025-06-03 03:50:15] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 844 PT places and 1904.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2025-06-03 03:50:15] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2025-06-03 03:50:15] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40001 steps (16 resets) in 1432 ms. (27 steps per ms) remains 12/35 properties
BEST_FIRST walk for 40003 steps (12 resets) in 430 ms. (92 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (17 resets) in 275 ms. (144 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (9 resets) in 132 ms. (300 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (13 resets) in 197 ms. (202 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (19 resets) in 181 ms. (219 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (9 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (12 resets) in 158 ms. (251 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (11 resets) in 189 ms. (210 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (12 resets) in 203 ms. (196 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (12 resets) in 129 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (10 resets) in 136 ms. (291 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (14 resets) in 154 ms. (258 steps per ms) remains 12/12 properties
[2025-06-03 03:50:16] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-03 03:50:16] [INFO ] Computed 26 invariants in 11 ms
[2025-06-03 03:50:16] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 1 (OVERLAPS) 40/52 variables, 8/8 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/56 variables, 3/11 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 7 solved, 5 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 5 (OVERLAPS) 25/81 variables, 15/26 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 11 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 11 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 2/2 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/23 variables, 2/4 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/46 variables, 3/7 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/49 variables, 2/9 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 11 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:50:16] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 1/114 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/114 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/116 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/117 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/117 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/117 constraints. Problems are: Problem set: 11 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 117 constraints, problems are : Problem set: 11 solved, 1 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/12 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 574ms problems are : Problem set: 11 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 39 place count 61 transition count 46
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 59 transition count 44
Applied a total of 43 rules in 30 ms. Remains 59 /81 variables (removed 22) and now considering 44/65 (removed 21) transitions.
Running 43 sub problems to find dead transitions.
[2025-06-03 03:50:17] [INFO ] Flow matrix only has 43 transitions (discarded 1 similar events)
// Phase 1: matrix 43 rows 59 cols
[2025-06-03 03:50:17] [INFO ] Computed 25 invariants in 1 ms
[2025-06-03 03:50:17] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:50:17] [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-03 03:50:17] [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-03 03:50:17] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/28 constraints. Problems are: Problem set: 2 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:50:17] [INFO ] Deduced a trap composed of 9 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-03 03:50:17] [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-03 03:50:17] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:50:17] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 4/32 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 43/102 variables, 59/91 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 8/99 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/99 constraints. Problems are: Problem set: 2 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:50:18] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:50:18] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/102 variables, 2/101 constraints. Problems are: Problem set: 2 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:50:18] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 1/102 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 13 (OVERLAPS) 0/102 variables, 0/102 constraints. Problems are: Problem set: 2 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 102 constraints, problems are : Problem set: 2 solved, 41 unsolved in 2021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 41 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 6/30 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/31 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 4/35 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 43/102 variables, 59/94 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 8/102 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 41/143 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/102 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 143 constraints, problems are : Problem set: 2 solved, 41 unsolved in 1909 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 41/43 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3958ms problems are : Problem set: 2 solved, 41 unsolved
Search for dead transitions found 2 dead transitions in 3959ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/81 places, 42/65 transitions.
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 194 edges and 57 vertex of which 1 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.2 ms
Discarding 56 places :
Also discarding 39 output transitions
Drop transitions (Output transitions of discarded places.) removed 39 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1 transition count 1
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 8 ms. Remains 1 /59 variables (removed 58) and now considering 0/42 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4008 ms. Remains : 1/81 places, 0/65 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 12 atomic propositions for a total of 15 simplifications.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 03:50:21] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2025-06-03 03:50:21] [INFO ] Flatten gal took : 27 ms
[2025-06-03 03:50:21] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 03:50:21] [INFO ] Flatten gal took : 8 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-03 03:50:21] [INFO ] Unfolded HLPN to a Petri net with 844 places and 1812 transitions 8302 arcs in 35 ms.
[2025-06-03 03:50:21] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 316 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Applied a total of 2 rules in 52 ms. Remains 842 /844 variables (removed 2) and now considering 1652/1652 (removed 0) transitions.
Running 1650 sub problems to find dead transitions.
[2025-06-03 03:50:21] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 842 cols
[2025-06-03 03:50:21] [INFO ] Computed 56 invariants in 70 ms
[2025-06-03 03:50:21] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
SMT process timed out in 21617ms, After SMT, problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 21627ms
[2025-06-03 03:50:42] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2025-06-03 03:50:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:50:43] [INFO ] Implicit Places using invariants in 642 ms returned [646, 647, 648, 649, 650, 651, 652, 653, 654, 655]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 649 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 832/844 places, 1652/1652 transitions.
Applied a total of 0 rules in 18 ms. Remains 832 /832 variables (removed 0) and now considering 1652/1652 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22354 ms. Remains : 832/844 places, 1652/1652 transitions.
Support contains 316 out of 832 places after structural reductions.
[2025-06-03 03:50:43] [INFO ] Flatten gal took : 119 ms
[2025-06-03 03:50:43] [INFO ] Flatten gal took : 100 ms
[2025-06-03 03:50:44] [INFO ] Input system was already deterministic with 1652 transitions.
RANDOM walk for 40000 steps (12 resets) in 436 ms. (91 steps per ms) remains 3/20 properties
BEST_FIRST walk for 40002 steps (8 resets) in 207 ms. (192 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (9 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (9 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
[2025-06-03 03:50:44] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 832 cols
[2025-06-03 03:50:44] [INFO ] Computed 46 invariants in 42 ms
[2025-06-03 03:50:44] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 499/520 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 221/741 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:50:44] [INFO ] Deduced a trap composed of 253 places in 232 ms of which 48 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/741 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/741 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 829/2464 variables, and 45 constraints, problems are : Problem set: 3 solved, 0 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/832 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 743ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 7 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(F(p0))||(F(p0)&&X(p1)))) U X(G(p2))))'
Support contains 31 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 822 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 812 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 812 transition count 1632
Applied a total of 40 rules in 72 ms. Remains 812 /832 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2025-06-03 03:50:45] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2025-06-03 03:50:45] [INFO ] Computed 46 invariants in 33 ms
[2025-06-03 03:50:45] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
SMT process timed out in 21226ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 21231ms
[2025-06-03 03:51:06] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 03:51:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:51:07] [INFO ] Implicit Places using invariants in 806 ms returned []
[2025-06-03 03:51:07] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 03:51:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:51:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 03:51:26] [INFO ] Implicit Places using invariants and state equation in 18557 ms returned []
Implicit Place search using SMT with State Equation took 19367 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2025-06-03 03:51:26] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 03:51:26] [INFO ] Invariant cache hit.
[2025-06-03 03:51:26] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:50] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:51] [INFO ] Deduced a trap composed of 72 places in 385 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:51] [INFO ] Deduced a trap composed of 197 places in 450 ms of which 150 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:53] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:53] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:51:53] [INFO ] Deduced a trap composed of 72 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-03 03:51:53] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 51 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:02] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:02] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:02] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:04] [INFO ] Deduced a trap composed of 72 places in 392 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:04] [INFO ] Deduced a trap composed of 442 places in 479 ms of which 162 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:52:17] [INFO ] Deduced a trap composed of 57 places in 308 ms of which 55 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61100ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 61106ms
Starting structural reductions in LTL mode, iteration 1 : 812/832 places, 1632/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101790 ms. Remains : 812/832 places, 1632/1652 transitions.
Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) p2 (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-00
Product exploration explored 100000 steps with 12779 reset in 490 ms.
Product exploration explored 100000 steps with 12744 reset in 437 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 (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 195 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) p2 (NOT p1))]
RANDOM walk for 40001 steps (11 resets) in 341 ms. (116 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40000 steps (9 resets) in 231 ms. (172 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
[2025-06-03 03:52:29] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 03:52:29] [INFO ] Invariant cache hit.
[2025-06-03 03:52:29] [INFO ] State equation strengthened by 120 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 258/289 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Real declared 797/2424 variables, and 31 constraints, problems are : Problem set: 2 solved, 0 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 3/14 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 164ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X p1)), (G (OR p0 (NOT p2) p1)), (G (OR (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F p2), (F (NOT (OR p2 p1))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 288 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0)]
[2025-06-03 03:52:30] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 03:52:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 03:52:32] [INFO ] [Real]Absence check using 14 positive place invariants in 1406 ms returned sat
[2025-06-03 03:52:34] [INFO ] [Real]Absence check using 14 positive and 32 generalized place invariants in 1966 ms returned sat
[2025-06-03 03:52:41] [INFO ] [Real]Absence check using state equation in 6900 ms returned sat
[2025-06-03 03:52:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 03:52:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 58 ms returned sat
[2025-06-03 03:52:43] [INFO ] [Nat]Absence check using 14 positive and 32 generalized place invariants in 1663 ms returned sat
[2025-06-03 03:52:56] [INFO ] [Nat]Absence check using state equation in 12467 ms returned unknown
Could not prove EG (NOT p2)
Support contains 31 out of 812 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Applied a total of 0 rules in 24 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2025-06-03 03:52:56] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 03:52:56] [INFO ] Invariant cache hit.
[2025-06-03 03:52:56] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
SMT process timed out in 21017ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 21023ms
[2025-06-03 03:53:17] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 03:53:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:53:18] [INFO ] Implicit Places using invariants in 813 ms returned []
[2025-06-03 03:53:18] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 03:53:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:53:18] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 03:53:36] [INFO ] Implicit Places using invariants and state equation in 18450 ms returned []
Implicit Place search using SMT with State Equation took 19266 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2025-06-03 03:53:36] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 03:53:36] [INFO ] Invariant cache hit.
[2025-06-03 03:53:36] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:54:00] [INFO ] Deduced a trap composed of 72 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-03 03:54:01] [INFO ] Deduced a trap composed of 72 places in 379 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:54:01] [INFO ] Deduced a trap composed of 197 places in 445 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:54:03] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:54:03] [INFO ] Deduced a trap composed of 72 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-03 03:54:03] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:54:03] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 51 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:54:12] [INFO ] Deduced a trap composed of 72 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-03 03:54:12] [INFO ] Deduced a trap composed of 72 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-03 03:54:12] [INFO ] Deduced a trap composed of 72 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-03 03:54:14] [INFO ] Deduced a trap composed of 72 places in 379 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:54:15] [INFO ] Deduced a trap composed of 442 places in 453 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:54:27] [INFO ] Deduced a trap composed of 57 places in 277 ms of which 55 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61114ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 61121ms
Finished structural reductions in LTL mode , in 1 iterations and 101446 ms. Remains : 812/812 places, 1632/1632 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 102 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0)]
RANDOM walk for 896 steps (0 resets) in 17 ms. (49 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 11 factoid took 277 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0)]
[2025-06-03 03:54:38] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 03:54:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 03:54:40] [INFO ] [Real]Absence check using 14 positive place invariants in 1384 ms returned sat
[2025-06-03 03:54:42] [INFO ] [Real]Absence check using 14 positive and 32 generalized place invariants in 1958 ms returned sat
[2025-06-03 03:54:49] [INFO ] [Real]Absence check using state equation in 6885 ms returned sat
[2025-06-03 03:54:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 03:54:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 58 ms returned sat
[2025-06-03 03:54:52] [INFO ] [Nat]Absence check using 14 positive and 32 generalized place invariants in 1670 ms returned sat
[2025-06-03 03:55:04] [INFO ] [Nat]Absence check using state equation in 12456 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0)]
Product exploration explored 100000 steps with 12885 reset in 346 ms.
Product exploration explored 100000 steps with 12807 reset in 350 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0)]
Support contains 31 out of 812 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 812 transition count 1632
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 50 place count 812 transition count 1742
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 150 place count 812 transition count 1742
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 160 place count 802 transition count 1732
Deduced a syphon composed of 140 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 170 place count 802 transition count 1732
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 200 places in 1 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 230 place count 802 transition count 1732
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 260 place count 772 transition count 1702
Deduced a syphon composed of 180 places in 1 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 290 place count 772 transition count 1702
Deduced a syphon composed of 180 places in 0 ms
Applied a total of 290 rules in 243 ms. Remains 772 /812 variables (removed 40) and now considering 1702/1632 (removed -70) transitions.
Running 1700 sub problems to find dead transitions.
[2025-06-03 03:55:06] [INFO ] Flow matrix only has 1682 transitions (discarded 20 similar events)
// Phase 1: matrix 1682 rows 772 cols
[2025-06-03 03:55:06] [INFO ] Computed 46 invariants in 23 ms
[2025-06-03 03:55:06] [INFO ] State equation strengthened by 160 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/770 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1700 unsolved
SMT process timed out in 21255ms, After SMT, problems are : Problem set: 0 solved, 1700 unsolved
Search for dead transitions found 0 dead transitions in 21260ms
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:55:27] [INFO ] Redundant transitions in 80 ms returned []
Running 1700 sub problems to find dead transitions.
[2025-06-03 03:55:27] [INFO ] Flow matrix only has 1682 transitions (discarded 20 similar events)
[2025-06-03 03:55:27] [INFO ] Invariant cache hit.
[2025-06-03 03:55:27] [INFO ] State equation strengthened by 160 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/770 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/770 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:51] [INFO ] Deduced a trap composed of 50 places in 206 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:51] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:51] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:51] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:51] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:51] [INFO ] Deduced a trap composed of 50 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-03 03:55:51] [INFO ] Deduced a trap composed of 50 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-03 03:55:52] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:52] [INFO ] Deduced a trap composed of 50 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-03 03:55:52] [INFO ] Deduced a trap composed of 37 places in 365 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:53] [INFO ] Deduced a trap composed of 50 places in 364 ms of which 63 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:53] [INFO ] Deduced a trap composed of 217 places in 428 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:55:54] [INFO ] Deduced a trap composed of 226 places in 468 ms of which 138 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 770/2454 variables, and 57 constraints, problems are : Problem set: 20 solved, 1680 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1700/1700 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 1680 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/770 variables, 16/16 constraints. Problems are: Problem set: 20 solved, 1680 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/770 variables, 28/44 constraints. Problems are: Problem set: 20 solved, 1680 unsolved
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/770 variables, 13/57 constraints. Problems are: Problem set: 40 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 770/2454 variables, and 57 constraints, problems are : Problem set: 40 solved, 1660 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1700 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61297ms problems are : Problem set: 40 solved, 1660 unsolved
Search for dead transitions found 40 dead transitions in 61302ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 772/812 places, 1662/1632 transitions.
Graph (complete) has 4166 edges and 772 vertex of which 752 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.4 ms
Discarding 20 places :
Also discarding 0 output transitions
Deduced a syphon composed of 160 places in 1 ms
Applied a total of 1 rules in 34 ms. Remains 752 /772 variables (removed 20) and now considering 1662/1662 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 752/812 places, 1662/1632 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 82936 ms. Remains : 752/812 places, 1662/1632 transitions.
Built C files in :
/tmp/ltsmin6937058718477280977
[2025-06-03 03:56:28] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6937058718477280977
Running compilation step : cd /tmp/ltsmin6937058718477280977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6937058718477280977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6937058718477280977;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 31 out of 812 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Applied a total of 0 rules in 12 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2025-06-03 03:56:31] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2025-06-03 03:56:31] [INFO ] Computed 46 invariants in 24 ms
[2025-06-03 03:56:31] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
SMT process timed out in 21152ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 21155ms
[2025-06-03 03:56:53] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 03:56:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:56:53] [INFO ] Implicit Places using invariants in 803 ms returned []
[2025-06-03 03:56:53] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 03:56:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:56:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 03:57:12] [INFO ] Implicit Places using invariants and state equation in 18577 ms returned []
Implicit Place search using SMT with State Equation took 19384 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2025-06-03 03:57:12] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 03:57:12] [INFO ] Invariant cache hit.
[2025-06-03 03:57:12] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:36] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:37] [INFO ] Deduced a trap composed of 72 places in 374 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:38] [INFO ] Deduced a trap composed of 197 places in 454 ms of which 150 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:39] [INFO ] Deduced a trap composed of 72 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-03 03:57:39] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:39] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:39] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 9 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 5.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 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)timeout
(s99 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 51 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:48] [INFO ] Deduced a trap composed of 72 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-03 03:57:48] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:48] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:50] [INFO ] Deduced a trap composed of 72 places in 386 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:57:51] [INFO ] Deduced a trap composed of 442 places in 453 ms of which 162 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:58:04] [INFO ] Deduced a trap composed of 57 places in 280 ms of which 55 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61181ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 61185ms
Finished structural reductions in LTL mode , in 1 iterations and 101748 ms. Remains : 812/812 places, 1632/1632 transitions.
Built C files in :
/tmp/ltsmin17054245103355900316
[2025-06-03 03:58:13] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17054245103355900316
Running compilation step : cd /tmp/ltsmin17054245103355900316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17054245103355900316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17054245103355900316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 03:58:16] [INFO ] Flatten gal took : 77 ms
[2025-06-03 03:58:16] [INFO ] Flatten gal took : 67 ms
[2025-06-03 03:58:16] [INFO ] Time to serialize gal into /tmp/LTL6363511122173298412.gal : 19 ms
[2025-06-03 03:58:16] [INFO ] Time to serialize properties into /tmp/LTL16861032361508018503.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6363511122173298412.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9277405806124788013.hoa' '-atoms' '/tmp/LTL16861032361508018503.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/LTL16861032361508018503.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9277405806124788013.hoa
Detected timeout of ITS tools.
[2025-06-03 03:58:32] [INFO ] Flatten gal took : 61 ms
[2025-06-03 03:58:32] [INFO ] Flatten gal took : 61 ms
[2025-06-03 03:58:32] [INFO ] Time to serialize gal into /tmp/LTL10452429855605787890.gal : 11 ms
[2025-06-03 03:58:32] [INFO ] Time to serialize properties into /tmp/LTL18357367345285394935.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10452429855605787890.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18357367345285394935.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 : !(((F((G(F("(NoSigAbort<=((((NotifyEventJobQueuedE_0+NotifyEventJobQueuedE_1)+(NotifyEventJobQueuedE_2+NotifyEventJobQueuedE_3))+((Not...1037
Formula 0 simplified : G(FG!"(NoSigAbort<=((((NotifyEventJobQueuedE_0+NotifyEventJobQueuedE_1)+(NotifyEventJobQueuedE_2+NotifyEventJobQueuedE_3))+((NotifyE...1020
Detected timeout of ITS tools.
[2025-06-03 03:58:47] [INFO ] Flatten gal took : 53 ms
[2025-06-03 03:58:47] [INFO ] Applying decomposition
[2025-06-03 03:58:47] [INFO ] Flatten gal took : 55 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/graph4519025792689872299.txt' '-o' '/tmp/graph4519025792689872299.bin' '-w' '/tmp/graph4519025792689872299.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4519025792689872299.bin' '-l' '-1' '-v' '-w' '/tmp/graph4519025792689872299.weights' '-q' '0' '-e' '0.001'
[2025-06-03 03:58:47] [INFO ] Decomposing Gal with order
[2025-06-03 03:58:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 03:58:48] [INFO ] Removed a total of 1894 redundant transitions.
[2025-06-03 03:58:48] [INFO ] Flatten gal took : 425 ms
[2025-06-03 03:58:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 994 labels/synchronizations in 89 ms.
[2025-06-03 03:58:48] [INFO ] Time to serialize gal into /tmp/LTL1689137901069161982.gal : 13 ms
[2025-06-03 03:58:48] [INFO ] Time to serialize properties into /tmp/LTL7012344732803051285.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/LTL1689137901069161982.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7012344732803051285.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 : !(((F((G(F("(gu11.NoSigAbort<=((((gu11.NotifyEventJobQueuedE_0+gu11.NotifyEventJobQueuedE_1)+(gu11.NotifyEventJobQueuedE_2+gu11.Notify...1247
Formula 0 simplified : G(FG!"(gu11.NoSigAbort<=((((gu11.NotifyEventJobQueuedE_0+gu11.NotifyEventJobQueuedE_1)+(gu11.NotifyEventJobQueuedE_2+gu11.NotifyEven...1230
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-00 finished in 498173 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(p1))))'
Support contains 21 out of 832 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 832 transition count 1572
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 752 transition count 1572
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 160 place count 752 transition count 1472
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 360 place count 652 transition count 1472
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 370 place count 642 transition count 1462
Iterating global reduction 2 with 10 rules applied. Total rules applied 380 place count 642 transition count 1462
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 520 place count 572 transition count 1392
Applied a total of 520 rules in 82 ms. Remains 572 /832 variables (removed 260) and now considering 1392/1652 (removed 260) transitions.
Running 1390 sub problems to find dead transitions.
[2025-06-03 03:59:03] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 572 cols
[2025-06-03 03:59:03] [INFO ] Computed 46 invariants in 17 ms
[2025-06-03 03:59:03] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:59:21] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:59:21] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:59:21] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:59:21] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:59:22] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:59:22] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:59:22] [INFO ] Deduced a trap composed of 48 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-03 03:59:22] [INFO ] Deduced a trap composed of 48 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-03 03:59:22] [INFO ] Deduced a trap composed of 48 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-03 03:59:22] [INFO ] Deduced a trap composed of 197 places in 345 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:59:23] [INFO ] Deduced a trap composed of 206 places in 345 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:59:23] [INFO ] Deduced a trap composed of 187 places in 339 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:59:23] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 28 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 57 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:59:29] [INFO ] Deduced a trap composed of 48 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-03 03:59:35] [INFO ] Deduced a trap composed of 372 places in 340 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:59:43] [INFO ] Deduced a trap composed of 66 places in 294 ms of which 61 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 5)
(s1 5)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(timeout
s142 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 60 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41128ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41130ms
[2025-06-03 03:59:44] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 03:59:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:59:45] [INFO ] Implicit Places using invariants in 1122 ms returned []
[2025-06-03 03:59:45] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 03:59:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 03:59:46] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 03:59:58] [INFO ] Implicit Places using invariants and state equation in 12343 ms returned []
Implicit Place search using SMT with State Equation took 13468 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 03:59:58] [INFO ] Redundant transitions in 69 ms returned []
Running 1390 sub problems to find dead transitions.
[2025-06-03 03:59:58] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 03:59:58] [INFO ] Invariant cache hit.
[2025-06-03 03:59:58] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:00:15] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:00:15] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:00:15] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:00:15] [INFO ] Deduced a trap composed of 48 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-03 04:00:15] [INFO ] Deduced a trap composed of 48 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-03 04:00:16] [INFO ] Deduced a trap composed of 48 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-03 04:00:16] [INFO ] Deduced a trap composed of 48 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-03 04:00:16] [INFO ] Deduced a trap composed of 48 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-03 04:00:16] [INFO ] Deduced a trap composed of 48 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-03 04:00:16] [INFO ] Deduced a trap composed of 197 places in 339 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:00:17] [INFO ] Deduced a trap composed of 206 places in 352 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:00:17] [INFO ] Deduced a trap composed of 187 places in 340 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:00:17] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:00:19] [INFO ] Deduced a trap composed of 48 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-03 04:00:20] [INFO ] Deduced a trap composed of 57 places in 200 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:00:29] [INFO ] Deduced a trap composed of 66 places in 300 ms of which 59 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 60 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 60 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61111ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 61113ms
Starting structural reductions in SI_LTL mode, iteration 1 : 572/832 places, 1392/1652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115872 ms. Remains : 572/832 places, 1392/1652 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-03
Product exploration explored 100000 steps with 6452 reset in 313 ms.
Product exploration explored 100000 steps with 6439 reset in 336 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 106 steps (0 resets) in 5 ms. (17 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2025-06-03 04:01:00] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 04:01:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 04:01:02] [INFO ] [Real]Absence check using 15 positive place invariants in 733 ms returned sat
[2025-06-03 04:01:05] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 3046 ms returned sat
[2025-06-03 04:01:15] [INFO ] [Real]Absence check using state equation in 10646 ms returned unknown
Could not prove EG (NOT p1)
Support contains 21 out of 572 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 572/572 places, 1392/1392 transitions.
Applied a total of 0 rules in 24 ms. Remains 572 /572 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Running 1390 sub problems to find dead transitions.
[2025-06-03 04:01:15] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 04:01:15] [INFO ] Invariant cache hit.
[2025-06-03 04:01:15] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:32] [INFO ] Deduced a trap composed of 48 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-03 04:01:33] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:33] [INFO ] Deduced a trap composed of 48 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-03 04:01:33] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:33] [INFO ] Deduced a trap composed of 48 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-03 04:01:33] [INFO ] Deduced a trap composed of 48 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-03 04:01:33] [INFO ] Deduced a trap composed of 48 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-03 04:01:33] [INFO ] Deduced a trap composed of 48 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-03 04:01:33] [INFO ] Deduced a trap composed of 48 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-03 04:01:33] [INFO ] Deduced a trap composed of 197 places in 343 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:34] [INFO ] Deduced a trap composed of 206 places in 358 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:34] [INFO ] Deduced a trap composed of 187 places in 341 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:34] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:01:37] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 2 ms to minimize.
SMT process timed out in 21177ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 21180ms
[2025-06-03 04:01:37] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 04:01:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:01:38] [INFO ] Implicit Places using invariants in 1148 ms returned []
[2025-06-03 04:01:38] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 04:01:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:01:38] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 04:01:50] [INFO ] Implicit Places using invariants and state equation in 12332 ms returned []
Implicit Place search using SMT with State Equation took 13482 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:01:50] [INFO ] Redundant transitions in 29 ms returned []
Running 1390 sub problems to find dead transitions.
[2025-06-03 04:01:50] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 04:01:50] [INFO ] Invariant cache hit.
[2025-06-03 04:01:50] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:08] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:08] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:08] [INFO ] Deduced a trap composed of 48 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-03 04:02:08] [INFO ] Deduced a trap composed of 48 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-03 04:02:08] [INFO ] Deduced a trap composed of 48 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-03 04:02:08] [INFO ] Deduced a trap composed of 48 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-03 04:02:08] [INFO ] Deduced a trap composed of 48 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-03 04:02:08] [INFO ] Deduced a trap composed of 48 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-03 04:02:08] [INFO ] Deduced a trap composed of 48 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-03 04:02:09] [INFO ] Deduced a trap composed of 197 places in 339 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:09] [INFO ] Deduced a trap composed of 206 places in 346 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:10] [INFO ] Deduced a trap composed of 187 places in 336 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:10] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:12] [INFO ] Deduced a trap composed of 48 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-03 04:02:12] [INFO ] Deduced a trap composed of 57 places in 167 ms of which 31 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.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 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 9.0)
(s213 0.0)
(s214 1.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:44] [INFO ] Deduced a trap composed of 216 places in 319 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:02:45] [INFO ] Deduced a trap composed of 152 places in 297 ms of which 80 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 61 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61142ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 61144ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 95873 ms. Remains : 572/572 places, 1392/1392 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 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 86 steps (0 resets) in 5 ms. (14 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 140 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 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)]
[2025-06-03 04:02:52] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 04:02:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 04:02:53] [INFO ] [Real]Absence check using 15 positive place invariants in 734 ms returned sat
[2025-06-03 04:02:56] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 3022 ms returned sat
[2025-06-03 04:03:07] [INFO ] [Real]Absence check using state equation in 10666 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 6427 reset in 314 ms.
Product exploration explored 100000 steps with 6453 reset in 330 ms.
Built C files in :
/tmp/ltsmin11201942414744179161
[2025-06-03 04:03:08] [INFO ] Computing symmetric may disable matrix : 1392 transitions.
[2025-06-03 04:03:08] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 04:03:08] [INFO ] Computing symmetric may enable matrix : 1392 transitions.
[2025-06-03 04:03:08] [INFO ] Computation of Complete enable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 04:03:08] [INFO ] Computing Do-Not-Accords matrix : 1392 transitions.
[2025-06-03 04:03:08] [INFO ] Computation of Completed DNA matrix. took 50 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 04:03:08] [INFO ] Built C files in 483ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11201942414744179161
Running compilation step : cd /tmp/ltsmin11201942414744179161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11201942414744179161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11201942414744179161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 21 out of 572 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 572/572 places, 1392/1392 transitions.
Applied a total of 0 rules in 27 ms. Remains 572 /572 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Running 1390 sub problems to find dead transitions.
[2025-06-03 04:03:11] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 04:03:11] [INFO ] Invariant cache hit.
[2025-06-03 04:03:11] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:28] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:28] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:28] [INFO ] Deduced a trap composed of 48 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-03 04:03:28] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:28] [INFO ] Deduced a trap composed of 48 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-03 04:03:28] [INFO ] Deduced a trap composed of 48 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-03 04:03:28] [INFO ] Deduced a trap composed of 48 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-03 04:03:28] [INFO ] Deduced a trap composed of 48 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-03 04:03:29] [INFO ] Deduced a trap composed of 48 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-03 04:03:29] [INFO ] Deduced a trap composed of 197 places in 334 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:29] [INFO ] Deduced a trap composed of 206 places in 343 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:30] [INFO ] Deduced a trap composed of 187 places in 336 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:30] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:32] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 58 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:40] [INFO ] Deduced a trap composed of 57 places in 159 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:03:50] [INFO ] Deduced a trap composed of 66 places in 296 ms of which 60 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 60 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41050ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41053ms
[2025-06-03 04:03:52] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 04:03:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:03:53] [INFO ] Implicit Places using invariants in 1129 ms returned []
[2025-06-03 04:03:53] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 04:03:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:03:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 04:04:06] [INFO ] Implicit Places using invariants and state equation in 12554 ms returned []
Implicit Place search using SMT with State Equation took 13686 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:04:06] [INFO ] Redundant transitions in 17 ms returned []
Running 1390 sub problems to find dead transitions.
[2025-06-03 04:04:06] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 04:04:06] [INFO ] Invariant cache hit.
[2025-06-03 04:04:06] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:23] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:23] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:23] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:23] [INFO ] Deduced a trap composed of 48 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-03 04:04:23] [INFO ] Deduced a trap composed of 48 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-03 04:04:23] [INFO ] Deduced a trap composed of 48 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-03 04:04:23] [INFO ] Deduced a trap composed of 48 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-03 04:04:23] [INFO ] Deduced a trap composed of 48 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-03 04:04:24] [INFO ] Deduced a trap composed of 48 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-03 04:04:24] [INFO ] Deduced a trap composed of 197 places in 344 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:24] [INFO ] Deduced a trap composed of 206 places in 346 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:25] [INFO ] Deduced a trap composed of 187 places in 335 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:25] [INFO ] Deduced a trap composed of 23 places in 262 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:27] [INFO ] Deduced a trap composed of 48 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-03 04:04:27] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:04:37] [INFO ] Deduced a trap composed of 66 places in 311 ms of which 60 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 60 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 60 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61143ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 61145ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 115943 ms. Remains : 572/572 places, 1392/1392 transitions.
Built C files in :
/tmp/ltsmin12502793203647581868
[2025-06-03 04:05:07] [INFO ] Computing symmetric may disable matrix : 1392 transitions.
[2025-06-03 04:05:07] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 04:05:07] [INFO ] Computing symmetric may enable matrix : 1392 transitions.
[2025-06-03 04:05:07] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 04:05:07] [INFO ] Computing Do-Not-Accords matrix : 1392 transitions.
[2025-06-03 04:05:07] [INFO ] Computation of Completed DNA matrix. took 62 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 04:05:07] [INFO ] Built C files in 403ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12502793203647581868
Running compilation step : cd /tmp/ltsmin12502793203647581868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12502793203647581868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12502793203647581868;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 04:05:11] [INFO ] Flatten gal took : 85 ms
[2025-06-03 04:05:11] [INFO ] Flatten gal took : 83 ms
[2025-06-03 04:05:11] [INFO ] Time to serialize gal into /tmp/LTL6642060026735052712.gal : 8 ms
[2025-06-03 04:05:11] [INFO ] Time to serialize properties into /tmp/LTL13765208803514619130.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/LTL6642060026735052712.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9743309193762134010.hoa' '-atoms' '/tmp/LTL13765208803514619130.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/LTL13765208803514619130.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9743309193762134010.hoa
Detected timeout of ITS tools.
[2025-06-03 04:05:26] [INFO ] Flatten gal took : 50 ms
[2025-06-03 04:05:26] [INFO ] Flatten gal took : 49 ms
[2025-06-03 04:05:26] [INFO ] Time to serialize gal into /tmp/LTL5183471645231964589.gal : 7 ms
[2025-06-03 04:05:26] [INFO ] Time to serialize properties into /tmp/LTL5181939614013937589.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/LTL5183471645231964589.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5181939614013937589.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("(((((FetchJobB_0+FetchJobB_1)+(FetchJobB_2+FetchJobB_3))+((FetchJobB_4+FetchJobB_5)+(FetchJobB_6+FetchJobB_7)))+(FetchJobB_8+...310
Formula 0 simplified : F(G!"(((((FetchJobB_0+FetchJobB_1)+(FetchJobB_2+FetchJobB_3))+((FetchJobB_4+FetchJobB_5)+(FetchJobB_6+FetchJobB_7)))+(FetchJobB_8+Fe...302
Detected timeout of ITS tools.
[2025-06-03 04:05:41] [INFO ] Flatten gal took : 48 ms
[2025-06-03 04:05:41] [INFO ] Applying decomposition
[2025-06-03 04:05:41] [INFO ] Flatten gal took : 49 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/graph16004924007297864934.txt' '-o' '/tmp/graph16004924007297864934.bin' '-w' '/tmp/graph16004924007297864934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16004924007297864934.bin' '-l' '-1' '-v' '-w' '/tmp/graph16004924007297864934.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:05:41] [INFO ] Decomposing Gal with order
[2025-06-03 04:05:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:05:41] [INFO ] Removed a total of 1283 redundant transitions.
[2025-06-03 04:05:41] [INFO ] Flatten gal took : 184 ms
[2025-06-03 04:05:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 1317 labels/synchronizations in 63 ms.
[2025-06-03 04:05:42] [INFO ] Time to serialize gal into /tmp/LTL3749353672219106736.gal : 10 ms
[2025-06-03 04:05:42] [INFO ] Time to serialize properties into /tmp/LTL12896674269006904264.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/LTL3749353672219106736.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12896674269006904264.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 : !((G((F("(((((gu6.FetchJobB_0+gu6.FetchJobB_1)+(gu6.FetchJobB_2+gu6.FetchJobB_3))+((gu6.FetchJobB_4+gu6.FetchJobB_5)+(gu6.FetchJobB_6+...404
Formula 0 simplified : F(G!"(((((gu6.FetchJobB_0+gu6.FetchJobB_1)+(gu6.FetchJobB_2+gu6.FetchJobB_3))+((gu6.FetchJobB_4+gu6.FetchJobB_5)+(gu6.FetchJobB_6+gu...396
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-03 finished in 413598 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 X(p1))&&X(X(X(F(p2))))))'
Support contains 93 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 822 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 812 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 812 transition count 1632
Applied a total of 40 rules in 45 ms. Remains 812 /832 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2025-06-03 04:05:57] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2025-06-03 04:05:57] [INFO ] Computed 46 invariants in 26 ms
[2025-06-03 04:05:57] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
SMT process timed out in 21188ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 21191ms
[2025-06-03 04:06:18] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:06:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:06:19] [INFO ] Implicit Places using invariants in 839 ms returned []
[2025-06-03 04:06:19] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:06:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:06:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 04:06:37] [INFO ] Implicit Places using invariants and state equation in 18477 ms returned []
Implicit Place search using SMT with State Equation took 19318 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2025-06-03 04:06:37] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:06:37] [INFO ] Invariant cache hit.
[2025-06-03 04:06:37] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:01] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:02] [INFO ] Deduced a trap composed of 72 places in 367 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:03] [INFO ] Deduced a trap composed of 197 places in 433 ms of which 150 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:04] [INFO ] Deduced a trap composed of 72 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-03 04:07:04] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:04] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:04] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 9 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 5.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 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 9.0)
(s243 0.0)
(s244 1.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 4.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 1.0)
(s531 0.0)
(s532 1.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 0.0)
(s538 1.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 1.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 2.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 1.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 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 810/2424 variables, and 51 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:14] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:14] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:14] [INFO ] Deduced a trap composed of 72 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-03 04:07:16] [INFO ] Deduced a trap composed of 72 places in 381 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:16] [INFO ] Deduced a trap composed of 442 places in 464 ms of which 162 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:07:29] [INFO ] Deduced a trap composed of 57 places in 288 ms of which 56 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 5)
(s1 5)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 9)
(s243 1)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 1)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 1)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61186ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 61189ms
Starting structural reductions in LTL mode, iteration 1 : 812/832 places, 1632/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101755 ms. Remains : 812/832 places, 1632/1652 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-07
Product exploration explored 100000 steps with 1137 reset in 397 ms.
Stack based approach found an accepted trace after 580 steps with 2 reset with depth 577 and stack size 577 in 3 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-07 finished in 102461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 30 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 822 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 822 transition count 1642
Applied a total of 20 rules in 23 ms. Remains 822 /832 variables (removed 10) and now considering 1642/1652 (removed 10) transitions.
Running 1640 sub problems to find dead transitions.
[2025-06-03 04:07:39] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
// Phase 1: matrix 1622 rows 822 cols
[2025-06-03 04:07:39] [INFO ] Computed 46 invariants in 27 ms
[2025-06-03 04:07:39] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
SMT process timed out in 21169ms, After SMT, problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 21171ms
[2025-06-03 04:08:00] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
[2025-06-03 04:08:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:08:01] [INFO ] Implicit Places using invariants in 839 ms returned []
[2025-06-03 04:08:01] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
[2025-06-03 04:08:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:08:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 04:08:12] [INFO ] Implicit Places using invariants and state equation in 10538 ms returned []
Implicit Place search using SMT with State Equation took 11378 ms to find 0 implicit places.
Running 1640 sub problems to find dead transitions.
[2025-06-03 04:08:12] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
[2025-06-03 04:08:12] [INFO ] Invariant cache hit.
[2025-06-03 04:08:12] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:35] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:35] [INFO ] Deduced a trap composed of 73 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-03 04:08:35] [INFO ] Deduced a trap composed of 73 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-03 04:08:36] [INFO ] Deduced a trap composed of 73 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-03 04:08:36] [INFO ] Deduced a trap composed of 73 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-03 04:08:36] [INFO ] Deduced a trap composed of 73 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-03 04:08:36] [INFO ] Deduced a trap composed of 73 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-03 04:08:36] [INFO ] Deduced a trap composed of 73 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-03 04:08:36] [INFO ] Deduced a trap composed of 73 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-03 04:08:37] [INFO ] Deduced a trap composed of 397 places in 579 ms of which 267 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:37] [INFO ] Deduced a trap composed of 73 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-03 04:08:38] [INFO ] Deduced a trap composed of 372 places in 456 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:39] [INFO ] Deduced a trap composed of 57 places in 189 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:40] [INFO ] Deduced a trap composed of 407 places in 536 ms of which 222 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:41] [INFO ] Deduced a trap composed of 23 places in 354 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:41] [INFO ] Deduced a trap composed of 377 places in 495 ms of which 179 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/2444 variables, and 60 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1640/1640 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1640 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:57] [INFO ] Deduced a trap composed of 152 places in 414 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:58] [INFO ] Deduced a trap composed of 207 places in 424 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:08:59] [INFO ] Deduced a trap composed of 452 places in 473 ms of which 168 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/2444 variables, and 63 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 29/30 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1640 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61173ms problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 61178ms
Starting structural reductions in LTL mode, iteration 1 : 822/832 places, 1642/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93764 ms. Remains : 822/832 places, 1642/1652 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 472 ms.
Product exploration explored 100000 steps with 50000 reset in 504 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-08 finished in 94842 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((G(F((p0||G(F(p0))||(p1&&F(p0)))))||(p2&&F(((p1&&F(p0))||X((p0||G(F(p0))))))))))))'
Support contains 22 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 822 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 812 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 812 transition count 1632
Applied a total of 40 rules in 39 ms. Remains 812 /832 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2025-06-03 04:09:14] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2025-06-03 04:09:14] [INFO ] Computed 46 invariants in 19 ms
[2025-06-03 04:09:14] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 10.0)
(s243 1.0)
(s244 0.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
SMT process timed out in 21154ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 21157ms
[2025-06-03 04:09:35] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:09:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:09:36] [INFO ] Implicit Places using invariants in 876 ms returned []
[2025-06-03 04:09:36] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:09:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:09:37] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 04:09:50] [INFO ] Implicit Places using invariants and state equation in 13991 ms returned []
Implicit Place search using SMT with State Equation took 14873 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2025-06-03 04:09:50] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:09:50] [INFO ] Invariant cache hit.
[2025-06-03 04:09:50] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:14] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:15] [INFO ] Deduced a trap composed of 72 places in 372 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:15] [INFO ] Deduced a trap composed of 197 places in 425 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:17] [INFO ] Deduced a trap composed of 72 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-03 04:10:17] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:17] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:17] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 51 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:26] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:26] [INFO ] Deduced a trap composed of 72 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-03 04:10:26] [INFO ] Deduced a trap composed of 72 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-03 04:10:28] [INFO ] Deduced a trap composed of 72 places in 418 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:29] [INFO ] Deduced a trap composed of 442 places in 459 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:10:41] [INFO ] Deduced a trap composed of 57 places in 317 ms of which 57 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61181ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 61184ms
Starting structural reductions in LTL mode, iteration 1 : 812/832 places, 1632/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97265 ms. Remains : 812/832 places, 1632/1652 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-10
Product exploration explored 100000 steps with 2653 reset in 354 ms.
Product exploration explored 100000 steps with 2656 reset in 313 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 (NOT p2) (NOT p0) (NOT p1)), (X (X (OR (NOT p0) (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 75 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 2899 steps (1 resets) in 34 ms. (82 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (X (OR (NOT p0) (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F p0), (F (NOT (OR (AND (NOT p1) p2) (NOT p0))))]
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-03 04:10:53] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:10:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 04:10:54] [INFO ] [Real]Absence check using 14 positive place invariants in 582 ms returned sat
[2025-06-03 04:10:56] [INFO ] [Real]Absence check using 14 positive and 32 generalized place invariants in 1486 ms returned sat
[2025-06-03 04:11:03] [INFO ] [Real]Absence check using state equation in 6866 ms returned sat
[2025-06-03 04:11:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 04:11:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 61 ms returned sat
[2025-06-03 04:11:05] [INFO ] [Nat]Absence check using 14 positive and 32 generalized place invariants in 1446 ms returned sat
[2025-06-03 04:11:18] [INFO ] [Nat]Absence check using state equation in 12678 ms returned unknown
Could not prove EG (NOT p0)
Support contains 22 out of 812 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Applied a total of 0 rules in 14 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2025-06-03 04:11:18] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:11:18] [INFO ] Invariant cache hit.
[2025-06-03 04:11:18] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
SMT process timed out in 21175ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 21177ms
[2025-06-03 04:11:39] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:11:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:11:40] [INFO ] Implicit Places using invariants in 848 ms returned []
[2025-06-03 04:11:40] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:11:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:11:40] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 04:11:54] [INFO ] Implicit Places using invariants and state equation in 13979 ms returned []
Implicit Place search using SMT with State Equation took 14829 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2025-06-03 04:11:54] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:11:54] [INFO ] Invariant cache hit.
[2025-06-03 04:11:54] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:12:17] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:12:18] [INFO ] Deduced a trap composed of 72 places in 373 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:12:19] [INFO ] Deduced a trap composed of 197 places in 450 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:12:20] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:12:20] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:12:20] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:12:21] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 8 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 8.0)
(s1 2.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 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 9.0)
(s243 0.0)
(s244 1.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 4.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 1.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 51 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:12:30] [INFO ] Deduced a trap composed of 72 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-03 04:12:30] [INFO ] Deduced a trap composed of 72 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-03 04:12:30] [INFO ] Deduced a trap composed of 72 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-03 04:12:32] [INFO ] Deduced a trap composed of 72 places in 370 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:12:32] [INFO ] Deduced a trap composed of 442 places in 444 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:12:45] [INFO ] Deduced a trap composed of 57 places in 293 ms of which 56 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61190ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 61197ms
Finished structural reductions in LTL mode , in 1 iterations and 97230 ms. Remains : 812/812 places, 1632/1632 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT p2))), (X (X (OR (AND (NOT p1) p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 2052 steps (0 resets) in 15 ms. (128 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT p2))), (X (X (OR (AND (NOT p1) p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F p0), (F (NOT (OR (AND (NOT p1) p2) (NOT p0))))]
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-03 04:12:56] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:12:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 04:12:57] [INFO ] [Real]Absence check using 14 positive place invariants in 585 ms returned sat
[2025-06-03 04:12:59] [INFO ] [Real]Absence check using 14 positive and 32 generalized place invariants in 1492 ms returned sat
[2025-06-03 04:13:06] [INFO ] [Real]Absence check using state equation in 6931 ms returned sat
[2025-06-03 04:13:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 04:13:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 61 ms returned sat
[2025-06-03 04:13:08] [INFO ] [Nat]Absence check using 14 positive and 32 generalized place invariants in 1447 ms returned sat
[2025-06-03 04:13:21] [INFO ] [Nat]Absence check using state equation in 12688 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2644 reset in 305 ms.
Product exploration explored 100000 steps with 2634 reset in 331 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 22 out of 812 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 812 transition count 1632
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 110 Pre rules applied. Total rules applied 40 place count 812 transition count 1742
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 150 place count 812 transition count 1742
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 170 place count 792 transition count 1722
Deduced a syphon composed of 130 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 190 place count 792 transition count 1722
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 210 places in 1 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 270 place count 792 transition count 1722
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 290 place count 772 transition count 1702
Deduced a syphon composed of 190 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 310 place count 772 transition count 1702
Deduced a syphon composed of 190 places in 1 ms
Applied a total of 310 rules in 92 ms. Remains 772 /812 variables (removed 40) and now considering 1702/1632 (removed -70) transitions.
Running 1700 sub problems to find dead transitions.
[2025-06-03 04:13:22] [INFO ] Flow matrix only has 1682 transitions (discarded 20 similar events)
// Phase 1: matrix 1682 rows 772 cols
[2025-06-03 04:13:22] [INFO ] Computed 46 invariants in 21 ms
[2025-06-03 04:13:22] [INFO ] State equation strengthened by 160 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/770 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1700 unsolved
SMT process timed out in 21381ms, After SMT, problems are : Problem set: 0 solved, 1700 unsolved
Search for dead transitions found 0 dead transitions in 21385ms
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:13:43] [INFO ] Redundant transitions in 27 ms returned []
Running 1700 sub problems to find dead transitions.
[2025-06-03 04:13:43] [INFO ] Flow matrix only has 1682 transitions (discarded 20 similar events)
[2025-06-03 04:13:43] [INFO ] Invariant cache hit.
[2025-06-03 04:13:43] [INFO ] State equation strengthened by 160 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/770 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/770 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1700 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:07] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:07] [INFO ] Deduced a trap composed of 49 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-03 04:14:07] [INFO ] Deduced a trap composed of 49 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-03 04:14:07] [INFO ] Deduced a trap composed of 49 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-03 04:14:07] [INFO ] Deduced a trap composed of 49 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-03 04:14:07] [INFO ] Deduced a trap composed of 49 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-03 04:14:07] [INFO ] Deduced a trap composed of 49 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-03 04:14:07] [INFO ] Deduced a trap composed of 49 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-03 04:14:08] [INFO ] Deduced a trap composed of 49 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-03 04:14:08] [INFO ] Deduced a trap composed of 49 places in 368 ms of which 61 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:08] [INFO ] Deduced a trap composed of 207 places in 423 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:09] [INFO ] Deduced a trap composed of 216 places in 448 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:11] [INFO ] Deduced a trap composed of 197 places in 414 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:11] [INFO ] Deduced a trap composed of 23 places in 346 ms of which 37 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 4.0)
(s1 6.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 10.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 (/ 1.0 3.0))
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 (/ 1.0 3.0))
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 (/ 2.0 3.0))
(s388 0.0)
(s389 1.0)
(s390 (/ 2.0 3.0))
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 1.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 1.0)
(s505 1.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 10.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 1.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 3.0)
(s669 0.0)
(s670 0.0)
(s671 1.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 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 770/2454 variables, and 58 constraints, problems are : Problem set: 20 solved, 1680 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1700/1700 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 1680 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/770 variables, 16/16 constraints. Problems are: Problem set: 20 solved, 1680 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/770 variables, 28/44 constraints. Problems are: Problem set: 20 solved, 1680 unsolved
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1618 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/770 variables, 14/58 constraints. Problems are: Problem set: 280 solved, 1420 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:14:41] [INFO ] Deduced a trap composed of 197 places in 418 ms of which 107 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 770/2454 variables, and 59 constraints, problems are : Problem set: 280 solved, 1420 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1700 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61367ms problems are : Problem set: 280 solved, 1420 unsolved
Search for dead transitions found 280 dead transitions in 61370ms
Found 280 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 280 transitions
Dead transitions reduction (with SMT) removed 280 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 772/812 places, 1422/1632 transitions.
Graph (complete) has 3824 edges and 772 vertex of which 602 are kept as prefixes of interest. Removing 170 places using SCC suffix rule.2 ms
Discarding 170 places :
Also discarding 0 output transitions
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 1 rules in 22 ms. Remains 602 /772 variables (removed 170) and now considering 1422/1422 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 602/812 places, 1422/1632 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 82913 ms. Remains : 602/812 places, 1422/1632 transitions.
Built C files in :
/tmp/ltsmin2084807171079699785
[2025-06-03 04:14:45] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2084807171079699785
Running compilation step : cd /tmp/ltsmin2084807171079699785;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2084807171079699785;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2084807171079699785;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 22 out of 812 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Applied a total of 0 rules in 10 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2025-06-03 04:14:48] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2025-06-03 04:14:48] [INFO ] Computed 46 invariants in 25 ms
[2025-06-03 04:14:48] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
SMT process timed out in 21152ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 21155ms
[2025-06-03 04:15:09] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:15:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:15:10] [INFO ] Implicit Places using invariants in 864 ms returned []
[2025-06-03 04:15:10] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:15:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:15:10] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 04:15:24] [INFO ] Implicit Places using invariants and state equation in 14111 ms returned []
Implicit Place search using SMT with State Equation took 14978 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2025-06-03 04:15:24] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:15:24] [INFO ] Invariant cache hit.
[2025-06-03 04:15:24] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:47] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:49] [INFO ] Deduced a trap composed of 72 places in 404 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:49] [INFO ] Deduced a trap composed of 197 places in 467 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:50] [INFO ] Deduced a trap composed of 72 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-03 04:15:50] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:15:50] [INFO ] Deduced a trap composed of 72 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-03 04:15:51] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 9 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 810/2424 variables, and 51 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:00] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:00] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:00] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:02] [INFO ] Deduced a trap composed of 72 places in 392 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:03] [INFO ] Deduced a trap composed of 442 places in 454 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:16:15] [INFO ] Deduced a trap composed of 57 places in 288 ms of which 55 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61127ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 61130ms
Finished structural reductions in LTL mode , in 1 iterations and 97280 ms. Remains : 812/812 places, 1632/1632 transitions.
Built C files in :
/tmp/ltsmin15157511903645263971
[2025-06-03 04:16:25] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15157511903645263971
Running compilation step : cd /tmp/ltsmin15157511903645263971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15157511903645263971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15157511903645263971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 04:16:28] [INFO ] Flatten gal took : 50 ms
[2025-06-03 04:16:28] [INFO ] Flatten gal took : 52 ms
[2025-06-03 04:16:28] [INFO ] Time to serialize gal into /tmp/LTL2640793165215287999.gal : 8 ms
[2025-06-03 04:16:28] [INFO ] Time to serialize properties into /tmp/LTL13848658706078183825.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/LTL2640793165215287999.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17566456009803257352.hoa' '-atoms' '/tmp/LTL13848658706078183825.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/LTL13848658706078183825.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17566456009803257352.hoa
Detected timeout of ITS tools.
[2025-06-03 04:16:43] [INFO ] Flatten gal took : 47 ms
[2025-06-03 04:16:43] [INFO ] Flatten gal took : 47 ms
[2025-06-03 04:16:43] [INFO ] Time to serialize gal into /tmp/LTL4834629104028113001.gal : 7 ms
[2025-06-03 04:16:43] [INFO ] Time to serialize properties into /tmp/LTL9695134450494863341.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/LTL4834629104028113001.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9695134450494863341.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 : !((X(X(F((G(F((("(NoSigAbort<1)")||(G(F("(NoSigAbort<1)"))))||(("(((((NotifyEventJobCompletedB_0+NotifyEventJobCompletedB_1)+(NotifyEv...966
Formula 0 simplified : XXG(FG!"(NoSigAbort<1)" & (!"(cPollingAbort<1)" | G((!"(((((NotifyEventJobCompletedB_0+NotifyEventJobCompletedB_1)+(NotifyEventJobCo...516
Detected timeout of ITS tools.
[2025-06-03 04:16:58] [INFO ] Flatten gal took : 60 ms
[2025-06-03 04:16:58] [INFO ] Applying decomposition
[2025-06-03 04:16:59] [INFO ] Flatten gal took : 56 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/graph6941722826651372030.txt' '-o' '/tmp/graph6941722826651372030.bin' '-w' '/tmp/graph6941722826651372030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6941722826651372030.bin' '-l' '-1' '-v' '-w' '/tmp/graph6941722826651372030.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:16:59] [INFO ] Decomposing Gal with order
[2025-06-03 04:16:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:16:59] [INFO ] Removed a total of 1372 redundant transitions.
[2025-06-03 04:16:59] [INFO ] Flatten gal took : 112 ms
[2025-06-03 04:16:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 281 labels/synchronizations in 17 ms.
[2025-06-03 04:16:59] [INFO ] Time to serialize gal into /tmp/LTL11935053174068604152.gal : 10 ms
[2025-06-03 04:16:59] [INFO ] Time to serialize properties into /tmp/LTL3014172453223078678.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/LTL11935053174068604152.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3014172453223078678.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F((("(gi0.gi0.gi2.gi2.gu20.NoSigAbort<1)")||(G(F("(gi0.gi0.gi2.gi2.gu20.NoSigAbort<1)"))))||(("(((((gu118.NotifyEventJobCo...1353
Formula 0 simplified : XXG(FG!"(gi0.gi0.gi2.gi2.gu20.NoSigAbort<1)" & (!"(gi0.gi0.gi2.gi2.gu21.cPollingAbort<1)" | G((!"(((((gu118.NotifyEventJobCompletedB...741
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-10 finished in 480163 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((G(p0)||(X(p0)&&p1))))))'
Support contains 27 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 822 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 812 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 812 transition count 1632
Applied a total of 40 rules in 39 ms. Remains 812 /832 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2025-06-03 04:17:14] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:17:14] [INFO ] Invariant cache hit.
[2025-06-03 04:17:14] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
SMT process timed out in 21189ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 21192ms
[2025-06-03 04:17:35] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:17:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:17:36] [INFO ] Implicit Places using invariants in 720 ms returned []
[2025-06-03 04:17:36] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:17:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:17:37] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 04:17:54] [INFO ] Implicit Places using invariants and state equation in 18259 ms returned []
Implicit Place search using SMT with State Equation took 18997 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2025-06-03 04:17:54] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:17:54] [INFO ] Invariant cache hit.
[2025-06-03 04:17:54] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:18] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:19] [INFO ] Deduced a trap composed of 72 places in 365 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:20] [INFO ] Deduced a trap composed of 197 places in 435 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:21] [INFO ] Deduced a trap composed of 72 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-03 04:18:21] [INFO ] Deduced a trap composed of 72 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-03 04:18:21] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:21] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 8 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 810/2424 variables, and 51 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:31] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:31] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:31] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:33] [INFO ] Deduced a trap composed of 72 places in 396 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:33] [INFO ] Deduced a trap composed of 442 places in 452 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:18:46] [INFO ] Deduced a trap composed of 57 places in 281 ms of which 56 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 5)
(s1 5)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 9)
(s243 0)
(s244 1)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 1)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 1)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 1)
(s494 1)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 1)
(s530 0)
(s531 0)
(s532 1)
(s533 0)
(s534 1)
(s535 0)
(s536 1)
(s537 0)
(s538 1)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 9)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 1)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 1)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 1)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61195ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 61202ms
Starting structural reductions in LTL mode, iteration 1 : 812/832 places, 1632/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101436 ms. Remains : 812/832 places, 1632/1652 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-11
Product exploration explored 100000 steps with 1930 reset in 446 ms.
Product exploration explored 100000 steps with 1952 reset in 460 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 (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 249 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Reduction of identical properties reduced properties to check from 6 to 4
RANDOM walk for 40000 steps (11 resets) in 359 ms. (111 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (10 resets) in 266 ms. (149 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 299 ms. (133 steps per ms) remains 2/2 properties
[2025-06-03 04:18:57] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:18:57] [INFO ] Invariant cache hit.
[2025-06-03 04:18:57] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf0 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 294/2424 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 2/14 constraints, Generalized P Invariants (flows): 0/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (G (OR p0 p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 382 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[p1, p1, p1, p1]
Stuttering acceptance computed with spot in 157 ms :[p1, p1, p1, p1]
Support contains 27 out of 812 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Applied a total of 0 rules in 19 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2025-06-03 04:18:58] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:18:58] [INFO ] Invariant cache hit.
[2025-06-03 04:18:58] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
SMT process timed out in 21291ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 21293ms
[2025-06-03 04:19:20] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:19:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:19:20] [INFO ] Implicit Places using invariants in 715 ms returned []
[2025-06-03 04:19:20] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:19:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:19:21] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 04:19:38] [INFO ] Implicit Places using invariants and state equation in 18107 ms returned []
Implicit Place search using SMT with State Equation took 18826 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2025-06-03 04:19:38] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:19:38] [INFO ] Invariant cache hit.
[2025-06-03 04:19:38] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:20:02] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:20:03] [INFO ] Deduced a trap composed of 72 places in 391 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:20:04] [INFO ] Deduced a trap composed of 197 places in 435 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:20:05] [INFO ] Deduced a trap composed of 72 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-03 04:20:05] [INFO ] Deduced a trap composed of 72 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-03 04:20:05] [INFO ] Deduced a trap composed of 72 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-03 04:20:05] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 51 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:20:15] [INFO ] Deduced a trap composed of 72 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-03 04:20:15] [INFO ] Deduced a trap composed of 72 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-03 04:20:15] [INFO ] Deduced a trap composed of 72 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-03 04:20:17] [INFO ] Deduced a trap composed of 72 places in 376 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:20:17] [INFO ] Deduced a trap composed of 442 places in 448 ms of which 162 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:20:30] [INFO ] Deduced a trap composed of 57 places in 313 ms of which 56 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61230ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 61237ms
Finished structural reductions in LTL mode , in 1 iterations and 101386 ms. Remains : 812/812 places, 1632/1632 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 : [(NOT p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[p1, p1, p1, p1]
RANDOM walk for 11 steps (0 resets) in 6 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[p1, p1, p1, p1]
Stuttering acceptance computed with spot in 129 ms :[p1, p1, p1, p1]
Stuttering acceptance computed with spot in 144 ms :[p1, p1, p1, p1]
Product exploration explored 100000 steps with 1952 reset in 356 ms.
Product exploration explored 100000 steps with 1910 reset in 355 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 145 ms :[p1, p1, p1, p1]
Support contains 27 out of 812 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 812 transition count 1632
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 110 Pre rules applied. Total rules applied 50 place count 812 transition count 1742
Deduced a syphon composed of 160 places in 1 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 160 place count 812 transition count 1742
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 180 place count 792 transition count 1722
Deduced a syphon composed of 140 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 200 place count 792 transition count 1722
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 1 with 70 rules applied. Total rules applied 270 place count 792 transition count 1722
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 310 place count 752 transition count 1682
Deduced a syphon composed of 180 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 350 place count 752 transition count 1682
Deduced a syphon composed of 180 places in 0 ms
Applied a total of 350 rules in 79 ms. Remains 752 /812 variables (removed 60) and now considering 1682/1632 (removed -50) transitions.
Running 1680 sub problems to find dead transitions.
[2025-06-03 04:20:42] [INFO ] Flow matrix only has 1662 transitions (discarded 20 similar events)
// Phase 1: matrix 1662 rows 752 cols
[2025-06-03 04:20:42] [INFO ] Computed 46 invariants in 26 ms
[2025-06-03 04:20:42] [INFO ] State equation strengthened by 160 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1680 unsolved
SMT process timed out in 21508ms, After SMT, problems are : Problem set: 0 solved, 1680 unsolved
Search for dead transitions found 0 dead transitions in 21511ms
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:21:03] [INFO ] Redundant transitions in 24 ms returned []
Running 1680 sub problems to find dead transitions.
[2025-06-03 04:21:03] [INFO ] Flow matrix only has 1662 transitions (discarded 20 similar events)
[2025-06-03 04:21:03] [INFO ] Invariant cache hit.
[2025-06-03 04:21:03] [INFO ] State equation strengthened by 160 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1680 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/750 variables, 28/44 constraints. Problems are: Problem set: 0 solved, 1680 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:26] [INFO ] Deduced a trap composed of 48 places in 144 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:26] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:26] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:26] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:27] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:27] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:27] [INFO ] Deduced a trap composed of 48 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-03 04:21:27] [INFO ] Deduced a trap composed of 48 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-03 04:21:27] [INFO ] Deduced a trap composed of 48 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-03 04:21:27] [INFO ] Deduced a trap composed of 48 places in 364 ms of which 60 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:28] [INFO ] Deduced a trap composed of 207 places in 425 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:28] [INFO ] Deduced a trap composed of 216 places in 434 ms of which 137 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 750/2414 variables, and 56 constraints, problems are : Problem set: 20 solved, 1660 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/752 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1680/1680 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 1660 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/750 variables, 16/16 constraints. Problems are: Problem set: 20 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/750 variables, 28/44 constraints. Problems are: Problem set: 20 solved, 1660 unsolved
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1671 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/750 variables, 12/56 constraints. Problems are: Problem set: 270 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:46] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:57] [INFO ] Deduced a trap composed of 372 places in 460 ms of which 177 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:21:59] [INFO ] Deduced a trap composed of 187 places in 417 ms of which 102 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 750/2414 variables, and 59 constraints, problems are : Problem set: 270 solved, 1410 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/752 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1680 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61323ms problems are : Problem set: 270 solved, 1410 unsolved
Search for dead transitions found 270 dead transitions in 61326ms
Found 270 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 270 transitions
Dead transitions reduction (with SMT) removed 270 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 752/812 places, 1412/1632 transitions.
Graph (complete) has 3803 edges and 752 vertex of which 592 are kept as prefixes of interest. Removing 160 places using SCC suffix rule.2 ms
Discarding 160 places :
Also discarding 0 output transitions
Deduced a syphon composed of 20 places in 1 ms
Applied a total of 1 rules in 20 ms. Remains 592 /752 variables (removed 160) and now considering 1412/1412 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 592/812 places, 1412/1632 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 82972 ms. Remains : 592/812 places, 1412/1632 transitions.
Built C files in :
/tmp/ltsmin8226371196183824833
[2025-06-03 04:22:04] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8226371196183824833
Running compilation step : cd /tmp/ltsmin8226371196183824833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8226371196183824833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8226371196183824833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 27 out of 812 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 812/812 places, 1632/1632 transitions.
Applied a total of 0 rules in 12 ms. Remains 812 /812 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Running 1630 sub problems to find dead transitions.
[2025-06-03 04:22:07] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 812 cols
[2025-06-03 04:22:08] [INFO ] Computed 46 invariants in 26 ms
[2025-06-03 04:22:08] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 10.0)
(s243 1.0)
(s244 0.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 1.0)
(s434 1.0)
(s437 0.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 1.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 0.0)
(s538 1.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 1.0)
(s543 10.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 1.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
SMT process timed out in 21142ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 21145ms
[2025-06-03 04:22:29] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:22:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:22:29] [INFO ] Implicit Places using invariants in 733 ms returned []
[2025-06-03 04:22:29] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:22:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:22:30] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 04:22:48] [INFO ] Implicit Places using invariants and state equation in 18221 ms returned []
Implicit Place search using SMT with State Equation took 18958 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2025-06-03 04:22:48] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:22:48] [INFO ] Invariant cache hit.
[2025-06-03 04:22:48] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:12] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:13] [INFO ] Deduced a trap composed of 72 places in 369 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:13] [INFO ] Deduced a trap composed of 197 places in 436 ms of which 150 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:14] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:14] [INFO ] Deduced a trap composed of 72 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-03 04:23:14] [INFO ] Deduced a trap composed of 72 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-03 04:23:15] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 51 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:24] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:24] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:24] [INFO ] Deduced a trap composed of 72 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-03 04:23:26] [INFO ] Deduced a trap composed of 72 places in 377 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:26] [INFO ] Deduced a trap composed of 442 places in 443 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:23:39] [INFO ] Deduced a trap composed of 57 places in 273 ms of which 55 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61136ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 61139ms
Finished structural reductions in LTL mode , in 1 iterations and 101260 ms. Remains : 812/812 places, 1632/1632 transitions.
Built C files in :
/tmp/ltsmin26647410642122152
[2025-06-03 04:23:49] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin26647410642122152
Running compilation step : cd /tmp/ltsmin26647410642122152;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin26647410642122152;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin26647410642122152;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 04:23:52] [INFO ] Flatten gal took : 44 ms
[2025-06-03 04:23:52] [INFO ] Flatten gal took : 44 ms
[2025-06-03 04:23:52] [INFO ] Time to serialize gal into /tmp/LTL16317469022398613733.gal : 11 ms
[2025-06-03 04:23:52] [INFO ] Time to serialize properties into /tmp/LTL13220596348881115765.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/LTL16317469022398613733.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9456927073893826295.hoa' '-atoms' '/tmp/LTL13220596348881115765.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/LTL13220596348881115765.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9456927073893826295.hoa
Detected timeout of ITS tools.
[2025-06-03 04:24:07] [INFO ] Flatten gal took : 44 ms
[2025-06-03 04:24:07] [INFO ] Flatten gal took : 45 ms
[2025-06-03 04:24:07] [INFO ] Time to serialize gal into /tmp/LTL3257354069706170506.gal : 7 ms
[2025-06-03 04:24:07] [INFO ] Time to serialize properties into /tmp/LTL13854121784794927867.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/LTL3257354069706170506.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13854121784794927867.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(((((Check_Sources_B_0+Check_Sources_B_1)+(Check_Sources_B_2+Check_Sources_B_3))+((Check_Sources_B_4+Check_Sources_B_5)+(...967
Formula 0 simplified : XXG(F!"(((((Check_Sources_B_0+Check_Sources_B_1)+(Check_Sources_B_2+Check_Sources_B_3))+((Check_Sources_B_4+Check_Sources_B_5)+(Chec...955
Detected timeout of ITS tools.
[2025-06-03 04:24:22] [INFO ] Flatten gal took : 46 ms
[2025-06-03 04:24:22] [INFO ] Applying decomposition
[2025-06-03 04:24:22] [INFO ] Flatten gal took : 56 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/graph14664873273137702757.txt' '-o' '/tmp/graph14664873273137702757.bin' '-w' '/tmp/graph14664873273137702757.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14664873273137702757.bin' '-l' '-1' '-v' '-w' '/tmp/graph14664873273137702757.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:24:22] [INFO ] Decomposing Gal with order
[2025-06-03 04:24:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:24:22] [INFO ] Removed a total of 1764 redundant transitions.
[2025-06-03 04:24:22] [INFO ] Flatten gal took : 102 ms
[2025-06-03 04:24:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 537 labels/synchronizations in 29 ms.
[2025-06-03 04:24:23] [INFO ] Time to serialize gal into /tmp/LTL12791933067662629947.gal : 9 ms
[2025-06-03 04:24:23] [INFO ] Time to serialize properties into /tmp/LTL8254646604015421890.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/LTL12791933067662629947.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8254646604015421890.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(((((gu149.Check_Sources_B_0+gu149.Check_Sources_B_1)+(gu149.Check_Sources_B_2+gu149.Check_Sources_B_3))+((gu149.Check_So...1333
Formula 0 simplified : XXG(F!"(((((gu149.Check_Sources_B_0+gu149.Check_Sources_B_1)+(gu149.Check_Sources_B_2+gu149.Check_Sources_B_3))+((gu149.Check_Source...1321
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-11 finished in 443572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(G(p0))||(X(p0)&&((p1&&F(p2))||G((G(p1)||(p1&&F(p2)))))))))'
Support contains 92 out of 832 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 822 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 822 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 812 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 812 transition count 1632
Applied a total of 40 rules in 36 ms. Remains 812 /832 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2025-06-03 04:24:38] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:24:38] [INFO ] Invariant cache hit.
[2025-06-03 04:24:38] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
SMT process timed out in 21075ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 21077ms
[2025-06-03 04:24:59] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:24:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:25:00] [INFO ] Implicit Places using invariants in 723 ms returned []
[2025-06-03 04:25:00] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:25:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:25:00] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 04:25:18] [INFO ] Implicit Places using invariants and state equation in 18011 ms returned []
Implicit Place search using SMT with State Equation took 18737 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2025-06-03 04:25:18] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2025-06-03 04:25:18] [INFO ] Invariant cache hit.
[2025-06-03 04:25:18] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:25:42] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:25:43] [INFO ] Deduced a trap composed of 72 places in 377 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:25:43] [INFO ] Deduced a trap composed of 197 places in 440 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:25:44] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:25:44] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:25:45] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:25:45] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2424 variables, and 51 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/810 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/810 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/810 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:25:54] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:25:54] [INFO ] Deduced a trap composed of 72 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-03 04:25:54] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:25:56] [INFO ] Deduced a trap composed of 72 places in 407 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:25:57] [INFO ] Deduced a trap composed of 442 places in 482 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:26:10] [INFO ] Deduced a trap composed of 57 places in 288 ms of which 56 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 810/2424 variables, and 57 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/812 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61115ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 61120ms
Starting structural reductions in LTL mode, iteration 1 : 812/832 places, 1632/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100981 ms. Remains : 812/832 places, 1632/1652 transitions.
Stuttering acceptance computed with spot in 354 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-15 finished in 101373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(F(p0))||(F(p0)&&X(p1)))) U X(G(p2))))'
Found a Lengthening insensitive property : PolyORBLF-COL-S02J06T10-LTLCardinality-00
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) p2 (NOT p1))]
Support contains 31 out of 832 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 832 transition count 1592
Reduce places removed 60 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 70 rules applied. Total rules applied 130 place count 772 transition count 1582
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 140 place count 762 transition count 1582
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 140 place count 762 transition count 1482
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 340 place count 662 transition count 1482
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 350 place count 652 transition count 1472
Iterating global reduction 3 with 10 rules applied. Total rules applied 360 place count 652 transition count 1472
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 480 place count 592 transition count 1412
Applied a total of 480 rules in 58 ms. Remains 592 /832 variables (removed 240) and now considering 1412/1652 (removed 240) transitions.
Running 1410 sub problems to find dead transitions.
[2025-06-03 04:26:19] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 592 cols
[2025-06-03 04:26:20] [INFO ] Computed 46 invariants in 20 ms
[2025-06-03 04:26:20] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:26:37] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:26:37] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:26:37] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:26:37] [INFO ] Deduced a trap composed of 50 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-03 04:26:37] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:26:37] [INFO ] Deduced a trap composed of 50 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-03 04:26:37] [INFO ] Deduced a trap composed of 50 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-03 04:26:37] [INFO ] Deduced a trap composed of 50 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-03 04:26:37] [INFO ] Deduced a trap composed of 50 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-03 04:26:38] [INFO ] Deduced a trap composed of 217 places in 369 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:26:38] [INFO ] Deduced a trap composed of 226 places in 358 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:26:39] [INFO ] Deduced a trap composed of 207 places in 331 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:26:39] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:26:40] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41051ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 41053ms
[2025-06-03 04:27:01] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 04:27:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:27:02] [INFO ] Implicit Places using invariants in 1100 ms returned []
[2025-06-03 04:27:02] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 04:27:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:27:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 04:27:12] [INFO ] Implicit Places using invariants and state equation in 10344 ms returned []
Implicit Place search using SMT with State Equation took 11446 ms to find 0 implicit places.
Running 1410 sub problems to find dead transitions.
[2025-06-03 04:27:12] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 04:27:12] [INFO ] Invariant cache hit.
[2025-06-03 04:27:12] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:27:29] [INFO ] Deduced a trap composed of 50 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-03 04:27:29] [INFO ] Deduced a trap composed of 50 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-03 04:27:29] [INFO ] Deduced a trap composed of 50 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-03 04:27:29] [INFO ] Deduced a trap composed of 50 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-03 04:27:30] [INFO ] Deduced a trap composed of 50 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-03 04:27:30] [INFO ] Deduced a trap composed of 50 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-03 04:27:30] [INFO ] Deduced a trap composed of 50 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-03 04:27:30] [INFO ] Deduced a trap composed of 50 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-03 04:27:30] [INFO ] Deduced a trap composed of 50 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-03 04:27:30] [INFO ] Deduced a trap composed of 217 places in 332 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:27:31] [INFO ] Deduced a trap composed of 226 places in 317 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:27:38] [INFO ] Deduced a trap composed of 50 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-03 04:27:40] [INFO ] Deduced a trap composed of 207 places in 336 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:27:40] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 33 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61088ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 61093ms
Starting structural reductions in LI_LTL mode, iteration 1 : 592/832 places, 1412/1652 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 113660 ms. Remains : 592/832 places, 1412/1652 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-00
Product exploration explored 100000 steps with 12637 reset in 339 ms.
Product exploration explored 100000 steps with 12926 reset in 359 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 (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 115 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) p2 (NOT p1))]
RANDOM walk for 40000 steps (17 resets) in 211 ms. (188 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
[2025-06-03 04:28:14] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 04:28:14] [INFO ] Invariant cache hit.
[2025-06-03 04:28:14] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 238/269 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Real declared 577/1984 variables, and 31 constraints, problems are : Problem set: 2 solved, 0 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 3/14 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X p1)), (G (OR p0 (NOT p2) p1)), (G (OR (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p2) p1))), (F p2), (F (NOT (OR p2 p1))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 323 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0)]
[2025-06-03 04:28:15] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 04:28:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 04:28:16] [INFO ] [Real]Absence check using 14 positive place invariants in 800 ms returned sat
[2025-06-03 04:28:19] [INFO ] [Real]Absence check using 14 positive and 32 generalized place invariants in 2710 ms returned sat
[2025-06-03 04:28:30] [INFO ] [Real]Absence check using state equation in 10878 ms returned unknown
Could not prove EG (NOT p2)
Support contains 31 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 1412/1412 transitions.
Applied a total of 0 rules in 10 ms. Remains 592 /592 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2025-06-03 04:28:30] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 04:28:30] [INFO ] Invariant cache hit.
[2025-06-03 04:28:30] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:28:48] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:28:48] [INFO ] Deduced a trap composed of 50 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-03 04:28:48] [INFO ] Deduced a trap composed of 50 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-03 04:28:48] [INFO ] Deduced a trap composed of 50 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-03 04:28:48] [INFO ] Deduced a trap composed of 50 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-03 04:28:48] [INFO ] Deduced a trap composed of 50 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-03 04:28:48] [INFO ] Deduced a trap composed of 50 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-03 04:28:48] [INFO ] Deduced a trap composed of 50 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-03 04:28:48] [INFO ] Deduced a trap composed of 50 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-03 04:28:49] [INFO ] Deduced a trap composed of 217 places in 346 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:28:49] [INFO ] Deduced a trap composed of 226 places in 327 ms of which 75 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 55 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 55 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41234ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 41237ms
[2025-06-03 04:29:11] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 04:29:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:29:12] [INFO ] Implicit Places using invariants in 1038 ms returned []
[2025-06-03 04:29:12] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 04:29:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:29:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 04:29:22] [INFO ] Implicit Places using invariants and state equation in 10137 ms returned []
Implicit Place search using SMT with State Equation took 11179 ms to find 0 implicit places.
Running 1410 sub problems to find dead transitions.
[2025-06-03 04:29:23] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 04:29:23] [INFO ] Invariant cache hit.
[2025-06-03 04:29:23] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:29:40] [INFO ] Deduced a trap composed of 50 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-03 04:29:40] [INFO ] Deduced a trap composed of 50 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-03 04:29:40] [INFO ] Deduced a trap composed of 50 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-03 04:29:40] [INFO ] Deduced a trap composed of 50 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-03 04:29:40] [INFO ] Deduced a trap composed of 50 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-03 04:29:40] [INFO ] Deduced a trap composed of 50 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-03 04:29:40] [INFO ] Deduced a trap composed of 50 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-03 04:29:40] [INFO ] Deduced a trap composed of 50 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-03 04:29:40] [INFO ] Deduced a trap composed of 50 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-03 04:29:41] [INFO ] Deduced a trap composed of 217 places in 342 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:29:41] [INFO ] Deduced a trap composed of 226 places in 312 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:29:49] [INFO ] Deduced a trap composed of 50 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-03 04:29:51] [INFO ] Deduced a trap composed of 207 places in 342 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:29:51] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 33 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61113ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 61120ms
Finished structural reductions in LTL mode , in 1 iterations and 113553 ms. Remains : 592/592 places, 1412/1412 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 127 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0)]
RANDOM walk for 724 steps (1 resets) in 9 ms. (72 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 11 factoid took 284 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0)]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0)]
[2025-06-03 04:30:25] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 04:30:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 04:30:26] [INFO ] [Real]Absence check using 14 positive place invariants in 807 ms returned sat
[2025-06-03 04:30:29] [INFO ] [Real]Absence check using 14 positive and 32 generalized place invariants in 2721 ms returned sat
[2025-06-03 04:30:40] [INFO ] [Real]Absence check using state equation in 10833 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0)]
Product exploration explored 100000 steps with 12801 reset in 339 ms.
Product exploration explored 100000 steps with 12773 reset in 349 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p0)]
Support contains 31 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 1412/1412 transitions.
Applied a total of 0 rules in 22 ms. Remains 592 /592 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2025-06-03 04:30:41] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 04:30:41] [INFO ] Invariant cache hit.
[2025-06-03 04:30:41] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:30:59] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:30:59] [INFO ] Deduced a trap composed of 50 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-03 04:30:59] [INFO ] Deduced a trap composed of 50 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-03 04:30:59] [INFO ] Deduced a trap composed of 50 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-03 04:30:59] [INFO ] Deduced a trap composed of 50 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-03 04:30:59] [INFO ] Deduced a trap composed of 50 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-03 04:30:59] [INFO ] Deduced a trap composed of 50 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-03 04:30:59] [INFO ] Deduced a trap composed of 50 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-03 04:30:59] [INFO ] Deduced a trap composed of 50 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-03 04:31:00] [INFO ] Deduced a trap composed of 217 places in 367 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:31:00] [INFO ] Deduced a trap composed of 226 places in 339 ms of which 76 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 590/1984 variables, and 55 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 55 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41193ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 41195ms
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:31:22] [INFO ] Redundant transitions in 20 ms returned []
Running 1410 sub problems to find dead transitions.
[2025-06-03 04:31:22] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 04:31:22] [INFO ] Invariant cache hit.
[2025-06-03 04:31:22] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:31:40] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:31:40] [INFO ] Deduced a trap composed of 50 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-03 04:31:40] [INFO ] Deduced a trap composed of 50 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-03 04:31:40] [INFO ] Deduced a trap composed of 50 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-03 04:31:40] [INFO ] Deduced a trap composed of 50 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-03 04:31:40] [INFO ] Deduced a trap composed of 50 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-03 04:31:40] [INFO ] Deduced a trap composed of 50 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-03 04:31:40] [INFO ] Deduced a trap composed of 50 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-03 04:31:40] [INFO ] Deduced a trap composed of 50 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-03 04:31:41] [INFO ] Deduced a trap composed of 217 places in 339 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:31:41] [INFO ] Deduced a trap composed of 226 places in 325 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:31:49] [INFO ] Deduced a trap composed of 50 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-03 04:31:51] [INFO ] Deduced a trap composed of 207 places in 374 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:31:51] [INFO ] Deduced a trap composed of 23 places in 304 ms of which 35 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61111ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 61113ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 102371 ms. Remains : 592/592 places, 1412/1412 transitions.
Built C files in :
/tmp/ltsmin17167967193714265013
[2025-06-03 04:32:23] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17167967193714265013
Running compilation step : cd /tmp/ltsmin17167967193714265013;'/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 2561 ms.
Running link step : cd /tmp/ltsmin17167967193714265013;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin17167967193714265013;'/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/stateBased4910195350715883154.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 31 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 1412/1412 transitions.
Applied a total of 0 rules in 13 ms. Remains 592 /592 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2025-06-03 04:32:38] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 04:32:38] [INFO ] Invariant cache hit.
[2025-06-03 04:32:38] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:32:55] [INFO ] Deduced a trap composed of 50 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-03 04:32:55] [INFO ] Deduced a trap composed of 50 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-03 04:32:55] [INFO ] Deduced a trap composed of 50 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-03 04:32:56] [INFO ] Deduced a trap composed of 50 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-03 04:32:56] [INFO ] Deduced a trap composed of 50 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-03 04:32:56] [INFO ] Deduced a trap composed of 50 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-03 04:32:56] [INFO ] Deduced a trap composed of 50 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-03 04:32:56] [INFO ] Deduced a trap composed of 50 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-03 04:32:56] [INFO ] Deduced a trap composed of 50 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-03 04:32:56] [INFO ] Deduced a trap composed of 217 places in 330 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:32:57] [INFO ] Deduced a trap composed of 226 places in 313 ms of which 76 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 55 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 55 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41084ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 41086ms
[2025-06-03 04:33:19] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 04:33:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:33:20] [INFO ] Implicit Places using invariants in 1050 ms returned []
[2025-06-03 04:33:20] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 04:33:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:33:21] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 04:33:31] [INFO ] Implicit Places using invariants and state equation in 10102 ms returned []
Implicit Place search using SMT with State Equation took 11155 ms to find 0 implicit places.
Running 1410 sub problems to find dead transitions.
[2025-06-03 04:33:31] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 04:33:31] [INFO ] Invariant cache hit.
[2025-06-03 04:33:31] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:48] [INFO ] Deduced a trap composed of 50 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-03 04:33:48] [INFO ] Deduced a trap composed of 50 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-03 04:33:48] [INFO ] Deduced a trap composed of 50 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-03 04:33:48] [INFO ] Deduced a trap composed of 50 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-03 04:33:48] [INFO ] Deduced a trap composed of 50 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-03 04:33:48] [INFO ] Deduced a trap composed of 50 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-03 04:33:48] [INFO ] Deduced a trap composed of 50 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-03 04:33:48] [INFO ] Deduced a trap composed of 50 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-03 04:33:49] [INFO ] Deduced a trap composed of 50 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-03 04:33:49] [INFO ] Deduced a trap composed of 217 places in 347 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:49] [INFO ] Deduced a trap composed of 226 places in 320 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:57] [INFO ] Deduced a trap composed of 50 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-03 04:33:59] [INFO ] Deduced a trap composed of 207 places in 337 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:33:59] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 33 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 590/1984 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/590 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 590/1984 variables, and 58 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/592 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61086ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 61091ms
Finished structural reductions in LTL mode , in 1 iterations and 113352 ms. Remains : 592/592 places, 1412/1412 transitions.
Built C files in :
/tmp/ltsmin9360692285840806012
[2025-06-03 04:34:32] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9360692285840806012
Running compilation step : cd /tmp/ltsmin9360692285840806012;'/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 2833 ms.
Running link step : cd /tmp/ltsmin9360692285840806012;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin9360692285840806012;'/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/stateBased10343395213698738813.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 04:34:47] [INFO ] Flatten gal took : 42 ms
[2025-06-03 04:34:47] [INFO ] Flatten gal took : 42 ms
[2025-06-03 04:34:47] [INFO ] Time to serialize gal into /tmp/LTL15740710207894538600.gal : 6 ms
[2025-06-03 04:34:47] [INFO ] Time to serialize properties into /tmp/LTL13762151583844057008.prop : 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/LTL15740710207894538600.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4591856624690505315.hoa' '-atoms' '/tmp/LTL13762151583844057008.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/LTL13762151583844057008.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4591856624690505315.hoa
Detected timeout of ITS tools.
[2025-06-03 04:35:02] [INFO ] Flatten gal took : 44 ms
[2025-06-03 04:35:02] [INFO ] Flatten gal took : 58 ms
[2025-06-03 04:35:02] [INFO ] Time to serialize gal into /tmp/LTL11878962983789215433.gal : 8 ms
[2025-06-03 04:35:02] [INFO ] Time to serialize properties into /tmp/LTL259799002461691878.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/LTL11878962983789215433.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL259799002461691878.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 : !(((F((G(F("(NoSigAbort<=((((NotifyEventJobQueuedE_0+NotifyEventJobQueuedE_1)+(NotifyEventJobQueuedE_2+NotifyEventJobQueuedE_3))+((Not...1037
Formula 0 simplified : G(FG!"(NoSigAbort<=((((NotifyEventJobQueuedE_0+NotifyEventJobQueuedE_1)+(NotifyEventJobQueuedE_2+NotifyEventJobQueuedE_3))+((NotifyE...1020
Detected timeout of ITS tools.
[2025-06-03 04:35:17] [INFO ] Flatten gal took : 45 ms
[2025-06-03 04:35:17] [INFO ] Applying decomposition
[2025-06-03 04:35:17] [INFO ] Flatten gal took : 45 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/graph5239686740136162874.txt' '-o' '/tmp/graph5239686740136162874.bin' '-w' '/tmp/graph5239686740136162874.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5239686740136162874.bin' '-l' '-1' '-v' '-w' '/tmp/graph5239686740136162874.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:35:17] [INFO ] Decomposing Gal with order
[2025-06-03 04:35:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:35:18] [INFO ] Removed a total of 1083 redundant transitions.
[2025-06-03 04:35:18] [INFO ] Flatten gal took : 168 ms
[2025-06-03 04:35:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1226 labels/synchronizations in 25 ms.
[2025-06-03 04:35:18] [INFO ] Time to serialize gal into /tmp/LTL3404031033523151537.gal : 9 ms
[2025-06-03 04:35:18] [INFO ] Time to serialize properties into /tmp/LTL15834170931310732175.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/LTL3404031033523151537.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15834170931310732175.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 : !(((F((G(F("(gu2.NoSigAbort<=((((gu2.NotifyEventJobQueuedE_0+gu2.NotifyEventJobQueuedE_1)+(gu2.NotifyEventJobQueuedE_2+gu2.NotifyEvent...1215
Formula 0 simplified : G(FG!"(gu2.NoSigAbort<=((((gu2.NotifyEventJobQueuedE_0+gu2.NotifyEventJobQueuedE_1)+(gu2.NotifyEventJobQueuedE_2+gu2.NotifyEventJobQ...1198
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-00 finished in 553607 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(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F((p0||G(F(p0))||(p1&&F(p0)))))||(p2&&F(((p1&&F(p0))||X((p0||G(F(p0))))))))))))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J06T10-LTLCardinality-10
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 22 out of 832 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 832 transition count 1592
Reduce places removed 60 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 70 rules applied. Total rules applied 130 place count 772 transition count 1582
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 140 place count 762 transition count 1582
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 140 place count 762 transition count 1482
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 340 place count 662 transition count 1482
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 500 place count 582 transition count 1402
Applied a total of 500 rules in 48 ms. Remains 582 /832 variables (removed 250) and now considering 1402/1652 (removed 250) transitions.
Running 1400 sub problems to find dead transitions.
[2025-06-03 04:35:33] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 582 cols
[2025-06-03 04:35:33] [INFO ] Computed 46 invariants in 21 ms
[2025-06-03 04:35:33] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:35:51] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:35:51] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:35:51] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:35:51] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:35:51] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:35:51] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:35:52] [INFO ] Deduced a trap composed of 49 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-03 04:35:52] [INFO ] Deduced a trap composed of 49 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-03 04:35:52] [INFO ] Deduced a trap composed of 49 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-03 04:35:52] [INFO ] Deduced a trap composed of 207 places in 345 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:35:52] [INFO ] Deduced a trap composed of 216 places in 345 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:35:53] [INFO ] Deduced a trap composed of 197 places in 330 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:35:53] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 33 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.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 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 9.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 4.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 0.0)
(s442 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 580/1964 variables, and 57 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:36:04] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 8)
(s1 2)
(s2 4)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 1)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/1964 variables, and 58 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41224ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 41226ms
[2025-06-03 04:36:14] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 04:36:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:36:15] [INFO ] Implicit Places using invariants in 869 ms returned []
[2025-06-03 04:36:15] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 04:36:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:36:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 04:36:26] [INFO ] Implicit Places using invariants and state equation in 10618 ms returned []
Implicit Place search using SMT with State Equation took 11490 ms to find 0 implicit places.
Running 1400 sub problems to find dead transitions.
[2025-06-03 04:36:26] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 04:36:26] [INFO ] Invariant cache hit.
[2025-06-03 04:36:26] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:36:43] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:36:43] [INFO ] Deduced a trap composed of 49 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-03 04:36:44] [INFO ] Deduced a trap composed of 49 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-03 04:36:44] [INFO ] Deduced a trap composed of 49 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-03 04:36:44] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:36:44] [INFO ] Deduced a trap composed of 49 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-03 04:36:44] [INFO ] Deduced a trap composed of 49 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-03 04:36:44] [INFO ] Deduced a trap composed of 49 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-03 04:36:44] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:36:45] [INFO ] Deduced a trap composed of 207 places in 343 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:36:45] [INFO ] Deduced a trap composed of 216 places in 343 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:36:47] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 2 ms to minimize.
(s466 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.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 0.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 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 9.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 (/ 1.0 3.0))
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 (/ 1.0 3.0))
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 (/ 1.0 3.0))
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 6.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0timeout
)
(s467 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1964 variables, and 56 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:37:05] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:37:05] [INFO ] Deduced a trap composed of 197 places in 311 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:37:27] [INFO ] Deduced a trap composed of 216 places in 308 ms of which 76 ms to minimize.
SMT process timed out in 61239ms, After SMT, problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 61241ms
Starting structural reductions in LI_LTL mode, iteration 1 : 582/832 places, 1402/1652 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 114011 ms. Remains : 582/832 places, 1402/1652 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-10
Product exploration explored 100000 steps with 3578 reset in 348 ms.
Product exploration explored 100000 steps with 3595 reset in 374 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 (NOT p2) (NOT p0) (NOT p1)), (X (X (OR (NOT p0) (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1254 steps (0 resets) in 12 ms. (96 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (X (OR (NOT p0) (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F p0), (F (NOT (OR (AND (NOT p1) p2) (NOT p0))))]
Knowledge based reduction with 5 factoid took 154 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-03 04:37:29] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 04:37:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 04:37:30] [INFO ] [Real]Absence check using 15 positive place invariants in 492 ms returned sat
[2025-06-03 04:37:32] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 2683 ms returned sat
[2025-06-03 04:37:40] [INFO ] [Real]Absence check using state equation in 7320 ms returned sat
[2025-06-03 04:37:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 04:37:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 45 ms returned sat
[2025-06-03 04:37:42] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 1212 ms returned sat
[2025-06-03 04:37:55] [INFO ] [Nat]Absence check using state equation in 13150 ms returned unknown
Could not prove EG (NOT p0)
Support contains 22 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 1402/1402 transitions.
Applied a total of 0 rules in 9 ms. Remains 582 /582 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Running 1400 sub problems to find dead transitions.
[2025-06-03 04:37:55] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 04:37:55] [INFO ] Invariant cache hit.
[2025-06-03 04:37:55] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:38:13] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:38:13] [INFO ] Deduced a trap composed of 49 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-03 04:38:13] [INFO ] Deduced a trap composed of 49 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-03 04:38:13] [INFO ] Deduced a trap composed of 49 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-03 04:38:13] [INFO ] Deduced a trap composed of 49 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-03 04:38:13] [INFO ] Deduced a trap composed of 49 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-03 04:38:13] [INFO ] Deduced a trap composed of 49 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-03 04:38:13] [INFO ] Deduced a trap composed of 49 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-03 04:38:13] [INFO ] Deduced a trap composed of 49 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-03 04:38:13] [INFO ] Deduced a trap composed of 207 places in 338 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:38:14] [INFO ] Deduced a trap composed of 216 places in 342 ms of which 96 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 580/1964 variables, and 55 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:38:24] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:38:24] [INFO ] Deduced a trap composed of 49 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-03 04:38:32] [INFO ] Deduced a trap composed of 197 places in 316 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:38:32] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 31 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/1964 variables, and 59 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41166ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 41167ms
[2025-06-03 04:38:36] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 04:38:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:38:37] [INFO ] Implicit Places using invariants in 852 ms returned []
[2025-06-03 04:38:37] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 04:38:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:38:37] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 04:38:47] [INFO ] Implicit Places using invariants and state equation in 10631 ms returned []
Implicit Place search using SMT with State Equation took 11486 ms to find 0 implicit places.
Running 1400 sub problems to find dead transitions.
[2025-06-03 04:38:47] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 04:38:47] [INFO ] Invariant cache hit.
[2025-06-03 04:38:47] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:39:04] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:39:04] [INFO ] Deduced a trap composed of 49 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-03 04:39:04] [INFO ] Deduced a trap composed of 49 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-03 04:39:05] [INFO ] Deduced a trap composed of 49 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-03 04:39:05] [INFO ] Deduced a trap composed of 49 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-03 04:39:05] [INFO ] Deduced a trap composed of 49 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-03 04:39:05] [INFO ] Deduced a trap composed of 49 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-03 04:39:05] [INFO ] Deduced a trap composed of 49 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-03 04:39:05] [INFO ] Deduced a trap composed of 49 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-03 04:39:05] [INFO ] Deduced a trap composed of 207 places in 343 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:39:06] [INFO ] Deduced a trap composed of 216 places in 337 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:39:08] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1964 variables, and 56 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:39:26] [INFO ] Deduced a trap composed of 23 places in 276 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:39:27] [INFO ] Deduced a trap composed of 197 places in 304 ms of which 63 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/1964 variables, and 58 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61098ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 61103ms
Finished structural reductions in LTL mode , in 1 iterations and 113773 ms. Remains : 582/582 places, 1402/1402 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT p2))), (X (X (OR (AND (NOT p1) p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1942 steps (0 resets) in 15 ms. (121 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT p2))), (X (X (OR (AND (NOT p1) p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F p0), (F (NOT (OR (AND (NOT p1) p2) (NOT p0))))]
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-03 04:39:49] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 04:39:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 04:39:50] [INFO ] [Real]Absence check using 15 positive place invariants in 487 ms returned sat
[2025-06-03 04:39:53] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 2655 ms returned sat
[2025-06-03 04:40:00] [INFO ] [Real]Absence check using state equation in 7219 ms returned sat
[2025-06-03 04:40:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 04:40:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 43 ms returned sat
[2025-06-03 04:40:02] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 1202 ms returned sat
[2025-06-03 04:40:15] [INFO ] [Nat]Absence check using state equation in 12726 ms returned sat
[2025-06-03 04:40:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 04:40:15] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 04:40:15] [INFO ] [Nat]Added 120 Read/Feed constraints in 448 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3588 reset in 349 ms.
Product exploration explored 100000 steps with 3593 reset in 381 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 22 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 1402/1402 transitions.
Applied a total of 0 rules in 22 ms. Remains 582 /582 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Running 1400 sub problems to find dead transitions.
[2025-06-03 04:40:17] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 04:40:17] [INFO ] Invariant cache hit.
[2025-06-03 04:40:17] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:40:34] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:40:34] [INFO ] Deduced a trap composed of 49 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-03 04:40:34] [INFO ] Deduced a trap composed of 49 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-03 04:40:35] [INFO ] Deduced a trap composed of 49 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-03 04:40:35] [INFO ] Deduced a trap composed of 49 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-03 04:40:35] [INFO ] Deduced a trap composed of 49 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-03 04:40:35] [INFO ] Deduced a trap composed of 49 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-03 04:40:35] [INFO ] Deduced a trap composed of 49 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-03 04:40:35] [INFO ] Deduced a trap composed of 49 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-03 04:40:35] [INFO ] Deduced a trap composed of 207 places in 336 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:40:36] [INFO ] Deduced a trap composed of 216 places in 336 ms of which 95 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1964 variables, and 55 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:40:45] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:40:46] [INFO ] Deduced a trap composed of 49 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-03 04:40:54] [INFO ] Deduced a trap composed of 197 places in 334 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:40:54] [INFO ] Deduced a trap composed of 23 places in 297 ms of which 32 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/1964 variables, and 59 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41164ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 41166ms
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:40:58] [INFO ] Redundant transitions in 15 ms returned []
Running 1400 sub problems to find dead transitions.
[2025-06-03 04:40:58] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 04:40:58] [INFO ] Invariant cache hit.
[2025-06-03 04:40:58] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:41:15] [INFO ] Deduced a trap composed of 49 places in 153 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:41:16] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:41:16] [INFO ] Deduced a trap composed of 49 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-03 04:41:16] [INFO ] Deduced a trap composed of 49 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-03 04:41:16] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:41:16] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:41:16] [INFO ] Deduced a trap composed of 49 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-03 04:41:16] [INFO ] Deduced a trap composed of 49 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-03 04:41:16] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:41:17] [INFO ] Deduced a trap composed of 207 places in 381 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:41:17] [INFO ] Deduced a trap composed of 216 places in 351 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:41:19] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1964 variables, and 56 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:41:36] [INFO ] Deduced a trap composed of 23 places in 290 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:41:37] [INFO ] Deduced a trap composed of 197 places in 319 ms of which 64 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 7)
(s1 3)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 1)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 9)
(s213 1)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 1)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 1)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 1)
(s389 1)
(s390 0)
(s391 1)
(s392 0)
(s393 0)
(s394 1)
(s395 0)
(s396 0)
(s397 3)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 1)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 1)timeout
(s439 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/1964 variables, and 58 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61123ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 61125ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 102339 ms. Remains : 582/582 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin11100578753163322862
[2025-06-03 04:41:59] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11100578753163322862
Running compilation step : cd /tmp/ltsmin11100578753163322862;'/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 2677 ms.
Running link step : cd /tmp/ltsmin11100578753163322862;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11100578753163322862;'/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/stateBased4132567645184947126.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 22 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 1402/1402 transitions.
Applied a total of 0 rules in 14 ms. Remains 582 /582 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Running 1400 sub problems to find dead transitions.
[2025-06-03 04:42:14] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 04:42:14] [INFO ] Invariant cache hit.
[2025-06-03 04:42:14] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:42:32] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:42:32] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:42:32] [INFO ] Deduced a trap composed of 49 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-03 04:42:32] [INFO ] Deduced a trap composed of 49 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-03 04:42:32] [INFO ] Deduced a trap composed of 49 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-03 04:42:32] [INFO ] Deduced a trap composed of 49 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-03 04:42:32] [INFO ] Deduced a trap composed of 49 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-03 04:42:32] [INFO ] Deduced a trap composed of 49 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-03 04:42:32] [INFO ] Deduced a trap composed of 49 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-03 04:42:33] [INFO ] Deduced a trap composed of 207 places in 380 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:42:33] [INFO ] Deduced a trap composed of 216 places in 373 ms of which 98 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1964 variables, and 55 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:42:43] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:42:43] [INFO ] Deduced a trap composed of 49 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-03 04:42:51] [INFO ] Deduced a trap composed of 197 places in 313 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:42:52] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 32 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/1964 variables, and 59 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41140ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 41142ms
[2025-06-03 04:42:55] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 04:42:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:42:56] [INFO ] Implicit Places using invariants in 852 ms returned []
[2025-06-03 04:42:56] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 04:42:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:42:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 04:43:07] [INFO ] Implicit Places using invariants and state equation in 11039 ms returned []
Implicit Place search using SMT with State Equation took 11892 ms to find 0 implicit places.
Running 1400 sub problems to find dead transitions.
[2025-06-03 04:43:07] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 04:43:07] [INFO ] Invariant cache hit.
[2025-06-03 04:43:07] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:43:24] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:43:25] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:43:25] [INFO ] Deduced a trap composed of 49 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-03 04:43:25] [INFO ] Deduced a trap composed of 49 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-03 04:43:25] [INFO ] Deduced a trap composed of 49 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-03 04:43:25] [INFO ] Deduced a trap composed of 49 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-03 04:43:25] [INFO ] Deduced a trap composed of 49 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-03 04:43:25] [INFO ] Deduced a trap composed of 49 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-03 04:43:25] [INFO ] Deduced a trap composed of 49 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-03 04:43:25] [INFO ] Deduced a trap composed of 207 places in 347 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:43:26] [INFO ] Deduced a trap composed of 216 places in 347 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:43:28] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 2 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 580/1964 variables, and 56 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:43:46] [INFO ] Deduced a trap composed of 23 places in 301 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:43:46] [INFO ] Deduced a trap composed of 197 places in 336 ms of which 63 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/1964 variables, and 58 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/582 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61119ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 61120ms
Finished structural reductions in LTL mode , in 1 iterations and 114172 ms. Remains : 582/582 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin16819186351528717016
[2025-06-03 04:44:08] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16819186351528717016
Running compilation step : cd /tmp/ltsmin16819186351528717016;'/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 2650 ms.
Running link step : cd /tmp/ltsmin16819186351528717016;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16819186351528717016;'/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/stateBased11533410860432555648.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 04:44:23] [INFO ] Flatten gal took : 42 ms
[2025-06-03 04:44:23] [INFO ] Flatten gal took : 42 ms
[2025-06-03 04:44:23] [INFO ] Time to serialize gal into /tmp/LTL11068748128640681075.gal : 7 ms
[2025-06-03 04:44:23] [INFO ] Time to serialize properties into /tmp/LTL16647738444414876408.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11068748128640681075.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3110345777016440574.hoa' '-atoms' '/tmp/LTL16647738444414876408.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/LTL16647738444414876408.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3110345777016440574.hoa
Detected timeout of ITS tools.
[2025-06-03 04:44:38] [INFO ] Flatten gal took : 43 ms
[2025-06-03 04:44:38] [INFO ] Flatten gal took : 44 ms
[2025-06-03 04:44:39] [INFO ] Time to serialize gal into /tmp/LTL3087751897698394255.gal : 7 ms
[2025-06-03 04:44:39] [INFO ] Time to serialize properties into /tmp/LTL2480103975022022945.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/LTL3087751897698394255.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2480103975022022945.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 : !((X(X(F((G(F((("(NoSigAbort<1)")||(G(F("(NoSigAbort<1)"))))||(("(((((NotifyEventJobCompletedB_0+NotifyEventJobCompletedB_1)+(NotifyEv...966
Formula 0 simplified : XXG(FG!"(NoSigAbort<1)" & (!"(cPollingAbort<1)" | G((!"(((((NotifyEventJobCompletedB_0+NotifyEventJobCompletedB_1)+(NotifyEventJobCo...516
Detected timeout of ITS tools.
[2025-06-03 04:44:54] [INFO ] Flatten gal took : 45 ms
[2025-06-03 04:44:54] [INFO ] Applying decomposition
[2025-06-03 04:44:54] [INFO ] Flatten gal took : 43 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/graph11545337954940793264.txt' '-o' '/tmp/graph11545337954940793264.bin' '-w' '/tmp/graph11545337954940793264.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11545337954940793264.bin' '-l' '-1' '-v' '-w' '/tmp/graph11545337954940793264.weights' '-q' '0' '-e' '0.001'
[2025-06-03 04:44:54] [INFO ] Decomposing Gal with order
[2025-06-03 04:44:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 04:44:54] [INFO ] Removed a total of 1021 redundant transitions.
[2025-06-03 04:44:54] [INFO ] Flatten gal took : 110 ms
[2025-06-03 04:44:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 570 labels/synchronizations in 24 ms.
[2025-06-03 04:44:54] [INFO ] Time to serialize gal into /tmp/LTL405890782007589307.gal : 8 ms
[2025-06-03 04:44:54] [INFO ] Time to serialize properties into /tmp/LTL3814904448020201230.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/LTL405890782007589307.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3814904448020201230.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F((("(gi1.gi2.gu42.NoSigAbort<1)")||(G(F("(gi1.gi2.gu42.NoSigAbort<1)"))))||(("(((((gu28.NotifyEventJobCompletedB_0+gu28.N...1257
Formula 0 simplified : XXG(FG!"(gi1.gi2.gu42.NoSigAbort<1)" & (!"(gi1.gi2.gu42.cPollingAbort<1)" | G((!"(((((gu28.NotifyEventJobCompletedB_0+gu28.NotifyEve...681
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J06T10-LTLCardinality-10 finished in 576205 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((G(p0)||(X(p0)&&p1))))))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J06T10-LTLCardinality-11
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 27 out of 832 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 832/832 places, 1652/1652 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 832 transition count 1572
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 752 transition count 1572
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 160 place count 752 transition count 1472
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 360 place count 652 transition count 1472
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 370 place count 642 transition count 1462
Iterating global reduction 2 with 10 rules applied. Total rules applied 380 place count 642 transition count 1462
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 520 place count 572 transition count 1392
Applied a total of 520 rules in 54 ms. Remains 572 /832 variables (removed 260) and now considering 1392/1652 (removed 260) transitions.
Running 1390 sub problems to find dead transitions.
[2025-06-03 04:45:09] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 572 cols
[2025-06-03 04:45:09] [INFO ] Computed 46 invariants in 36 ms
[2025-06-03 04:45:09] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:45:27] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:45:27] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:45:27] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:45:28] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:45:28] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:45:28] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:45:28] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:45:28] [INFO ] Deduced a trap composed of 48 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-03 04:45:28] [INFO ] Deduced a trap composed of 48 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-03 04:45:28] [INFO ] Deduced a trap composed of 48 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-03 04:45:29] [INFO ] Deduced a trap composed of 207 places in 345 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:45:29] [INFO ] Deduced a trap composed of 216 places in 367 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:45:29] [INFO ] Deduced a trap composed of 187 places in 346 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:45:30] [INFO ] Deduced a trap composed of 40 places in 288 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:45:30] [INFO ] Deduced a trap composed of 40 places in 329 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:45:30] [INFO ] Deduced a trap composed of 40 places in 271 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:45:31] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 60 ms to minimize.
SMT process timed out in 21158ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 21161ms
[2025-06-03 04:45:31] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 04:45:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:45:32] [INFO ] Implicit Places using invariants in 1003 ms returned []
[2025-06-03 04:45:32] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 04:45:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:45:32] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 04:45:43] [INFO ] Implicit Places using invariants and state equation in 11722 ms returned []
Implicit Place search using SMT with State Equation took 12729 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2025-06-03 04:45:43] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 04:45:43] [INFO ] Invariant cache hit.
[2025-06-03 04:45:43] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:46:01] [INFO ] Deduced a trap composed of 47 places in 247 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:46:01] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:46:01] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:46:01] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:46:02] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:46:02] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:46:02] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:46:02] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:46:02] [INFO ] Deduced a trap composed of 48 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-03 04:46:02] [INFO ] Deduced a trap composed of 48 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-03 04:46:02] [INFO ] Deduced a trap composed of 207 places in 358 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:46:03] [INFO ] Deduced a trap composed of 216 places in 341 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:46:05] [INFO ] Deduced a trap composed of 48 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-03 04:46:14] [INFO ] Deduced a trap composed of 187 places in 345 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:46:14] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 31 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:46:32] [INFO ] Deduced a trap composed of 206 places in 346 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:46:42] [INFO ] Deduced a trap composed of 152 places in 332 ms of which 85 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 61 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61103ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 61105ms
Starting structural reductions in LI_LTL mode, iteration 1 : 572/832 places, 1392/1652 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 95053 ms. Remains : 572/832 places, 1392/1652 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J06T10-LTLCardinality-11
Product exploration explored 100000 steps with 2709 reset in 457 ms.
Product exploration explored 100000 steps with 2704 reset in 551 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 (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 281 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Reduction of identical properties reduced properties to check from 6 to 4
RANDOM walk for 40000 steps (14 resets) in 223 ms. (178 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (11 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
[2025-06-03 04:46:46] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 04:46:46] [INFO ] Invariant cache hit.
[2025-06-03 04:46:46] [INFO ] State equation strengthened by 120 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf0 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 264/1944 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 2/14 constraints, Generalized P Invariants (flows): 0/32 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (G (OR p0 p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 425 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[p1, p1, p1, p1]
Stuttering acceptance computed with spot in 183 ms :[p1, p1, p1, p1]
Support contains 27 out of 572 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 572/572 places, 1392/1392 transitions.
Applied a total of 0 rules in 13 ms. Remains 572 /572 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Running 1390 sub problems to find dead transitions.
[2025-06-03 04:46:47] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 04:46:47] [INFO ] Invariant cache hit.
[2025-06-03 04:46:47] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:47:04] [INFO ] Deduced a trap composed of 47 places in 234 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:47:05] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:47:05] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:47:05] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:47:05] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:47:05] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:47:05] [INFO ] Deduced a trap composed of 48 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-03 04:47:05] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:47:05] [INFO ] Deduced a trap composed of 48 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-03 04:47:05] [INFO ] Deduced a trap composed of 48 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-03 04:47:06] [INFO ] Deduced a trap composed of 207 places in 334 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:47:06] [INFO ] Deduced a trap composed of 216 places in 333 ms of which 94 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 56 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:47:13] [INFO ] Deduced a trap composed of 48 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-03 04:47:14] [INFO ] Deduced a trap composed of 23 places in 124 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 Int declared 570/1944 variables, and 58 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41223ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41225ms
[2025-06-03 04:47:28] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 04:47:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:47:29] [INFO ] Implicit Places using invariants in 1011 ms returned []
[2025-06-03 04:47:29] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 04:47:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 04:47:30] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 04:47:40] [INFO ] Implicit Places using invariants and state equation in 11276 ms returned []
Implicit Place search using SMT with State Equation took 12292 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2025-06-03 04:47:40] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 04:47:40] [INFO ] Invariant cache hit.
[2025-06-03 04:47:40] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:47:58] [INFO ] Deduced a trap composed of 47 places in 219 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:47:58] [INFO ] Deduced a trap composed of 48 places in 153 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:47:58] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:47:58] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:47:58] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:47:58] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:47:59] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:47:59] [INFO ] Deduced a trap composed of 48 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-03 04:47:59] [INFO ] Deduced a trap composed of 48 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-03 04:47:59] [INFO ] Deduced a trap composed of 48 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-03 04:47:59] [INFO ] Deduced a trap composed of 207 places in 326 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:48:00] [INFO ] Deduced a trap composed of 216 places in 330 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:48:02] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:48:10] [INFO ] Deduced a trap composed of 187 places in 366 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:48:11] [INFO ] Deduced a trap composed of 23 places in 290 ms of which 32 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 570/1944 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:48:29] [INFO ] Deduced a trap composed of 206 places in 325 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:48:38] [INFO ] Deduced a trap composed of 152 places in 303 ms of which 83 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 61 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61146ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 61150ms
Finished structural reductions in LTL mode , in 1 iterations and 114687 ms. Remains : 572/572 places, 1392/1392 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 : [(NOT p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 127 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[p1, p1, p1, p1]
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 1 factoid took 143 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[p1, p1, p1, p1]
Stuttering acceptance computed with spot in 140 ms :[p1, p1, p1, p1]
Stuttering acceptance computed with spot in 122 ms :[p1, p1, p1, p1]
Product exploration explored 100000 steps with 2683 reset in 422 ms.
Product exploration explored 100000 steps with 2735 reset in 438 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 130 ms :[p1, p1, p1, p1]
Support contains 27 out of 572 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 572/572 places, 1392/1392 transitions.
Applied a total of 0 rules in 22 ms. Remains 572 /572 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Running 1390 sub problems to find dead transitions.
[2025-06-03 04:48:44] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 04:48:44] [INFO ] Invariant cache hit.
[2025-06-03 04:48:44] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:01] [INFO ] Deduced a trap composed of 47 places in 256 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:01] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:01] [INFO ] Deduced a trap composed of 48 places in 174 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:01] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:02] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:02] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:02] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:02] [INFO ] Deduced a trap composed of 48 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-03 04:49:02] [INFO ] Deduced a trap composed of 48 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-03 04:49:02] [INFO ] Deduced a trap composed of 48 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-03 04:49:02] [INFO ] Deduced a trap composed of 207 places in 324 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:03] [INFO ] Deduced a trap composed of 216 places in 337 ms of which 94 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 56 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 12/56 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:10] [INFO ] Deduced a trap composed of 48 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-03 04:49:10] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1944 variables, and 58 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41191ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41193ms
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 04:49:25] [INFO ] Redundant transitions in 16 ms returned []
Running 1390 sub problems to find dead transitions.
[2025-06-03 04:49:25] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 04:49:25] [INFO ] Invariant cache hit.
[2025-06-03 04:49:25] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:43] [INFO ] Deduced a trap composed of 47 places in 250 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:43] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:43] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:43] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:43] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:43] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:43] [INFO ] Deduced a trap composed of 48 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-03 04:49:44] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:44] [INFO ] Deduced a trap composed of 48 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-03 04:49:44] [INFO ] Deduced a trap composed of 48 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-03 04:49:44] [INFO ] Deduced a trap composed of 207 places in 326 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:45] [INFO ] Deduced a trap composed of 216 places in 331 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:47] [INFO ] Deduced a trap composed of 48 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-03 04:49:56] [INFO ] Deduced a trap composed of 187 places in 323 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 04:49:56] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 31 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1944 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J06T10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S02J06T10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881253800307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T10.tgz
mv PolyORBLF-COL-S02J06T10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;