fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r156-tall-174881253700275
Last Updated
June 24, 2025

About the Execution of ITS-Tools for PolyORBLF-COL-S02J04T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 1081507.00 0.00 0.00 TFTTFTFFFTTTFFFF normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253700275.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is PolyORBLF-COL-S02J04T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253700275
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 154K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J04T08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748907973266

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-02 23:46:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 23:46:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 23:46:14] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 23:46:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 23:46:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 608 ms
[2025-06-02 23:46:15] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 614 PT places and 1300.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2025-06-02 23:46:15] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2025-06-02 23:46:15] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40001 steps (17 resets) in 1314 ms. (30 steps per ms) remains 14/32 properties
BEST_FIRST walk for 40000 steps (14 resets) in 527 ms. (75 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (11 resets) in 229 ms. (173 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (66 resets) in 250 ms. (159 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 167 ms. (238 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (10 resets) in 239 ms. (166 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (9 resets) in 165 ms. (240 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (12 resets) in 230 ms. (173 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 131 ms. (303 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (12 resets) in 174 ms. (228 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (21 resets) in 261 ms. (152 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (12 resets) in 102 ms. (388 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (11 resets) in 104 ms. (380 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (10 resets) in 93 ms. (425 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (10 resets) in 104 ms. (380 steps per ms) remains 14/14 properties
[2025-06-02 23:46:16] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-02 23:46:16] [INFO ] Computed 26 invariants in 13 ms
[2025-06-02 23:46:16] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 36/52 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 5 (OVERLAPS) 21/75 variables, 12/22 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/22 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 5/80 variables, 3/25 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/25 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/81 variables, 1/26 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 9 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 9 solved, 5 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 36/43 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 8/51 variables, 5/8 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/9 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 21/73 variables, 12/21 constraints. Problems are: Problem set: 9 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:17] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 9 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 9 solved, 5 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 5/118 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 0/118 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/145 variables, 2/120 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/145 variables, 1/121 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/145 variables, 0/121 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/145 variables, 0/121 constraints. Problems are: Problem set: 10 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 121 constraints, problems are : Problem set: 10 solved, 4 unsolved in 839 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 5/14 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1449ms problems are : Problem set: 10 solved, 4 unsolved
Parikh walk visited 0 properties in 2806 ms.
Support contains 7 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 80 transition count 59
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 74 transition count 57
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 17 place count 72 transition count 55
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 21 place count 70 transition count 55
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 35 place count 63 transition count 48
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 63 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 62 transition count 47
Applied a total of 37 rules in 31 ms. Remains 62 /81 variables (removed 19) and now considering 47/65 (removed 18) transitions.
Running 46 sub problems to find dead transitions.
[2025-06-02 23:46:20] [INFO ] Flow matrix only has 46 transitions (discarded 1 similar events)
// Phase 1: matrix 46 rows 62 cols
[2025-06-02 23:46:20] [INFO ] Computed 25 invariants in 2 ms
[2025-06-02 23:46:20] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:21] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/62 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:21] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:21] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:21] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:21] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:21] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 5/31 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 46/108 variables, 62/93 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 8/101 constraints. Problems are: Problem set: 2 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:22] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:22] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:22] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 3/104 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 0/104 constraints. Problems are: Problem set: 2 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:22] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/108 variables, 1/105 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/108 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 13 (OVERLAPS) 0/108 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 105 constraints, problems are : Problem set: 2 solved, 44 unsolved in 2213 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 62/62 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 44 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 8/32 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 1/62 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 2/35 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 46/108 variables, 62/97 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 8/105 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 44/149 constraints. Problems are: Problem set: 2 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:23] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 1/150 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/108 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 0/108 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 150 constraints, problems are : Problem set: 2 solved, 44 unsolved in 2370 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 62/62 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/46 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4604ms problems are : Problem set: 2 solved, 44 unsolved
Search for dead transitions found 2 dead transitions in 4608ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/81 places, 45/65 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 43
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 60 transition count 41
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 9 ms. Remains 60 /62 variables (removed 2) and now considering 41/45 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4660 ms. Remains : 60/81 places, 41/65 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
RANDOM walk for 40000 steps (26 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (14 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (15 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
Probably explored full state space saw : 102342 states, properties seen :0
Probabilistic random walk after 343722 steps, saw 102342 distinct states, run finished after 956 ms. (steps per millisecond=359 ) properties seen :0
Explored full state space saw : 102342 states, properties seen :0
Exhaustive walk after 343722 steps, saw 102342 distinct states, run finished after 937 ms. (steps per millisecond=366 ) properties seen :0
Successfully simplified 14 atomic propositions for a total of 13 simplifications.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 23:46:27] [INFO ] Initial state reduction rules for LTL removed 6 formulas.
[2025-06-02 23:46:27] [INFO ] Flatten gal took : 27 ms
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 23:46:27] [INFO ] Flatten gal took : 9 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-02 23:46:27] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 29 ms.
[2025-06-02 23:46:27] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 96 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 612 transition count 1114
Applied a total of 2 rules in 37 ms. Remains 612 /614 variables (removed 2) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2025-06-02 23:46:27] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 612 cols
[2025-06-02 23:46:27] [INFO ] Computed 48 invariants in 41 ms
[2025-06-02 23:46:27] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:40] [INFO ] Deduced a trap composed of 65 places in 148 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:40] [INFO ] Deduced a trap composed of 65 places in 137 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:40] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:40] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:40] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:40] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:40] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:41] [INFO ] Deduced a trap composed of 175 places in 344 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:43] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1710 variables, and 55 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20048 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:51] [INFO ] Deduced a trap composed of 266 places in 360 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:46:59] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:03] [INFO ] Deduced a trap composed of 295 places in 332 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:04] [INFO ] Deduced a trap composed of 47 places in 303 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:05] [INFO ] Deduced a trap composed of 311 places in 330 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:07] [INFO ] Deduced a trap composed of 338 places in 334 ms of which 99 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1710 variables, and 61 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40888ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 40894ms
[2025-06-02 23:47:08] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2025-06-02 23:47:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:47:09] [INFO ] Implicit Places using invariants in 619 ms returned [470, 471, 472, 473, 474, 475, 476, 477]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 625 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 604/614 places, 1114/1114 transitions.
Applied a total of 0 rules in 17 ms. Remains 604 /604 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41582 ms. Remains : 604/614 places, 1114/1114 transitions.
Support contains 96 out of 604 places after structural reductions.
[2025-06-02 23:47:09] [INFO ] Flatten gal took : 85 ms
[2025-06-02 23:47:09] [INFO ] Flatten gal took : 71 ms
[2025-06-02 23:47:09] [INFO ] Input system was already deterministic with 1114 transitions.
RANDOM walk for 40000 steps (13 resets) in 263 ms. (151 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40002 steps (12 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (12 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
[2025-06-02 23:47:09] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 604 cols
[2025-06-02 23:47:09] [INFO ] Computed 40 invariants in 27 ms
[2025-06-02 23:47:09] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 465/474 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 59/533 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/534 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/598 variables, 26/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/604 variables, 6/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/604 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1098/1702 variables, 604/644 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1702 variables, 96/740 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1702 variables, 0/740 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1702 variables, 0/740 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1702/1702 variables, and 740 constraints, problems are : Problem set: 1 solved, 1 unsolved in 995 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 604/604 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 464/472 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/531 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/532 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/596 variables, 26/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:11] [INFO ] Deduced a trap composed of 66 places in 296 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:11] [INFO ] Deduced a trap composed of 66 places in 301 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:12] [INFO ] Deduced a trap composed of 66 places in 294 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:12] [INFO ] Deduced a trap composed of 66 places in 283 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:12] [INFO ] Deduced a trap composed of 66 places in 281 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:13] [INFO ] Deduced a trap composed of 293 places in 336 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:13] [INFO ] Deduced a trap composed of 277 places in 364 ms of which 130 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/596 variables, 7/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/596 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/602 variables, 6/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/602 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1098/1700 variables, 602/648 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1700/1702 variables, and 744 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3978 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 602/604 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5022ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 604/604 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 604 transition count 1058
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 120 place count 548 transition count 1050
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 540 transition count 1050
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 128 place count 540 transition count 986
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 256 place count 476 transition count 986
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 264 place count 468 transition count 978
Iterating global reduction 3 with 8 rules applied. Total rules applied 272 place count 468 transition count 978
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 400 place count 404 transition count 914
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 416 place count 404 transition count 898
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 432 place count 388 transition count 898
Applied a total of 432 rules in 160 ms. Remains 388 /604 variables (removed 216) and now considering 898/1114 (removed 216) transitions.
Running 896 sub problems to find dead transitions.
[2025-06-02 23:47:15] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
// Phase 1: matrix 882 rows 388 cols
[2025-06-02 23:47:15] [INFO ] Computed 40 invariants in 21 ms
[2025-06-02 23:47:15] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:24] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:24] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:24] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:24] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:24] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:24] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:25] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:25] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:25] [INFO ] Deduced a trap composed of 133 places in 243 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:25] [INFO ] Deduced a trap composed of 140 places in 238 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:25] [INFO ] Deduced a trap composed of 125 places in 217 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:47:26] [INFO ] Deduced a trap composed of 19 places in 207 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/1270 variables, and 50 constraints, problems are : Problem set: 0 solved, 896 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/388 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 896/896 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 896 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/1270 variables, and 50 constraints, problems are : Problem set: 0 solved, 896 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/388 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/896 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40737ms problems are : Problem set: 0 solved, 896 unsolved
Search for dead transitions found 0 dead transitions in 40739ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40905 ms. Remains : 388/604 places, 898/1114 transitions.
RANDOM walk for 40000 steps (15 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (12 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 386280 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 1
Probabilistic random walk after 386280 steps, saw 204277 distinct states, run finished after 3005 ms. (steps per millisecond=128 ) properties seen :0
[2025-06-02 23:47:58] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
[2025-06-02 23:47:58] [INFO ] Invariant cache hit.
[2025-06-02 23:47:58] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 264/272 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 49/321 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/331 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/384 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/386 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 882/1268 variables, 386/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1268 variables, 96/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1268 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1270 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1270 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1270 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1270 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1270/1270 variables, and 524 constraints, problems are : Problem set: 0 solved, 1 unsolved in 838 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 388/388 constraints, ReadFeed: 96/96 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 264/272 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/321 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/331 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/384 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:00] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:00] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:00] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:00] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/386 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 882/1268 variables, 386/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1268 variables, 96/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1268 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1268 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1270 variables, 2/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1270 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:01] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 17 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1270 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1270 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1270 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1270/1270 variables, and 530 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 388/388 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2870ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 130 ms.
Support contains 8 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 898/898 transitions.
Applied a total of 0 rules in 23 ms. Remains 388 /388 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 388/388 places, 898/898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 898/898 transitions.
Applied a total of 0 rules in 18 ms. Remains 388 /388 variables (removed 0) and now considering 898/898 (removed 0) transitions.
[2025-06-02 23:48:01] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
[2025-06-02 23:48:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:48:03] [INFO ] Implicit Places using invariants in 1304 ms returned []
[2025-06-02 23:48:03] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
[2025-06-02 23:48:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:48:03] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 23:48:08] [INFO ] Implicit Places using invariants and state equation in 5452 ms returned []
Implicit Place search using SMT with State Equation took 6759 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:48:08] [INFO ] Redundant transitions in 48 ms returned []
Running 896 sub problems to find dead transitions.
[2025-06-02 23:48:08] [INFO ] Flow matrix only has 882 transitions (discarded 16 similar events)
[2025-06-02 23:48:08] [INFO ] Invariant cache hit.
[2025-06-02 23:48:08] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:18] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:18] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:18] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:19] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:19] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:19] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:19] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:19] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:19] [INFO ] Deduced a trap composed of 133 places in 218 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:20] [INFO ] Deduced a trap composed of 140 places in 241 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:20] [INFO ] Deduced a trap composed of 125 places in 233 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:20] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:27] [INFO ] Deduced a trap composed of 134 places in 202 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:27] [INFO ] Deduced a trap composed of 106 places in 206 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:33] [INFO ] Deduced a trap composed of 226 places in 245 ms of which 75 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/1270 variables, and 53 constraints, problems are : Problem set: 0 solved, 896 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/388 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 896/896 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 896 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 896 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 15/53 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:48:53] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 896 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/1270 variables, and 54 constraints, problems are : Problem set: 0 solved, 896 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/388 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/896 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60681ms problems are : Problem set: 0 solved, 896 unsolved
Search for dead transitions found 0 dead transitions in 60684ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67524 ms. Remains : 388/388 places, 898/898 transitions.
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 32 out of 604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 604/604 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 596 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 596 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 588 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 588 transition count 1098
Applied a total of 32 rules in 25 ms. Remains 588 /604 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2025-06-02 23:49:09] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2025-06-02 23:49:09] [INFO ] Computed 40 invariants in 25 ms
[2025-06-02 23:49:09] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:19] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:20] [INFO ] Deduced a trap composed of 64 places in 283 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:20] [INFO ] Deduced a trap composed of 64 places in 277 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:21] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:21] [INFO ] Deduced a trap composed of 64 places in 253 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:21] [INFO ] Deduced a trap composed of 159 places in 288 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:21] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:22] [INFO ] Deduced a trap composed of 258 places in 344 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:22] [INFO ] Deduced a trap composed of 322 places in 319 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:23] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:25] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:25] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:30] [INFO ] Deduced a trap composed of 269 places in 380 ms of which 107 ms to minimize.
SMT process timed out in 20904ms, After SMT, problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 20908ms
[2025-06-02 23:49:30] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2025-06-02 23:49:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:49:31] [INFO ] Implicit Places using invariants in 706 ms returned []
[2025-06-02 23:49:31] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2025-06-02 23:49:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:49:31] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 23:49:42] [INFO ] Implicit Places using invariants and state equation in 11294 ms returned []
Implicit Place search using SMT with State Equation took 12016 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2025-06-02 23:49:42] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2025-06-02 23:49:42] [INFO ] Invariant cache hit.
[2025-06-02 23:49:42] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:52] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:52] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:52] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:52] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:52] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:52] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:52] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:53] [INFO ] Deduced a trap composed of 285 places in 351 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:53] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:54] [INFO ] Deduced a trap composed of 322 places in 321 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:55] [INFO ] Deduced a trap composed of 292 places in 351 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:55] [INFO ] Deduced a trap composed of 53 places in 280 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:55] [INFO ] Deduced a trap composed of 269 places in 310 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:56] [INFO ] Deduced a trap composed of 53 places in 294 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:56] [INFO ] Deduced a trap composed of 53 places in 287 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:49:56] [INFO ] Deduced a trap composed of 19 places in 263 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:50:01] [INFO ] Deduced a trap composed of 269 places in 322 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:50:02] [INFO ] Deduced a trap composed of 287 places in 321 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:50:07] [INFO ] Deduced a trap composed of 294 places in 325 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:50:09] [INFO ] Deduced a trap composed of 54 places in 291 ms of which 56 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:50:10] [INFO ] Deduced a trap composed of 114 places in 292 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:50:10] [INFO ] Deduced a trap composed of 159 places in 287 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:50:11] [INFO ] Deduced a trap composed of 47 places in 157 ms of which 28 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 3.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 9.0)
(s163 0.0)
(s164 1.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 4.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 61 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 23/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 61 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60600ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 60603ms
Starting structural reductions in LTL mode, iteration 1 : 588/604 places, 1098/1114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93557 ms. Remains : 588/604 places, 1098/1114 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 477 ms.
Product exploration explored 100000 steps with 50000 reset in 592 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 37 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-02 finished in 94979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 33 out of 604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 604/604 places, 1114/1114 transitions.
Applied a total of 0 rules in 8 ms. Remains 604 /604 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2025-06-02 23:50:44] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 604 cols
[2025-06-02 23:50:44] [INFO ] Computed 40 invariants in 13 ms
[2025-06-02 23:50:44] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:50:58] [INFO ] Deduced a trap composed of 66 places in 335 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:50:58] [INFO ] Deduced a trap composed of 66 places in 279 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:50:58] [INFO ] Deduced a trap composed of 66 places in 276 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:50:59] [INFO ] Deduced a trap composed of 66 places in 306 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:50:59] [INFO ] Deduced a trap composed of 130 places in 332 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:50:59] [INFO ] Deduced a trap composed of 175 places in 321 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:50:59] [INFO ] Deduced a trap composed of 66 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:00] [INFO ] Deduced a trap composed of 274 places in 344 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:00] [INFO ] Deduced a trap composed of 66 places in 276 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:01] [INFO ] Deduced a trap composed of 66 places in 285 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:01] [INFO ] Deduced a trap composed of 338 places in 328 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:01] [INFO ] Deduced a trap composed of 66 places in 209 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:02] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 27 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/1702 variables, and 51 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/604 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:13] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:14] [INFO ] Deduced a trap composed of 303 places in 355 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:15] [INFO ] Deduced a trap composed of 395 places in 369 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:16] [INFO ] Deduced a trap composed of 388 places in 362 ms of which 137 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/1702 variables, and 55 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/604 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40815ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 40818ms
[2025-06-02 23:51:25] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2025-06-02 23:51:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:26] [INFO ] Implicit Places using invariants in 801 ms returned []
[2025-06-02 23:51:26] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2025-06-02 23:51:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:51:26] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 23:51:38] [INFO ] Implicit Places using invariants and state equation in 11803 ms returned []
Implicit Place search using SMT with State Equation took 12629 ms to find 0 implicit places.
Running 1112 sub problems to find dead transitions.
[2025-06-02 23:51:38] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2025-06-02 23:51:38] [INFO ] Invariant cache hit.
[2025-06-02 23:51:38] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:52] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:52] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:52] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:52] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:52] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:52] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:52] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:54] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:58] [INFO ] Deduced a trap composed of 269 places in 323 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:51:58] [INFO ] Deduced a trap composed of 19 places in 267 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:52:02] [INFO ] Deduced a trap composed of 285 places in 325 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:52:02] [INFO ] Deduced a trap composed of 293 places in 363 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:52:03] [INFO ] Deduced a trap composed of 54 places in 274 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:52:03] [INFO ] Deduced a trap composed of 311 places in 370 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:52:04] [INFO ] Deduced a trap composed of 295 places in 326 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:52:05] [INFO ] Deduced a trap composed of 175 places in 313 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:52:06] [INFO ] Deduced a trap composed of 130 places in 317 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:52:06] [INFO ] Deduced a trap composed of 310 places in 230 ms of which 54 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/1702 variables, and 56 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/604 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 1112 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 602/1702 variables, and 56 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/604 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60677ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 60679ms
Finished structural reductions in LTL mode , in 1 iterations and 114140 ms. Remains : 604/604 places, 1114/1114 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 352 ms.
Product exploration explored 100000 steps with 50000 reset in 362 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 11 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-03 finished in 114988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(X(p1))) U (G((p0||X(X(p1))))||(p2&&(p0||X(X(p1)))))))'
Support contains 26 out of 604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 604/604 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 596 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 596 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 588 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 588 transition count 1098
Applied a total of 32 rules in 32 ms. Remains 588 /604 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2025-06-02 23:52:39] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 588 cols
[2025-06-02 23:52:39] [INFO ] Computed 40 invariants in 11 ms
[2025-06-02 23:52:39] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:52:49] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:52:50] [INFO ] Deduced a trap composed of 64 places in 311 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:52:50] [INFO ] Deduced a trap composed of 64 places in 300 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:52:51] [INFO ] Deduced a trap composed of 64 places in 292 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:52:51] [INFO ] Deduced a trap composed of 64 places in 283 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:52:51] [INFO ] Deduced a trap composed of 159 places in 306 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:52:52] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:52:52] [INFO ] Deduced a trap composed of 258 places in 328 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:52:52] [INFO ] Deduced a trap composed of 322 places in 344 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:52:53] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:52:55] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:52:55] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 50 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:05] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 51 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40568ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 40570ms
[2025-06-02 23:53:20] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2025-06-02 23:53:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:53:20] [INFO ] Implicit Places using invariants in 685 ms returned []
[2025-06-02 23:53:20] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2025-06-02 23:53:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:53:21] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 23:53:31] [INFO ] Implicit Places using invariants and state equation in 10275 ms returned []
Implicit Place search using SMT with State Equation took 10998 ms to find 0 implicit places.
Running 1096 sub problems to find dead transitions.
[2025-06-02 23:53:31] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
[2025-06-02 23:53:31] [INFO ] Invariant cache hit.
[2025-06-02 23:53:31] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:41] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:41] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:41] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:41] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:41] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:41] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:41] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:42] [INFO ] Deduced a trap composed of 285 places in 344 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:42] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:43] [INFO ] Deduced a trap composed of 322 places in 314 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:44] [INFO ] Deduced a trap composed of 292 places in 334 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:44] [INFO ] Deduced a trap composed of 53 places in 279 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:44] [INFO ] Deduced a trap composed of 269 places in 349 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:45] [INFO ] Deduced a trap composed of 53 places in 290 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:45] [INFO ] Deduced a trap composed of 53 places in 310 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:45] [INFO ] Deduced a trap composed of 19 places in 241 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:50] [INFO ] Deduced a trap composed of 269 places in 317 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:51] [INFO ] Deduced a trap composed of 287 places in 321 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:56] [INFO ] Deduced a trap composed of 294 places in 325 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:58] [INFO ] Deduced a trap composed of 54 places in 283 ms of which 54 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:59] [INFO ] Deduced a trap composed of 114 places in 301 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:53:59] [INFO ] Deduced a trap composed of 159 places in 278 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:00] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 27 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/1670 variables, and 61 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/586 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 23/61 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/1670 variables, and 61 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/588 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60562ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 60565ms
Starting structural reductions in LTL mode, iteration 1 : 588/604 places, 1098/1114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112169 ms. Remains : 588/604 places, 1098/1114 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-09
Product exploration explored 100000 steps with 33333 reset in 304 ms.
Product exploration explored 100000 steps with 33333 reset in 319 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT p0)), (X p2), (X (X (NOT p0))), (X (X p1)), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 11 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-09 finished in 112965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 604/604 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 604 transition count 1042
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 532 transition count 1042
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 144 place count 532 transition count 978
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 272 place count 468 transition count 978
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 280 place count 460 transition count 970
Iterating global reduction 2 with 8 rules applied. Total rules applied 288 place count 460 transition count 970
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 416 place count 396 transition count 906
Applied a total of 416 rules in 87 ms. Remains 396 /604 variables (removed 208) and now considering 906/1114 (removed 208) transitions.
Running 904 sub problems to find dead transitions.
[2025-06-02 23:54:32] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
// Phase 1: matrix 890 rows 396 cols
[2025-06-02 23:54:32] [INFO ] Computed 40 invariants in 11 ms
[2025-06-02 23:54:32] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:42] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:42] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:42] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:42] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:43] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:43] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:43] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:43] [INFO ] Deduced a trap composed of 141 places in 249 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:43] [INFO ] Deduced a trap composed of 148 places in 260 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:43] [INFO ] Deduced a trap composed of 133 places in 228 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:44] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:44] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:44] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:44] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:45] [INFO ] Deduced a trap composed of 19 places in 225 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:47] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:54:47] [INFO ] Deduced a trap composed of 234 places in 214 ms of which 48 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1286 variables, and 55 constraints, problems are : Problem set: 0 solved, 904 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 904/904 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 904 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1286 variables, and 55 constraints, problems are : Problem set: 0 solved, 904 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/904 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40564ms problems are : Problem set: 0 solved, 904 unsolved
Search for dead transitions found 0 dead transitions in 40567ms
[2025-06-02 23:55:13] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2025-06-02 23:55:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:55:14] [INFO ] Implicit Places using invariants in 1230 ms returned []
[2025-06-02 23:55:14] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2025-06-02 23:55:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:55:15] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 23:55:20] [INFO ] Implicit Places using invariants and state equation in 5592 ms returned []
Implicit Place search using SMT with State Equation took 6864 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:55:20] [INFO ] Redundant transitions in 8 ms returned []
Running 904 sub problems to find dead transitions.
[2025-06-02 23:55:20] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2025-06-02 23:55:20] [INFO ] Invariant cache hit.
[2025-06-02 23:55:20] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:55:30] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:55:30] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:55:30] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:55:30] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:55:30] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:55:30] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:55:30] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:55:31] [INFO ] Deduced a trap composed of 141 places in 240 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:55:31] [INFO ] Deduced a trap composed of 148 places in 237 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:55:31] [INFO ] Deduced a trap composed of 133 places in 227 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:55:31] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:55:32] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:55:32] [INFO ] Deduced a trap composed of 34 places in 248 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:55:32] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:55:33] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:55:34] [INFO ] Deduced a trap composed of 234 places in 224 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:55:41] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:55:42] [INFO ] Deduced a trap composed of 106 places in 224 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:55:42] [INFO ] Deduced a trap composed of 3 places in 212 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1286 variables, and 57 constraints, problems are : Problem set: 0 solved, 904 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 904/904 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 904 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:56:12] [INFO ] Deduced a trap composed of 142 places in 221 ms of which 52 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1286 variables, and 58 constraints, problems are : Problem set: 0 solved, 904 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/904 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60571ms problems are : Problem set: 0 solved, 904 unsolved
Search for dead transitions found 0 dead transitions in 60573ms
Starting structural reductions in SI_LTL mode, iteration 1 : 396/604 places, 906/1114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108124 ms. Remains : 396/604 places, 906/1114 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-11
Product exploration explored 100000 steps with 3826 reset in 410 ms.
Product exploration explored 100000 steps with 3802 reset in 370 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
RANDOM walk for 92 steps (0 resets) in 7 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2025-06-02 23:56:21] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2025-06-02 23:56:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:56:22] [INFO ] [Real]Absence check using 15 positive place invariants in 253 ms returned sat
[2025-06-02 23:56:23] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 946 ms returned sat
[2025-06-02 23:56:36] [INFO ] [Real]Absence check using state equation in 13448 ms returned unknown
Could not prove EG (NOT p0)
Support contains 4 out of 396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 396/396 places, 906/906 transitions.
Applied a total of 0 rules in 18 ms. Remains 396 /396 variables (removed 0) and now considering 906/906 (removed 0) transitions.
Running 904 sub problems to find dead transitions.
[2025-06-02 23:56:36] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2025-06-02 23:56:36] [INFO ] Invariant cache hit.
[2025-06-02 23:56:36] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:56:47] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:56:47] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:56:47] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:56:47] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:56:47] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:56:47] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:56:47] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:56:47] [INFO ] Deduced a trap composed of 141 places in 262 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:56:48] [INFO ] Deduced a trap composed of 148 places in 231 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:56:48] [INFO ] Deduced a trap composed of 133 places in 245 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:56:48] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:56:48] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:56:49] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:56:49] [INFO ] Deduced a trap composed of 19 places in 220 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:56:50] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:56:52] [INFO ] Deduced a trap composed of 234 places in 222 ms of which 50 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1286 variables, and 54 constraints, problems are : Problem set: 0 solved, 904 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 904/904 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 904 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:57:10] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1286 variables, and 55 constraints, problems are : Problem set: 0 solved, 904 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/904 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40763ms problems are : Problem set: 0 solved, 904 unsolved
Search for dead transitions found 0 dead transitions in 40766ms
[2025-06-02 23:57:17] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2025-06-02 23:57:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:57:18] [INFO ] Implicit Places using invariants in 1262 ms returned []
[2025-06-02 23:57:18] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2025-06-02 23:57:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:57:19] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 23:57:24] [INFO ] Implicit Places using invariants and state equation in 5496 ms returned []
Implicit Place search using SMT with State Equation took 6773 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:57:24] [INFO ] Redundant transitions in 7 ms returned []
Running 904 sub problems to find dead transitions.
[2025-06-02 23:57:24] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2025-06-02 23:57:24] [INFO ] Invariant cache hit.
[2025-06-02 23:57:24] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:57:34] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:57:34] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:57:34] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:57:34] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:57:34] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:57:34] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:57:35] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:57:35] [INFO ] Deduced a trap composed of 141 places in 232 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:57:35] [INFO ] Deduced a trap composed of 148 places in 240 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:57:35] [INFO ] Deduced a trap composed of 133 places in 214 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:57:36] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:57:36] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:57:36] [INFO ] Deduced a trap composed of 34 places in 204 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:57:36] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:57:37] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:57:39] [INFO ] Deduced a trap composed of 234 places in 213 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:57:45] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:57:45] [INFO ] Deduced a trap composed of 106 places in 228 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:57:46] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1286 variables, and 57 constraints, problems are : Problem set: 0 solved, 904 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 904/904 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 904 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:58:17] [INFO ] Deduced a trap composed of 142 places in 230 ms of which 53 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1286 variables, and 58 constraints, problems are : Problem set: 0 solved, 904 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/904 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60679ms problems are : Problem set: 0 solved, 904 unsolved
Search for dead transitions found 0 dead transitions in 60681ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 108260 ms. Remains : 396/396 places, 906/906 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 98 steps (0 resets) in 5 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2025-06-02 23:58:25] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2025-06-02 23:58:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 23:58:25] [INFO ] [Real]Absence check using 15 positive place invariants in 255 ms returned sat
[2025-06-02 23:58:26] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 952 ms returned sat
[2025-06-02 23:58:40] [INFO ] [Real]Absence check using state equation in 13441 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3806 reset in 289 ms.
Product exploration explored 100000 steps with 3811 reset in 309 ms.
Built C files in :
/tmp/ltsmin9994025519365949874
[2025-06-02 23:58:41] [INFO ] Computing symmetric may disable matrix : 906 transitions.
[2025-06-02 23:58:41] [INFO ] Computation of Complete disable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:58:41] [INFO ] Computing symmetric may enable matrix : 906 transitions.
[2025-06-02 23:58:41] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:58:41] [INFO ] Computing Do-Not-Accords matrix : 906 transitions.
[2025-06-02 23:58:41] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 23:58:41] [INFO ] Built C files in 239ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9994025519365949874
Running compilation step : cd /tmp/ltsmin9994025519365949874;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2948 ms.
Running link step : cd /tmp/ltsmin9994025519365949874;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin9994025519365949874;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14178782749927262883.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 396/396 places, 906/906 transitions.
Applied a total of 0 rules in 16 ms. Remains 396 /396 variables (removed 0) and now considering 906/906 (removed 0) transitions.
Running 904 sub problems to find dead transitions.
[2025-06-02 23:58:56] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2025-06-02 23:58:56] [INFO ] Invariant cache hit.
[2025-06-02 23:58:56] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:06] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:06] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:06] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:06] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:06] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:06] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:06] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:06] [INFO ] Deduced a trap composed of 141 places in 239 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:07] [INFO ] Deduced a trap composed of 148 places in 230 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:07] [INFO ] Deduced a trap composed of 133 places in 233 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:07] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:07] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:08] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:08] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:08] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:10] [INFO ] Deduced a trap composed of 234 places in 220 ms of which 52 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1286 variables, and 54 constraints, problems are : Problem set: 0 solved, 904 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 904/904 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 904 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:30] [INFO ] Deduced a trap composed of 31 places in 386 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1286 variables, and 55 constraints, problems are : Problem set: 0 solved, 904 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/904 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40628ms problems are : Problem set: 0 solved, 904 unsolved
Search for dead transitions found 0 dead transitions in 40630ms
[2025-06-02 23:59:36] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2025-06-02 23:59:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:59:38] [INFO ] Implicit Places using invariants in 1228 ms returned []
[2025-06-02 23:59:38] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2025-06-02 23:59:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 23:59:38] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-02 23:59:43] [INFO ] Implicit Places using invariants and state equation in 5755 ms returned []
Implicit Place search using SMT with State Equation took 7007 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 23:59:43] [INFO ] Redundant transitions in 6 ms returned []
Running 904 sub problems to find dead transitions.
[2025-06-02 23:59:43] [INFO ] Flow matrix only has 890 transitions (discarded 16 similar events)
[2025-06-02 23:59:43] [INFO ] Invariant cache hit.
[2025-06-02 23:59:43] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:54] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:54] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:54] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:54] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:54] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:54] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:54] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:54] [INFO ] Deduced a trap composed of 141 places in 228 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:55] [INFO ] Deduced a trap composed of 148 places in 239 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:55] [INFO ] Deduced a trap composed of 133 places in 238 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:55] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:55] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:55] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:56] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:56] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 23:59:58] [INFO ] Deduced a trap composed of 234 places in 213 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:00:05] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:00:05] [INFO ] Deduced a trap composed of 106 places in 245 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:00:06] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1286 variables, and 57 constraints, problems are : Problem set: 0 solved, 904 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 904/904 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 904 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 904 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:00:36] [INFO ] Deduced a trap composed of 142 places in 231 ms of which 53 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 904 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1286 variables, and 58 constraints, problems are : Problem set: 0 solved, 904 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/396 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/904 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60659ms problems are : Problem set: 0 solved, 904 unsolved
Search for dead transitions found 0 dead transitions in 60661ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 108331 ms. Remains : 396/396 places, 906/906 transitions.
Built C files in :
/tmp/ltsmin10808786284800998010
[2025-06-03 00:00:44] [INFO ] Computing symmetric may disable matrix : 906 transitions.
[2025-06-03 00:00:44] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:00:44] [INFO ] Computing symmetric may enable matrix : 906 transitions.
[2025-06-03 00:00:44] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:00:44] [INFO ] Computing Do-Not-Accords matrix : 906 transitions.
[2025-06-03 00:00:44] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:00:44] [INFO ] Built C files in 203ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10808786284800998010
Running compilation step : cd /tmp/ltsmin10808786284800998010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2756 ms.
Running link step : cd /tmp/ltsmin10808786284800998010;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin10808786284800998010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8600341265710256204.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 00:00:59] [INFO ] Flatten gal took : 48 ms
[2025-06-03 00:00:59] [INFO ] Flatten gal took : 45 ms
[2025-06-03 00:00:59] [INFO ] Time to serialize gal into /tmp/LTL17424393354046195875.gal : 9 ms
[2025-06-03 00:00:59] [INFO ] Time to serialize properties into /tmp/LTL5857624441400940988.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17424393354046195875.gal' '-t' 'CGAL' '-hoa' '/tmp/aut415952596447815901.hoa' '-atoms' '/tmp/LTL5857624441400940988.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/LTL5857624441400940988.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut415952596447815901.hoa
Detected timeout of ITS tools.
[2025-06-03 00:01:14] [INFO ] Flatten gal took : 88 ms
[2025-06-03 00:01:15] [INFO ] Flatten gal took : 71 ms
[2025-06-03 00:01:15] [INFO ] Time to serialize gal into /tmp/LTL11854234825915247023.gal : 29 ms
[2025-06-03 00:01:15] [INFO ] Time to serialize properties into /tmp/LTL2077536086122501007.ltl : 14 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/LTL11854234825915247023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2077536086122501007.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("((BlockedTasks<=cBlockedTasks)&&(cPollingAbort<=P_1099))")))
Formula 0 simplified : G!"((BlockedTasks<=cBlockedTasks)&&(cPollingAbort<=P_1099))"
Detected timeout of ITS tools.
[2025-06-03 00:01:30] [INFO ] Flatten gal took : 34 ms
[2025-06-03 00:01:30] [INFO ] Applying decomposition
[2025-06-03 00:01:30] [INFO ] Flatten gal took : 34 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/graph11246419990742137975.txt' '-o' '/tmp/graph11246419990742137975.bin' '-w' '/tmp/graph11246419990742137975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11246419990742137975.bin' '-l' '-1' '-v' '-w' '/tmp/graph11246419990742137975.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:01:30] [INFO ] Decomposing Gal with order
[2025-06-03 00:01:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:01:30] [INFO ] Removed a total of 726 redundant transitions.
[2025-06-03 00:01:30] [INFO ] Flatten gal took : 236 ms
[2025-06-03 00:01:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 269 labels/synchronizations in 23 ms.
[2025-06-03 00:01:30] [INFO ] Time to serialize gal into /tmp/LTL12385093550564396151.gal : 10 ms
[2025-06-03 00:01:30] [INFO ] Time to serialize properties into /tmp/LTL10848530787681440429.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/LTL12385093550564396151.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10848530787681440429.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F("((gu1.BlockedTasks<=gu1.cBlockedTasks)&&(gu2.cPollingAbort<=gu2.P_1099))")))
Formula 0 simplified : G!"((gu1.BlockedTasks<=gu1.cBlockedTasks)&&(gu2.cPollingAbort<=gu2.P_1099))"
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-11 finished in 433383 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 16 out of 604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 604/604 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 604 transition count 1058
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 548 transition count 1058
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 112 place count 548 transition count 986
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 256 place count 476 transition count 986
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 264 place count 468 transition count 978
Iterating global reduction 2 with 8 rules applied. Total rules applied 272 place count 468 transition count 978
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 352 place count 428 transition count 938
Applied a total of 352 rules in 48 ms. Remains 428 /604 variables (removed 176) and now considering 938/1114 (removed 176) transitions.
Running 936 sub problems to find dead transitions.
[2025-06-03 00:01:46] [INFO ] Flow matrix only has 922 transitions (discarded 16 similar events)
// Phase 1: matrix 922 rows 428 cols
[2025-06-03 00:01:46] [INFO ] Computed 40 invariants in 10 ms
[2025-06-03 00:01:46] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 936 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:01:54] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:01:54] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:01:54] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:01:54] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:01:54] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:01:54] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:01:54] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:01:55] [INFO ] Deduced a trap composed of 165 places in 255 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:01:55] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:01:56] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 936 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:02:05] [INFO ] Deduced a trap composed of 138 places in 245 ms of which 55 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 2.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/1350 variables, and 49 constraints, problems are : Problem set: 0 solved, 936 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 936/936 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 936 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 936 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:02:19] [INFO ] Deduced a trap composed of 173 places in 275 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:02:19] [INFO ] Deduced a trap composed of 180 places in 248 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:02:23] [INFO ] Deduced a trap composed of 103 places in 219 ms of which 52 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/1350 variables, and 52 constraints, problems are : Problem set: 0 solved, 936 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/936 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40616ms problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 40618ms
[2025-06-03 00:02:26] [INFO ] Flow matrix only has 922 transitions (discarded 16 similar events)
[2025-06-03 00:02:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:02:27] [INFO ] Implicit Places using invariants in 651 ms returned []
[2025-06-03 00:02:27] [INFO ] Flow matrix only has 922 transitions (discarded 16 similar events)
[2025-06-03 00:02:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:02:27] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-06-03 00:02:32] [INFO ] Implicit Places using invariants and state equation in 4991 ms returned []
Implicit Place search using SMT with State Equation took 5665 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:02:32] [INFO ] Redundant transitions in 6 ms returned []
Running 936 sub problems to find dead transitions.
[2025-06-03 00:02:32] [INFO ] Flow matrix only has 922 transitions (discarded 16 similar events)
[2025-06-03 00:02:32] [INFO ] Invariant cache hit.
[2025-06-03 00:02:32] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 936 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:02:40] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:02:40] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:02:40] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:02:41] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:02:41] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:02:41] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:02:41] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:02:41] [INFO ] Deduced a trap composed of 165 places in 245 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:02:42] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:02:43] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:02:48] [INFO ] Deduced a trap composed of 138 places in 204 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:02:48] [INFO ] Deduced a trap composed of 66 places in 177 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:02:48] [INFO ] Deduced a trap composed of 103 places in 211 ms of which 47 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 936 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:03:00] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/1350 variables, and 52 constraints, problems are : Problem set: 0 solved, 936 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 936/936 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 936 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 936 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:03:11] [INFO ] Deduced a trap composed of 180 places in 297 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:03:23] [INFO ] Deduced a trap composed of 259 places in 269 ms of which 75 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/1350 variables, and 54 constraints, problems are : Problem set: 0 solved, 936 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/428 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/936 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60639ms problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 60641ms
Starting structural reductions in SI_LTL mode, iteration 1 : 428/604 places, 938/1114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106995 ms. Remains : 428/604 places, 938/1114 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T08-LTLCardinality-14
Stuttering criterion allowed to conclude after 7574 steps with 0 reset in 34 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T08-LTLCardinality-14 finished in 107092 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))'
[2025-06-03 00:03:33] [INFO ] Flatten gal took : 97 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8535929596080976200
[2025-06-03 00:03:33] [INFO ] Computing symmetric may disable matrix : 1114 transitions.
[2025-06-03 00:03:33] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:03:33] [INFO ] Computing symmetric may enable matrix : 1114 transitions.
[2025-06-03 00:03:33] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:03:33] [INFO ] Applying decomposition
[2025-06-03 00:03:33] [INFO ] Flatten gal took : 85 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/graph13574907442675551668.txt' '-o' '/tmp/graph13574907442675551668.bin' '-w' '/tmp/graph13574907442675551668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13574907442675551668.bin' '-l' '-1' '-v' '-w' '/tmp/graph13574907442675551668.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:03:33] [INFO ] Decomposing Gal with order
[2025-06-03 00:03:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:03:33] [INFO ] Computing Do-Not-Accords matrix : 1114 transitions.
[2025-06-03 00:03:33] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 00:03:33] [INFO ] Built C files in 462ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8535929596080976200
Running compilation step : cd /tmp/ltsmin8535929596080976200;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-03 00:03:34] [INFO ] Removed a total of 1063 redundant transitions.
[2025-06-03 00:03:34] [INFO ] Flatten gal took : 139 ms
[2025-06-03 00:03:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 426 labels/synchronizations in 64 ms.
[2025-06-03 00:03:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality11705177702183984243.gal : 8 ms
[2025-06-03 00:03:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality395874256009438764.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/LTLCardinality11705177702183984243.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality395874256009438764.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...297
Read 1 LTL properties
Checking formula 0 : !((F("((gu17.BlockedTasks<=gu17.cBlockedTasks)&&(gu18.cPollingAbort<=gu18.P_1099))")))
Formula 0 simplified : G!"((gu17.BlockedTasks<=gu17.cBlockedTasks)&&(gu18.cPollingAbort<=gu18.P_1099))"
Compilation finished in 3769 ms.
Running link step : cd /tmp/ltsmin8535929596080976200;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin8535929596080976200;'/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'
LTSmin run took 36839 ms.
FORMULA PolyORBLF-COL-S02J04T08-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1080314 ms.

BK_STOP 1748909054773

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J04T08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S02J04T08, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881253700275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T08.tgz
mv PolyORBLF-COL-S02J04T08 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;