About the Execution of ITS-Tools for Szymanski-PT-b06
| 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 | TFFTFFF?FTTTFT?T | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r240-tall-174915589300147.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 Szymanski-PT-b06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915589300147
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 8.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 3.7M May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-00
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-01
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-02
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-03
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-04
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-05
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-06
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-07
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-08
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-09
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-10
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-11
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-12
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-13
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-14
FORMULA_NAME Szymanski-PT-b06-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749178044498
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-06 02:47:26] [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-06 02:47:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 02:47:26] [INFO ] Load time of PNML (sax parser for PT used): 379 ms
[2025-06-06 02:47:26] [INFO ] Transformed 568 places.
[2025-06-06 02:47:26] [INFO ] Transformed 8320 transitions.
[2025-06-06 02:47:26] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 559 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 260 places in 26 ms
Reduce places removed 260 places and 256 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA Szymanski-PT-b06-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 307 transition count 8064
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 306 transition count 7936
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 306 transition count 7936
Applied a total of 3 rules in 266 ms. Remains 306 /308 variables (removed 2) and now considering 7936/8064 (removed 128) transitions.
[2025-06-06 02:47:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 306 cols
[2025-06-06 02:47:27] [INFO ] Computed 2 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:47:30] [INFO ] Implicit Places using invariants in 2975 ms returned []
[2025-06-06 02:47:30] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 02:47:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:47:31] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 02:47:41] [INFO ] Implicit Places using invariants and state equation in 11531 ms returned []
Implicit Place search using SMT with State Equation took 14562 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2025-06-06 02:47:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 02:47:41] [INFO ] Invariant cache hit.
[2025-06-06 02:47:41] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3038 variables, and 0 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30155 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/306 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3038 variables, and 0 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30106 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/306 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73920ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 74004ms
Starting structural reductions in LTL mode, iteration 1 : 306/308 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88912 ms. Remains : 306/308 places, 7936/8064 transitions.
Support contains 16 out of 306 places after structural reductions.
[2025-06-06 02:48:56] [INFO ] Flatten gal took : 419 ms
[2025-06-06 02:48:56] [INFO ] Flatten gal took : 282 ms
[2025-06-06 02:48:57] [INFO ] Input system was already deterministic with 7936 transitions.
RANDOM walk for 40008 steps (9 resets) in 1087 ms. (36 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (13 resets) in 298 ms. (133 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (9 resets) in 181 ms. (219 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (14 resets) in 182 ms. (218 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (14 resets) in 160 ms. (248 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (11 resets) in 136 ms. (291 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (11 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (17 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
[2025-06-06 02:48:58] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 02:48:58] [INFO ] Invariant cache hit.
[2025-06-06 02:48:58] [INFO ] State equation strengthened by 147 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, 9 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 294/306 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:48:59] [INFO ] Deduced a trap composed of 31 places in 743 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:48:59] [INFO ] Deduced a trap composed of 37 places in 722 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:00] [INFO ] Deduced a trap composed of 43 places in 736 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:01] [INFO ] Deduced a trap composed of 43 places in 806 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:02] [INFO ] Deduced a trap composed of 51 places in 698 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:02] [INFO ] Deduced a trap composed of 43 places in 679 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:03] [INFO ] Deduced a trap composed of 48 places in 694 ms of which 72 ms to minimize.
SMT process timed out in 5301ms, After SMT, problems are : Problem set: 5 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 318 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 320 ms. Remains : 306/306 places, 7936/7936 transitions.
RANDOM walk for 40006 steps (9 resets) in 262 ms. (152 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 145 ms. (274 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (13 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 144849 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 4
Probabilistic random walk after 144849 steps, saw 81713 distinct states, run finished after 3006 ms. (steps per millisecond=48 ) properties seen :0
[2025-06-06 02:49:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 02:49:07] [INFO ] Invariant cache hit.
[2025-06-06 02:49:07] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 300/306 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3038 variables, 306/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3038 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3038 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/3038 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3038/3038 variables, and 455 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1311 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 300/306 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:09] [INFO ] Deduced a trap composed of 93 places in 729 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:10] [INFO ] Deduced a trap composed of 76 places in 683 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:10] [INFO ] Deduced a trap composed of 130 places in 792 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:11] [INFO ] Deduced a trap composed of 138 places in 447 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:12] [INFO ] Deduced a trap composed of 130 places in 741 ms of which 69 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2732/3038 variables, 306/313 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3038 variables, 147/460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3038 variables, 4/464 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3038 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/3038 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3038/3038 variables, and 464 constraints, problems are : Problem set: 0 solved, 4 unsolved in 7505 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8850ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 841 ms.
Support contains 5 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 217 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 306/306 places, 7936/7936 transitions.
RANDOM walk for 40005 steps (12 resets) in 326 ms. (122 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 155327 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 3
Probabilistic random walk after 155327 steps, saw 84264 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
[2025-06-06 02:49:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 02:49:20] [INFO ] Invariant cache hit.
[2025-06-06 02:49:20] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 301/306 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:21] [INFO ] Deduced a trap composed of 32 places in 731 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:21] [INFO ] Deduced a trap composed of 43 places in 724 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:22] [INFO ] Deduced a trap composed of 43 places in 740 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:23] [INFO ] Deduced a trap composed of 76 places in 767 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:24] [INFO ] Deduced a trap composed of 130 places in 783 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:24] [INFO ] Deduced a trap composed of 130 places in 745 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:25] [INFO ] Deduced a trap composed of 38 places in 660 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:26] [INFO ] Deduced a trap composed of 65 places in 571 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:26] [INFO ] Deduced a trap composed of 46 places in 643 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:27] [INFO ] Deduced a trap composed of 73 places in 604 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:27] [INFO ] Deduced a trap composed of 138 places in 291 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2732/3038 variables, 306/319 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3038 variables, 147/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3038 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/3038 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3038/3038 variables, and 466 constraints, problems are : Problem set: 0 solved, 3 unsolved in 8468 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 301/306 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:29] [INFO ] Deduced a trap composed of 135 places in 350 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:49:29] [INFO ] Deduced a trap composed of 139 places in 671 ms of which 74 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2732/3038 variables, 306/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3038 variables, 147/468 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3038 variables, 3/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3038 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/3038 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3038/3038 variables, and 471 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5735 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14244ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 296 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 306/306 places, 7936/7936 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 197 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2025-06-06 02:49:35] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 02:49:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:49:37] [INFO ] Implicit Places using invariants in 2536 ms returned []
[2025-06-06 02:49:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 02:49:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:49:38] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 02:49:47] [INFO ] Implicit Places using invariants and state equation in 10258 ms returned []
Implicit Place search using SMT with State Equation took 12798 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:49:48] [INFO ] Redundant transitions in 932 ms returned []
Running 7934 sub problems to find dead transitions.
[2025-06-06 02:49:48] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 02:49:48] [INFO ] Invariant cache hit.
[2025-06-06 02:49:48] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3038 variables, and 0 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/306 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3038 variables, and 0 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30102 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/306 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74018ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 74041ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87999 ms. Remains : 306/306 places, 7936/7936 transitions.
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Szymanski-PT-b06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 11 stabilizing places and 2304 stable transitions
Graph (complete) has 12425 edges and 306 vertex of which 305 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.37 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G(p1)))))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 7936
Applied a total of 1 rules in 54 ms. Remains 305 /306 variables (removed 1) and now considering 7936/7936 (removed 0) transitions.
[2025-06-06 02:51:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2025-06-06 02:51:03] [INFO ] Computed 1 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:51:03] [INFO ] Implicit Places using invariants in 520 ms returned []
[2025-06-06 02:51:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 02:51:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:51:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 02:51:27] [INFO ] Implicit Places using invariants and state equation in 23713 ms returned []
Implicit Place search using SMT with State Equation took 24234 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2025-06-06 02:51:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 02:51:27] [INFO ] Invariant cache hit.
[2025-06-06 02:51:27] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30105 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30095 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74224ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 74240ms
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/7936 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98546 ms. Remains : 305/306 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 352 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-b06-LTLCardinality-02
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 7 ms.
FORMULA Szymanski-PT-b06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b06-LTLCardinality-02 finished in 98991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X((X(p0) U ((p1&&X(p0))||X(G(p0))))))))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 52 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2025-06-06 02:52:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 306 cols
[2025-06-06 02:52:42] [INFO ] Computed 2 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:52:44] [INFO ] Implicit Places using invariants in 2594 ms returned []
[2025-06-06 02:52:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 02:52:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:52:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 02:52:55] [INFO ] Implicit Places using invariants and state equation in 10520 ms returned []
Implicit Place search using SMT with State Equation took 13117 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2025-06-06 02:52:55] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 02:52:55] [INFO ] Invariant cache hit.
[2025-06-06 02:52:55] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3038 variables, and 0 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30106 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/306 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3038 variables, and 0 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30106 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/306 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74051ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 74065ms
Finished structural reductions in LTL mode , in 1 iterations and 87260 ms. Remains : 306/306 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 304 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : Szymanski-PT-b06-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 240 steps with 30 reset in 4 ms.
FORMULA Szymanski-PT-b06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b06-LTLCardinality-06 finished in 87598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Graph (complete) has 12425 edges and 306 vertex of which 305 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 545 ms. Remains 305 /306 variables (removed 1) and now considering 7936/7936 (removed 0) transitions.
[2025-06-06 02:54:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2025-06-06 02:54:10] [INFO ] Computed 1 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:54:10] [INFO ] Implicit Places using invariants in 434 ms returned []
[2025-06-06 02:54:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 02:54:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:54:11] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 02:54:41] [INFO ] Performed 302/305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-06 02:54:43] [INFO ] Implicit Places using invariants and state equation in 32464 ms returned []
Implicit Place search using SMT with State Equation took 32901 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:54:43] [INFO ] Redundant transitions in 749 ms returned []
Running 7934 sub problems to find dead transitions.
[2025-06-06 02:54:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 02:54:43] [INFO ] Invariant cache hit.
[2025-06-06 02:54:43] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30100 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30094 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74068ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 74081ms
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/7936 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108306 ms. Remains : 305/306 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b06-LTLCardinality-07
Product exploration explored 100000 steps with 4 reset in 478 ms.
Product exploration explored 100000 steps with 7 reset in 550 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 40011 steps (10 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 191399 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 191399 steps, saw 93676 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2025-06-06 02:56:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 02:56:02] [INFO ] Invariant cache hit.
[2025-06-06 02:56:02] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 863 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1596 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2484ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 305 transition count 7808
Applied a total of 128 rules in 210 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7936 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 305/305 places, 7808/7936 transitions.
RANDOM walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 205748 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 1
Probabilistic random walk after 205748 steps, saw 86971 distinct states, run finished after 3002 ms. (steps per millisecond=68 ) properties seen :0
[2025-06-06 02:56:08] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2025-06-06 02:56:08] [INFO ] Computed 3 invariants in 20 ms
[2025-06-06 02:56:08] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2604/2909 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2909 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 455 constraints, problems are : Problem set: 0 solved, 1 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:56:09] [INFO ] Deduced a trap composed of 81 places in 583 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:56:10] [INFO ] Deduced a trap composed of 85 places in 524 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:56:10] [INFO ] Deduced a trap composed of 122 places in 549 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:56:11] [INFO ] Deduced a trap composed of 129 places in 548 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:56:11] [INFO ] Deduced a trap composed of 195 places in 209 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 19/305 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:56:12] [INFO ] Deduced a trap composed of 129 places in 717 ms of which 78 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2604/2909 variables, 305/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2909 variables, 147/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 462 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6349 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7174ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 121 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 183 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 183 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2025-06-06 02:56:15] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 02:56:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:56:17] [INFO ] Implicit Places using invariants in 1810 ms returned []
[2025-06-06 02:56:17] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 02:56:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:56:18] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 02:56:35] [INFO ] Implicit Places using invariants and state equation in 18080 ms returned []
Implicit Place search using SMT with State Equation took 19893 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:56:36] [INFO ] Redundant transitions in 840 ms returned []
Running 7806 sub problems to find dead transitions.
[2025-06-06 02:56:36] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 02:56:36] [INFO ] Invariant cache hit.
[2025-06-06 02:56:36] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:57:36] [INFO ] Deduced a trap composed of 138 places in 495 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:57:37] [INFO ] Deduced a trap composed of 31 places in 489 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:57:38] [INFO ] Deduced a trap composed of 36 places in 459 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:57:38] [INFO ] Deduced a trap composed of 37 places in 484 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:57:39] [INFO ] Deduced a trap composed of 42 places in 444 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:57:39] [INFO ] Deduced a trap composed of 45 places in 488 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:57:40] [INFO ] Deduced a trap composed of 44 places in 363 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:57:40] [INFO ] Deduced a trap composed of 57 places in 325 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:57:41] [INFO ] Deduced a trap composed of 74 places in 357 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:57:41] [INFO ] Deduced a trap composed of 57 places in 329 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:57:41] [INFO ] Deduced a trap composed of 72 places in 443 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:57:42] [INFO ] Deduced a trap composed of 78 places in 520 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:57:43] [INFO ] Deduced a trap composed of 110 places in 430 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:57:43] [INFO ] Deduced a trap composed of 134 places in 296 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:57:43] [INFO ] Deduced a trap composed of 75 places in 479 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:57:44] [INFO ] Deduced a trap composed of 101 places in 416 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:57:45] [INFO ] Deduced a trap composed of 111 places in 463 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:57:45] [INFO ] Deduced a trap composed of 137 places in 308 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:57:46] [INFO ] Deduced a trap composed of 122 places in 421 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:57:46] [INFO ] Deduced a trap composed of 195 places in 270 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 23 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30121 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73696ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 73709ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94650 ms. Remains : 305/305 places, 7808/7808 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 238 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2025-06-06 02:57:50] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2025-06-06 02:57:50] [INFO ] Computed 1 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:57:51] [INFO ] Implicit Places using invariants in 432 ms returned []
[2025-06-06 02:57:51] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 02:57:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:57:52] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 02:58:22] [INFO ] Performed 302/305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-06 02:58:23] [INFO ] Implicit Places using invariants and state equation in 32611 ms returned []
Implicit Place search using SMT with State Equation took 33044 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:58:24] [INFO ] Redundant transitions in 641 ms returned []
Running 7934 sub problems to find dead transitions.
[2025-06-06 02:58:24] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 02:58:24] [INFO ] Invariant cache hit.
[2025-06-06 02:58:24] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30097 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30103 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74384ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 74397ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 108348 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 40003 steps (14 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 190982 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 190982 steps, saw 93666 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2025-06-06 02:59:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 02:59:42] [INFO ] Invariant cache hit.
[2025-06-06 02:59:42] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 910 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1580 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2511ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 305 transition count 7808
Applied a total of 128 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7936 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 305/305 places, 7808/7936 transitions.
RANDOM walk for 40009 steps (8 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 196926 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 1
Probabilistic random walk after 196926 steps, saw 85624 distinct states, run finished after 3002 ms. (steps per millisecond=65 ) properties seen :0
[2025-06-06 02:59:47] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2025-06-06 02:59:47] [INFO ] Computed 3 invariants in 21 ms
[2025-06-06 02:59:47] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2604/2909 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2909 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 455 constraints, problems are : Problem set: 0 solved, 1 unsolved in 768 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:59:49] [INFO ] Deduced a trap composed of 81 places in 567 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:59:49] [INFO ] Deduced a trap composed of 85 places in 529 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:59:50] [INFO ] Deduced a trap composed of 122 places in 496 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:59:50] [INFO ] Deduced a trap composed of 129 places in 491 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:59:51] [INFO ] Deduced a trap composed of 195 places in 207 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 19/305 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:59:51] [INFO ] Deduced a trap composed of 129 places in 715 ms of which 78 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2604/2909 variables, 305/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2909 variables, 147/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 462 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6232 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7047ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 134 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 188 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 178 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2025-06-06 02:59:55] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 02:59:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:59:57] [INFO ] Implicit Places using invariants in 1855 ms returned []
[2025-06-06 02:59:57] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 02:59:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:59:57] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 03:00:15] [INFO ] Implicit Places using invariants and state equation in 18018 ms returned []
Implicit Place search using SMT with State Equation took 19876 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:00:15] [INFO ] Redundant transitions in 628 ms returned []
Running 7806 sub problems to find dead transitions.
[2025-06-06 03:00:15] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 03:00:15] [INFO ] Invariant cache hit.
[2025-06-06 03:00:15] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:16] [INFO ] Deduced a trap composed of 138 places in 466 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:17] [INFO ] Deduced a trap composed of 31 places in 480 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:18] [INFO ] Deduced a trap composed of 36 places in 466 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:18] [INFO ] Deduced a trap composed of 37 places in 488 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:19] [INFO ] Deduced a trap composed of 42 places in 435 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:19] [INFO ] Deduced a trap composed of 45 places in 445 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:20] [INFO ] Deduced a trap composed of 44 places in 328 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:20] [INFO ] Deduced a trap composed of 57 places in 327 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:21] [INFO ] Deduced a trap composed of 74 places in 347 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:21] [INFO ] Deduced a trap composed of 57 places in 339 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:21] [INFO ] Deduced a trap composed of 72 places in 419 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:22] [INFO ] Deduced a trap composed of 78 places in 575 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:23] [INFO ] Deduced a trap composed of 110 places in 512 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:23] [INFO ] Deduced a trap composed of 134 places in 288 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:23] [INFO ] Deduced a trap composed of 75 places in 457 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:24] [INFO ] Deduced a trap composed of 101 places in 436 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:25] [INFO ] Deduced a trap composed of 111 places in 440 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:25] [INFO ] Deduced a trap composed of 137 places in 287 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:26] [INFO ] Deduced a trap composed of 122 places in 451 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:01:26] [INFO ] Deduced a trap composed of 195 places in 300 ms of which 7 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 23 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73405ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 73419ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94126 ms. Remains : 305/305 places, 7808/7808 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 469 ms.
Product exploration explored 100000 steps with 14 reset in 410 ms.
Built C files in :
/tmp/ltsmin16069638376522337782
[2025-06-06 03:01:30] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2025-06-06 03:01:30] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16069638376522337782
Running compilation step : cd /tmp/ltsmin16069638376522337782;'/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/ltsmin16069638376522337782;'/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/ltsmin16069638376522337782;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 181 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2025-06-06 03:01:33] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2025-06-06 03:01:33] [INFO ] Computed 1 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:01:34] [INFO ] Implicit Places using invariants in 435 ms returned []
[2025-06-06 03:01:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 03:01:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:01:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 03:02:05] [INFO ] Performed 302/305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-06 03:02:06] [INFO ] Implicit Places using invariants and state equation in 32697 ms returned []
Implicit Place search using SMT with State Equation took 33138 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:02:07] [INFO ] Redundant transitions in 636 ms returned []
Running 7934 sub problems to find dead transitions.
[2025-06-06 03:02:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 03:02:07] [INFO ] Invariant cache hit.
[2025-06-06 03:02:07] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30113 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30102 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73574ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 73584ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 107558 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin17836937583327996971
[2025-06-06 03:03:21] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2025-06-06 03:03:21] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17836937583327996971
Running compilation step : cd /tmp/ltsmin17836937583327996971;'/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/ltsmin17836937583327996971;'/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/ltsmin17836937583327996971;'/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-06 03:03:24] [INFO ] Flatten gal took : 197 ms
[2025-06-06 03:03:24] [INFO ] Flatten gal took : 195 ms
[2025-06-06 03:03:24] [INFO ] Time to serialize gal into /tmp/LTL3100243809620755463.gal : 53 ms
[2025-06-06 03:03:25] [INFO ] Time to serialize properties into /tmp/LTL5894031919120896933.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/LTL3100243809620755463.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5875617024754490464.hoa' '-atoms' '/tmp/LTL5894031919120896933.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...317
Loading property file /tmp/LTL5894031919120896933.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5875617024754490464.hoa
Detected timeout of ITS tools.
[2025-06-06 03:03:40] [INFO ] Flatten gal took : 181 ms
[2025-06-06 03:03:40] [INFO ] Flatten gal took : 189 ms
[2025-06-06 03:03:40] [INFO ] Time to serialize gal into /tmp/LTL9429892474243297239.gal : 29 ms
[2025-06-06 03:03:40] [INFO ] Time to serialize properties into /tmp/LTL3408076316071486052.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9429892474243297239.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3408076316071486052.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("(p137<=l33)"))))
Formula 0 simplified : GF!"(p137<=l33)"
Detected timeout of ITS tools.
[2025-06-06 03:03:55] [INFO ] Flatten gal took : 174 ms
[2025-06-06 03:03:55] [INFO ] Applying decomposition
[2025-06-06 03:03:56] [INFO ] Flatten gal took : 181 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/graph10325517860193532317.txt' '-o' '/tmp/graph10325517860193532317.bin' '-w' '/tmp/graph10325517860193532317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10325517860193532317.bin' '-l' '-1' '-v' '-w' '/tmp/graph10325517860193532317.weights' '-q' '0' '-e' '0.001'
[2025-06-06 03:03:56] [INFO ] Decomposing Gal with order
[2025-06-06 03:03:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 03:03:57] [INFO ] Removed a total of 14379 redundant transitions.
[2025-06-06 03:03:58] [INFO ] Flatten gal took : 1418 ms
[2025-06-06 03:03:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 2054 labels/synchronizations in 311 ms.
[2025-06-06 03:03:58] [INFO ] Time to serialize gal into /tmp/LTL1337529551403193313.gal : 29 ms
[2025-06-06 03:03:58] [INFO ] Time to serialize properties into /tmp/LTL13985951465280289630.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/LTL1337529551403193313.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13985951465280289630.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("(gu8.p137<=gu8.l33)"))))
Formula 0 simplified : GF!"(gu8.p137<=gu8.l33)"
Detected timeout of ITS tools.
Treatment of property Szymanski-PT-b06-LTLCardinality-07 finished in 604338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X(G(p1))))))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 7936
Applied a total of 1 rules in 35 ms. Remains 305 /306 variables (removed 1) and now considering 7936/7936 (removed 0) transitions.
[2025-06-06 03:04:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 03:04:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:04:14] [INFO ] Implicit Places using invariants in 428 ms returned []
[2025-06-06 03:04:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 03:04:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:04:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 03:04:41] [INFO ] Implicit Places using invariants and state equation in 26790 ms returned []
Implicit Place search using SMT with State Equation took 27236 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2025-06-06 03:04:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 03:04:41] [INFO ] Invariant cache hit.
[2025-06-06 03:04:41] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30102 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 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 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30098 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73854ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 73865ms
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/7936 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101156 ms. Remains : 305/306 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Szymanski-PT-b06-LTLCardinality-14
Product exploration explored 100000 steps with 1 reset in 498 ms.
Product exploration explored 100000 steps with 25 reset in 488 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 90 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40006 steps (15 resets) in 165 ms. (241 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (13 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (16 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (13 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
[2025-06-06 03:05:56] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 03:05:56] [INFO ] Invariant cache hit.
[2025-06-06 03:05:56] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1001 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2673 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3694ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 305/305 places, 7809/7936 transitions.
RANDOM walk for 40006 steps (8 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 174073 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 2
Probabilistic random walk after 174073 steps, saw 82617 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2025-06-06 03:06:03] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2025-06-06 03:06:03] [INFO ] Computed 2 invariants in 22 ms
[2025-06-06 03:06:03] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2605/2910 variables, 305/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2910 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2910/2910 variables, and 454 constraints, problems are : Problem set: 0 solved, 2 unsolved in 714 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:06:04] [INFO ] Deduced a trap composed of 31 places in 495 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2605/2910 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2910 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:06:07] [INFO ] Deduced a trap composed of 45 places in 510 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:06:07] [INFO ] Deduced a trap composed of 74 places in 434 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:06:08] [INFO ] Deduced a trap composed of 72 places in 504 ms of which 25 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2910 variables, 3/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2910 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2910 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2910/2910 variables, and 460 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4987 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5748ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 4890 steps, including 487 resets, run visited all 2 properties in 158 ms. (steps per millisecond=30 )
Parikh walk visited 2 properties in 162 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (AND p0 p1))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 295 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 25 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), false, (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 281 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), false, (AND p0 (NOT p1)), false]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 177 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2025-06-06 03:06:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2025-06-06 03:06:10] [INFO ] Computed 1 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:06:11] [INFO ] Implicit Places using invariants in 453 ms returned []
[2025-06-06 03:06:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 03:06:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:06:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 03:06:38] [INFO ] Implicit Places using invariants and state equation in 27586 ms returned []
Implicit Place search using SMT with State Equation took 28042 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:06:39] [INFO ] Redundant transitions in 635 ms returned []
Running 7934 sub problems to find dead transitions.
[2025-06-06 03:06:39] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 03:06:39] [INFO ] Invariant cache hit.
[2025-06-06 03:06:39] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30099 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30106 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74100ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 74114ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 103003 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 134 ms. Reduced automaton from 7 states, 25 edges and 2 AP (stutter insensitive) to 9 states, 32 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 345 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
RANDOM walk for 40009 steps (13 resets) in 266 ms. (149 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (14 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (14 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (13 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
[2025-06-06 03:07:54] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 03:07:54] [INFO ] Invariant cache hit.
[2025-06-06 03:07:54] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 0 solved, 3 unsolved in 980 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 2/455 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3037 variables, 0/455 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3037 variables, 0/455 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3037/3037 variables, and 455 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2238 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3238ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 305/305 places, 7809/7936 transitions.
RANDOM walk for 40006 steps (8 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 175390 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 2
Probabilistic random walk after 175390 steps, saw 82820 distinct states, run finished after 3002 ms. (steps per millisecond=58 ) properties seen :0
[2025-06-06 03:08:00] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2025-06-06 03:08:00] [INFO ] Computed 2 invariants in 17 ms
[2025-06-06 03:08:00] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2605/2910 variables, 305/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2910 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2910/2910 variables, and 454 constraints, problems are : Problem set: 0 solved, 2 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:08:02] [INFO ] Deduced a trap composed of 31 places in 469 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2605/2910 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2910 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:08:04] [INFO ] Deduced a trap composed of 45 places in 523 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:08:04] [INFO ] Deduced a trap composed of 74 places in 442 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:08:05] [INFO ] Deduced a trap composed of 72 places in 460 ms of which 25 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2910 variables, 3/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2910 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2910 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2910/2910 variables, and 460 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4655 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5477ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 4707 steps, including 452 resets, run visited all 2 properties in 156 ms. (steps per millisecond=30 )
Parikh walk visited 2 properties in 157 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 354 ms. Reduced automaton from 9 states, 32 edges and 2 AP (stutter insensitive) to 9 states, 32 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 356 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 383 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 338 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
Product exploration explored 100000 steps with 0 reset in 439 ms.
Product exploration explored 100000 steps with 8 reset in 448 ms.
Built C files in :
/tmp/ltsmin134329909726840515
[2025-06-06 03:08:08] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2025-06-06 03:08:08] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin134329909726840515
Running compilation step : cd /tmp/ltsmin134329909726840515;'/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/ltsmin134329909726840515;'/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/ltsmin134329909726840515;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 175 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2025-06-06 03:08:12] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2025-06-06 03:08:12] [INFO ] Computed 1 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:08:12] [INFO ] Implicit Places using invariants in 435 ms returned []
[2025-06-06 03:08:12] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 03:08:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:08:13] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 03:08:39] [INFO ] Implicit Places using invariants and state equation in 27550 ms returned []
Implicit Place search using SMT with State Equation took 27990 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:08:40] [INFO ] Redundant transitions in 638 ms returned []
Running 7934 sub problems to find dead transitions.
[2025-06-06 03:08:40] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 03:08:40] [INFO ] Invariant cache hit.
[2025-06-06 03:08:40] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30097 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 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 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30102 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74339ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 74349ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 103176 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin10643370538025807639
[2025-06-06 03:09:55] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2025-06-06 03:09:55] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10643370538025807639
Running compilation step : cd /tmp/ltsmin10643370538025807639;'/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/ltsmin10643370538025807639;'/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/ltsmin10643370538025807639;'/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-06 03:09:58] [INFO ] Flatten gal took : 375 ms
[2025-06-06 03:09:58] [INFO ] Flatten gal took : 290 ms
[2025-06-06 03:09:58] [INFO ] Time to serialize gal into /tmp/LTL4513686445811425760.gal : 35 ms
[2025-06-06 03:09:58] [INFO ] Time to serialize properties into /tmp/LTL4427503377392597004.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/LTL4513686445811425760.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12331273112824269921.hoa' '-atoms' '/tmp/LTL4427503377392597004.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/LTL4427503377392597004.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12331273112824269921.hoa
Detected timeout of ITS tools.
[2025-06-06 03:10:14] [INFO ] Flatten gal took : 205 ms
[2025-06-06 03:10:14] [INFO ] Flatten gal took : 211 ms
[2025-06-06 03:10:14] [INFO ] Time to serialize gal into /tmp/LTL17599066242891694035.gal : 29 ms
[2025-06-06 03:10:14] [INFO ] Time to serialize properties into /tmp/LTL5101583377845782858.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/LTL17599066242891694035.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5101583377845782858.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(("(p138<=0)")&&(X(X(G("(p56<=0)")))))))
Formula 0 simplified : G(!"(p138<=0)" | XXF!"(p56<=0)")
Detected timeout of ITS tools.
[2025-06-06 03:10:29] [INFO ] Flatten gal took : 196 ms
[2025-06-06 03:10:29] [INFO ] Applying decomposition
[2025-06-06 03:10:30] [INFO ] Flatten gal took : 207 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/graph16280910878398100299.txt' '-o' '/tmp/graph16280910878398100299.bin' '-w' '/tmp/graph16280910878398100299.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16280910878398100299.bin' '-l' '-1' '-v' '-w' '/tmp/graph16280910878398100299.weights' '-q' '0' '-e' '0.001'
[2025-06-06 03:10:30] [INFO ] Decomposing Gal with order
[2025-06-06 03:10:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 03:10:30] [INFO ] Removed a total of 18062 redundant transitions.
[2025-06-06 03:10:30] [INFO ] Flatten gal took : 375 ms
[2025-06-06 03:10:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 917 labels/synchronizations in 161 ms.
[2025-06-06 03:10:31] [INFO ] Time to serialize gal into /tmp/LTL9885444182113419222.gal : 35 ms
[2025-06-06 03:10:31] [INFO ] Time to serialize properties into /tmp/LTL7014609025072803129.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/LTL9885444182113419222.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7014609025072803129.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(("(i4.u48.p138<=0)")&&(X(X(G("(i4.u18.p56<=0)")))))))
Formula 0 simplified : G(!"(i4.u48.p138<=0)" | XXF!"(i4.u18.p56<=0)")
Detected timeout of ITS tools.
Treatment of property Szymanski-PT-b06-LTLCardinality-14 finished in 392357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X(G(p1))))))'
Found a Lengthening insensitive property : Szymanski-PT-b06-LTLCardinality-14
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Graph (complete) has 12425 edges and 306 vertex of which 305 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 55 ms. Remains 305 /306 variables (removed 1) and now considering 7936/7936 (removed 0) transitions.
[2025-06-06 03:10:46] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 03:10:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:10:47] [INFO ] Implicit Places using invariants in 409 ms returned []
[2025-06-06 03:10:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 03:10:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:10:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 03:11:14] [INFO ] Implicit Places using invariants and state equation in 27720 ms returned []
Implicit Place search using SMT with State Equation took 28136 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2025-06-06 03:11:15] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 03:11:15] [INFO ] Invariant cache hit.
[2025-06-06 03:11:15] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30097 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30108 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74604ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 74615ms
Starting structural reductions in LI_LTL mode, iteration 1 : 305/306 places, 7936/7936 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 102819 ms. Remains : 305/306 places, 7936/7936 transitions.
Running random walk in product with property : Szymanski-PT-b06-LTLCardinality-14
Product exploration explored 100000 steps with 2 reset in 397 ms.
Product exploration explored 100000 steps with 12 reset in 526 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 94 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40007 steps (9 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (13 resets) in 77 ms. (512 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (14 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (11 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
[2025-06-06 03:12:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 03:12:31] [INFO ] Invariant cache hit.
[2025-06-06 03:12:31] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 0 solved, 3 unsolved in 988 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 2/455 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3037 variables, 0/455 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3037 variables, 0/455 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3037/3037 variables, and 455 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2041 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3050ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 176 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 188 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 305/305 places, 7809/7936 transitions.
RANDOM walk for 40013 steps (8 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 171991 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 2
Probabilistic random walk after 171991 steps, saw 82435 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2025-06-06 03:12:37] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2025-06-06 03:12:37] [INFO ] Computed 2 invariants in 16 ms
[2025-06-06 03:12:37] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2605/2910 variables, 305/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2910 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2910/2910 variables, and 454 constraints, problems are : Problem set: 0 solved, 2 unsolved in 733 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:12:38] [INFO ] Deduced a trap composed of 31 places in 473 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2605/2910 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2910 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:12:41] [INFO ] Deduced a trap composed of 45 places in 517 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:12:41] [INFO ] Deduced a trap composed of 74 places in 409 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:12:42] [INFO ] Deduced a trap composed of 72 places in 461 ms of which 25 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2910 variables, 3/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2910 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2910 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2910/2910 variables, and 460 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4664 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5444ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 4766 steps, including 466 resets, run visited all 2 properties in 151 ms. (steps per millisecond=31 )
Parikh walk visited 2 properties in 154 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (AND p0 p1))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 292 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 25 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), false, (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 271 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), false, (AND p0 (NOT p1)), false]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 176 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2025-06-06 03:12:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2025-06-06 03:12:44] [INFO ] Computed 1 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:12:44] [INFO ] Implicit Places using invariants in 431 ms returned []
[2025-06-06 03:12:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 03:12:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:12:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 03:13:12] [INFO ] Implicit Places using invariants and state equation in 27595 ms returned []
Implicit Place search using SMT with State Equation took 28031 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:13:12] [INFO ] Redundant transitions in 651 ms returned []
Running 7934 sub problems to find dead transitions.
[2025-06-06 03:13:12] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 03:13:12] [INFO ] Invariant cache hit.
[2025-06-06 03:13:12] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30100 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30096 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 74161ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 74171ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 103054 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 120 ms. Reduced automaton from 7 states, 25 edges and 2 AP (stutter insensitive) to 9 states, 32 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 292 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
RANDOM walk for 40009 steps (9 resets) in 167 ms. (238 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (13 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (14 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
[2025-06-06 03:14:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 03:14:27] [INFO ] Invariant cache hit.
[2025-06-06 03:14:27] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1026 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 2/455 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3037 variables, 0/455 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3037 variables, 0/455 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3037/3037 variables, and 455 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1833 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2901ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 305/305 places, 7809/7936 transitions.
RANDOM walk for 40005 steps (8 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 175529 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 2
Probabilistic random walk after 175529 steps, saw 82839 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2025-06-06 03:14:33] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2025-06-06 03:14:33] [INFO ] Computed 2 invariants in 16 ms
[2025-06-06 03:14:33] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2605/2910 variables, 305/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2910 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2910/2910 variables, and 454 constraints, problems are : Problem set: 0 solved, 2 unsolved in 739 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:14:35] [INFO ] Deduced a trap composed of 31 places in 505 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2605/2910 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2910 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:14:37] [INFO ] Deduced a trap composed of 45 places in 512 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:14:37] [INFO ] Deduced a trap composed of 74 places in 426 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:14:38] [INFO ] Deduced a trap composed of 72 places in 543 ms of which 27 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2910 variables, 3/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2910 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2910 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2910/2910 variables, and 460 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4812 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5594ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 4642 steps, including 442 resets, run visited all 2 properties in 157 ms. (steps per millisecond=29 )
Parikh walk visited 2 properties in 158 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (AND p0 p1))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 372 ms. Reduced automaton from 9 states, 32 edges and 2 AP (stutter insensitive) to 9 states, 32 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 376 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 395 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 395 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
Product exploration explored 100000 steps with 1 reset in 412 ms.
Product exploration explored 100000 steps with 2 reset in 401 ms.
Built C files in :
/tmp/ltsmin13898946042309301139
[2025-06-06 03:14:42] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2025-06-06 03:14:42] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13898946042309301139
Running compilation step : cd /tmp/ltsmin13898946042309301139;'/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/ltsmin13898946042309301139;'/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/ltsmin13898946042309301139;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 179 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2025-06-06 03:14:45] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2025-06-06 03:14:45] [INFO ] Computed 1 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:14:45] [INFO ] Implicit Places using invariants in 457 ms returned []
[2025-06-06 03:14:45] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 03:14:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:14:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 03:15:12] [INFO ] Implicit Places using invariants and state equation in 26945 ms returned []
Implicit Place search using SMT with State Equation took 27404 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:15:13] [INFO ] Redundant transitions in 645 ms returned []
Running 7934 sub problems to find dead transitions.
[2025-06-06 03:15:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2025-06-06 03:15:13] [INFO ] Invariant cache hit.
[2025-06-06 03:15:13] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30096 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30094 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 73778ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 73788ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 102032 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin7515558825554429242
[2025-06-06 03:16:27] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2025-06-06 03:16:27] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7515558825554429242
Running compilation step : cd /tmp/ltsmin7515558825554429242;'/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/ltsmin7515558825554429242;'/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/ltsmin7515558825554429242;'/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-06 03:16:30] [INFO ] Flatten gal took : 176 ms
[2025-06-06 03:16:30] [INFO ] Flatten gal took : 179 ms
[2025-06-06 03:16:30] [INFO ] Time to serialize gal into /tmp/LTL6000001525362580927.gal : 25 ms
[2025-06-06 03:16:30] [INFO ] Time to serialize properties into /tmp/LTL13522387185856431663.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/LTL6000001525362580927.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5944008614014338427.hoa' '-atoms' '/tmp/LTL13522387185856431663.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/LTL13522387185856431663.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5944008614014338427.hoa
Detected timeout of ITS tools.
[2025-06-06 03:16:46] [INFO ] Flatten gal took : 176 ms
[2025-06-06 03:16:46] [INFO ] Flatten gal took : 181 ms
[2025-06-06 03:16:46] [INFO ] Time to serialize gal into /tmp/LTL4160692733288661914.gal : 26 ms
[2025-06-06 03:16:46] [INFO ] Time to serialize properties into /tmp/LTL12319008743849288014.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/LTL4160692733288661914.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12319008743849288014.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(("(p138<=0)")&&(X(X(G("(p56<=0)")))))))
Formula 0 simplified : G(!"(p138<=0)" | XXF!"(p56<=0)")
Detected timeout of ITS tools.
[2025-06-06 03:17:01] [INFO ] Flatten gal took : 173 ms
[2025-06-06 03:17:01] [INFO ] Applying decomposition
[2025-06-06 03:17:01] [INFO ] Flatten gal took : 183 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/graph1192772102462736958.txt' '-o' '/tmp/graph1192772102462736958.bin' '-w' '/tmp/graph1192772102462736958.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1192772102462736958.bin' '-l' '-1' '-v' '-w' '/tmp/graph1192772102462736958.weights' '-q' '0' '-e' '0.001'
[2025-06-06 03:17:01] [INFO ] Decomposing Gal with order
[2025-06-06 03:17:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 03:17:02] [INFO ] Removed a total of 18365 redundant transitions.
[2025-06-06 03:17:02] [INFO ] Flatten gal took : 326 ms
[2025-06-06 03:17:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 1201 labels/synchronizations in 146 ms.
[2025-06-06 03:17:02] [INFO ] Time to serialize gal into /tmp/LTL14539817997019323305.gal : 24 ms
[2025-06-06 03:17:02] [INFO ] Time to serialize properties into /tmp/LTL7527745027679440949.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/LTL14539817997019323305.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7527745027679440949.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(("(i3.i1.u56.p138<=0)")&&(X(X(G("(i7.i0.u18.p56<=0)")))))))
Formula 0 simplified : G(!"(i3.i1.u56.p138<=0)" | XXF!"(i7.i0.u18.p56<=0)")
Detected timeout of ITS tools.
Treatment of property Szymanski-PT-b06-LTLCardinality-14 finished in 391172 ms.
[2025-06-06 03:17:17] [INFO ] Flatten gal took : 174 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10760019553174689
[2025-06-06 03:17:17] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2025-06-06 03:17:18] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10760019553174689
Running compilation step : cd /tmp/ltsmin10760019553174689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-06 03:17:18] [INFO ] Applying decomposition
[2025-06-06 03:17:18] [INFO ] Flatten gal took : 181 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/graph17898995122110152697.txt' '-o' '/tmp/graph17898995122110152697.bin' '-w' '/tmp/graph17898995122110152697.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17898995122110152697.bin' '-l' '-1' '-v' '-w' '/tmp/graph17898995122110152697.weights' '-q' '0' '-e' '0.001'
[2025-06-06 03:17:18] [INFO ] Decomposing Gal with order
[2025-06-06 03:17:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 03:17:18] [INFO ] Removed a total of 17902 redundant transitions.
[2025-06-06 03:17:18] [INFO ] Flatten gal took : 340 ms
[2025-06-06 03:17:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 1226 labels/synchronizations in 123 ms.
[2025-06-06 03:17:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality17897362105222956696.gal : 24 ms
[2025-06-06 03:17:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality13353491596009345735.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/LTLCardinality17897362105222956696.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13353491596009345735.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...299
Read 2 LTL properties
Checking formula 0 : !((F(G("(gu44.p137<=gu44.l33)"))))
Formula 0 simplified : GF!"(gu44.p137<=gu44.l33)"
Compilation finished in 31284 ms.
Running link step : cd /tmp/ltsmin10760019553174689;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 96 ms.
Running LTSmin : cd /tmp/ltsmin10760019553174689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10760019553174689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10760019553174689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp1==true)&&X(X([]((LTLAPp2==true))))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2025-06-06 03:42:34] [INFO ] Flatten gal took : 253 ms
[2025-06-06 03:42:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality13398270127952704187.gal : 52 ms
[2025-06-06 03:42:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality11080632228953700774.ltl : 10 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/LTLCardinality13398270127952704187.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11080632228953700774.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...299
Read 2 LTL properties
Checking formula 0 : !((F(G("(p137<=l33)"))))
Formula 0 simplified : GF!"(p137<=l33)"
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="Szymanski-PT-b06"
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 Szymanski-PT-b06, 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 r240-tall-174915589300147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b06.tgz
mv Szymanski-PT-b06 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 ;