Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253700284.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-S02J04T10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253700284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 187K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K 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-S02J04T10-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748911778241

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-06-03 00:49:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 00:49:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 00:49:39] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-03 00:49:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 00:49:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 627 ms
[2025-06-03 00:49:40] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2025-06-03 00:49:40] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2025-06-03 00:49:40] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (19 resets) in 1024 ms. (39 steps per ms) remains 2/24 properties
BEST_FIRST walk for 40002 steps (15 resets) in 334 ms. (119 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
[2025-06-03 00:49:40] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2025-06-03 00:49:40] [INFO ] Computed 26 invariants in 11 ms
[2025-06-03 00:49:40] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 23/47 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/50 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:41] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/145 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/145 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/145 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 116 constraints, problems are : Problem set: 0 solved, 2 unsolved in 406 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: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 23/47 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/50 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 118 constraints, problems are : Problem set: 0 solved, 2 unsolved in 288 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: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 737ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 416 ms.
Support contains 3 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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 58
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 73 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 72 transition count 54
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 69 transition count 54
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 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Applied a total of 41 rules in 33 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
Running 44 sub problems to find dead transitions.
[2025-06-03 00:49:42] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2025-06-03 00:49:42] [INFO ] Computed 25 invariants in 3 ms
[2025-06-03 00:49:42] [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/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:42] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:42] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:42] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:42] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:42] [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-03 00:49:42] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:42] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 6/32 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 44/104 variables, 60/92 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 8/100 constraints. Problems are: Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:43] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 1/101 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/101 constraints. Problems are: Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:43] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 5 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/104 variables, 1/102 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/104 variables, 0/102 constraints. Problems are: Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:44] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 4 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/104 variables, 1/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/104 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 15 (OVERLAPS) 0/104 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 103 constraints, problems are : Problem set: 2 solved, 42 unsolved in 2624 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 5/29 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/30 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/35 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 44/104 variables, 60/95 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 8/103 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 42/145 constraints. Problems are: Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:45] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:45] [INFO ] Deduced a trap composed of 14 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-03 00:49:45] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 3/148 constraints. Problems are: Problem set: 2 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:49:46] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 1/149 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/104 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 42 unsolved
At refinement iteration 13 (OVERLAPS) 0/104 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 149 constraints, problems are : Problem set: 2 solved, 42 unsolved in 3285 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 42/44 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5938ms problems are : Problem set: 2 solved, 42 unsolved
Search for dead transitions found 2 dead transitions in 5939ms
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 : 60/81 places, 43/65 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 59 transition count 41
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 58 transition count 39
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 8 ms. Remains 58 /60 variables (removed 2) and now considering 39/43 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5991 ms. Remains : 58/81 places, 39/65 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 00:49:48] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2025-06-03 00:49:48] [INFO ] Flatten gal took : 33 ms
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 00:49:48] [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-03 00:49:48] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 40 ms.
[2025-06-03 00:49:48] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 358 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Applied a total of 0 rules in 34 ms. Remains 752 /752 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2025-06-03 00:49:48] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2025-06-03 00:49:48] [INFO ] Computed 54 invariants in 67 ms
[2025-06-03 00:49:48] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:07] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:07] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:07] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:08] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:08] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:08] [INFO ] Deduced a trap composed of 65 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-03 00:50:08] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:08] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:08] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:09] [INFO ] Deduced a trap composed of 353 places in 417 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:09] [INFO ] Deduced a trap composed of 217 places in 370 ms of which 124 ms to minimize.
SMT process timed out in 21608ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 21618ms
[2025-06-03 00:50:09] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 00:50:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:50:10] [INFO ] Implicit Places using invariants in 505 ms returned [576, 577, 578, 579, 580, 581, 582, 583, 584, 585]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 512 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 742/752 places, 1412/1412 transitions.
Applied a total of 0 rules in 15 ms. Remains 742 /742 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 22187 ms. Remains : 742/752 places, 1412/1412 transitions.
Support contains 358 out of 742 places after structural reductions.
[2025-06-03 00:50:10] [INFO ] Flatten gal took : 132 ms
[2025-06-03 00:50:10] [INFO ] Flatten gal took : 119 ms
[2025-06-03 00:50:10] [INFO ] Input system was already deterministic with 1412 transitions.
RANDOM walk for 3898 steps (0 resets) in 60 ms. (63 steps per ms) remains 0/21 properties
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((G(p0) U p1)))'
Support contains 63 out of 742 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 742/742 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 740 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 730 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 730 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 720 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 720 transition count 1392
Applied a total of 42 rules in 57 ms. Remains 720 /742 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2025-06-03 00:50:11] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 720 cols
[2025-06-03 00:50:11] [INFO ] Computed 42 invariants in 45 ms
[2025-06-03 00:50:11] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 6.0)
(s1 4.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 9.0)
(s203 0.0)
(s204 1.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 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 (/ 2.0 3.0))
(s254 0.0)
(s255 (/ 1.0 3.0))
(s256 1.0)
(s257 0.0)
(s258 (/ 1.0 3.0))
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.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 (/ 2.0 3.0))
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 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 718/2092 variables, and 40 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:35] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:35] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:35] [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-03 00:50:36] [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-03 00:50:36] [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-03 00:50:36] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:36] [INFO ] Deduced a trap composed of 64 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-03 00:50:36] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:36] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:37] [INFO ] Deduced a trap composed of 197 places in 402 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:37] [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-03 00:50:38] [INFO ] Deduced a trap composed of 402 places in 417 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:39] [INFO ] Deduced a trap composed of 362 places in 486 ms of which 179 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:41] [INFO ] Deduced a trap composed of 23 places in 324 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:42] [INFO ] Deduced a trap composed of 333 places in 401 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:50] [INFO ] Deduced a trap composed of 357 places in 400 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:50:50] [INFO ] Deduced a trap composed of 490 places in 405 ms of which 152 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 57 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40965ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 40968ms
[2025-06-03 00:50:52] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 00:50:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:50:53] [INFO ] Implicit Places using invariants in 893 ms returned []
[2025-06-03 00:50:53] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 00:50:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:50:53] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 00:51:04] [INFO ] Implicit Places using invariants and state equation in 11548 ms returned []
Implicit Place search using SMT with State Equation took 12444 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2025-06-03 00:51:04] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 00:51:04] [INFO ] Invariant cache hit.
[2025-06-03 00:51:04] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:23] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:23] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:23] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:23] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:23] [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-03 00:51:23] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:23] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:24] [INFO ] Deduced a trap composed of 64 places in 347 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:25] [INFO ] Deduced a trap composed of 197 places in 399 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:29] [INFO ] Deduced a trap composed of 64 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:51:30] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 51 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:39] [INFO ] Deduced a trap composed of 322 places in 373 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:50] [INFO ] Deduced a trap composed of 490 places in 423 ms of which 170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:51:54] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:00] [INFO ] Deduced a trap composed of 333 places in 393 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:00] [INFO ] Deduced a trap composed of 366 places in 402 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:01] [INFO ] Deduced a trap composed of 362 places in 419 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:02] [INFO ] Deduced a trap composed of 57 places in 189 ms of which 32 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 58 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60907ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 60912ms
Starting structural reductions in LTL mode, iteration 1 : 720/742 places, 1392/1412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114395 ms. Remains : 720/742 places, 1392/1412 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-00 finished in 114717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(F((X(p2)&&p1)))))))'
Support contains 41 out of 742 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 742/742 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 740 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 730 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 730 transition count 1402
Applied a total of 22 rules in 40 ms. Remains 730 /742 variables (removed 12) and now considering 1402/1412 (removed 10) transitions.
Running 1400 sub problems to find dead transitions.
[2025-06-03 00:52:06] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 730 cols
[2025-06-03 00:52:06] [INFO ] Computed 42 invariants in 41 ms
[2025-06-03 00:52:06] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:24] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:24] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:25] [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-03 00:52:25] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:25] [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-03 00:52:25] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:25] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:25] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:25] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:26] [INFO ] Deduced a trap composed of 353 places in 485 ms of which 179 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:26] [INFO ] Deduced a trap composed of 207 places in 410 ms of which 135 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2112 variables, and 51 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:31] [INFO ] Deduced a trap composed of 332 places in 437 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:36] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:42] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:52:43] [INFO ] Deduced a trap composed of 367 places in 428 ms of which 182 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2112 variables, and 55 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41074ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 41077ms
[2025-06-03 00:52:47] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 00:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:52:47] [INFO ] Implicit Places using invariants in 687 ms returned []
[2025-06-03 00:52:47] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 00:52:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:52:48] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 00:53:01] [INFO ] Implicit Places using invariants and state equation in 13287 ms returned []
Implicit Place search using SMT with State Equation took 13976 ms to find 0 implicit places.
Running 1400 sub problems to find dead transitions.
[2025-06-03 00:53:01] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 00:53:01] [INFO ] Invariant cache hit.
[2025-06-03 00:53:01] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:23] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:23] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:23] [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-03 00:53:23] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:23] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:23] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:28] [INFO ] Deduced a trap composed of 57 places in 198 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:28] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:28] [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-03 00:53:28] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:28] [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-03 00:53:31] [INFO ] Deduced a trap composed of 333 places in 406 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:31] [INFO ] Deduced a trap composed of 23 places in 301 ms of which 36 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2112 variables, and 53 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:35] [INFO ] Deduced a trap composed of 152 places in 356 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:36] [INFO ] Deduced a trap composed of 207 places in 376 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:37] [INFO ] Deduced a trap composed of 332 places in 421 ms of which 164 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:37] [INFO ] Deduced a trap composed of 412 places in 405 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:48] [INFO ] Deduced a trap composed of 343 places in 458 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:53:51] [INFO ] Deduced a trap composed of 363 places in 475 ms of which 194 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:00] [INFO ] Deduced a trap composed of 387 places in 469 ms of which 197 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:01] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2112 variables, and 61 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60877ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 60884ms
Starting structural reductions in LTL mode, iteration 1 : 730/742 places, 1402/1412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115988 ms. Remains : 730/742 places, 1402/1412 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-01
Product exploration explored 100000 steps with 2683 reset in 443 ms.
Product exploration explored 100000 steps with 2647 reset in 422 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
RANDOM walk for 40000 steps (9 resets) in 330 ms. (120 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40001 steps (10 resets) in 379 ms. (105 steps per ms) remains 1/1 properties
[2025-06-03 00:54:03] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 00:54:03] [INFO ] Invariant cache hit.
[2025-06-03 00:54:03] [INFO ] State equation strengthened by 120 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 226/247 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 715/2112 variables, and 28 constraints, problems are : Problem set: 1 solved, 0 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 2/12 constraints, Generalized P Invariants (flows): 26/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 184ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT p0))), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F p0)]
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
[2025-06-03 00:54:04] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 00:54:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:54:05] [INFO ] [Real]Absence check using 12 positive place invariants in 651 ms returned sat
[2025-06-03 00:54:07] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 1298 ms returned sat
[2025-06-03 00:54:11] [INFO ] [Real]Absence check using state equation in 4833 ms returned sat
[2025-06-03 00:54:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:54:12] [INFO ] [Nat]Absence check using 12 positive place invariants in 253 ms returned sat
[2025-06-03 00:54:15] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 2020 ms returned sat
[2025-06-03 00:54:24] [INFO ] [Nat]Absence check using state equation in 9143 ms returned unknown
Could not prove EG (NOT p0)
Support contains 41 out of 730 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 730/730 places, 1402/1402 transitions.
Applied a total of 0 rules in 19 ms. Remains 730 /730 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Running 1400 sub problems to find dead transitions.
[2025-06-03 00:54:24] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 00:54:24] [INFO ] Invariant cache hit.
[2025-06-03 00:54:24] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 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 728/2112 variables, and 40 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:47] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:47] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:47] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:47] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:48] [INFO ] Deduced a trap composed of 65 places in 315 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:48] [INFO ] Deduced a trap composed of 152 places in 365 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:48] [INFO ] Deduced a trap composed of 65 places in 323 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:49] [INFO ] Deduced a trap composed of 207 places in 373 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:50] [INFO ] Deduced a trap composed of 412 places in 409 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:53] [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-03 00:54:54] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:54] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:54:55] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:04] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2112 variables, and 54 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40981ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 40985ms
[2025-06-03 00:55:05] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 00:55:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:55:05] [INFO ] Implicit Places using invariants in 696 ms returned []
[2025-06-03 00:55:05] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 00:55:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:55:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 00:55:19] [INFO ] Implicit Places using invariants and state equation in 13485 ms returned []
Implicit Place search using SMT with State Equation took 14183 ms to find 0 implicit places.
Running 1400 sub problems to find dead transitions.
[2025-06-03 00:55:19] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 00:55:19] [INFO ] Invariant cache hit.
[2025-06-03 00:55:19] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:41] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:41] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:41] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:41] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:41] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:41] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:46] [INFO ] Deduced a trap composed of 57 places in 212 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:46] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:46] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:46] [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-03 00:55:46] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:49] [INFO ] Deduced a trap composed of 333 places in 406 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:50] [INFO ] Deduced a trap composed of 23 places in 304 ms of which 36 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2112 variables, and 53 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:54] [INFO ] Deduced a trap composed of 152 places in 371 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:54] [INFO ] Deduced a trap composed of 207 places in 382 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:55] [INFO ] Deduced a trap composed of 332 places in 429 ms of which 166 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:55:55] [INFO ] Deduced a trap composed of 412 places in 405 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:07] [INFO ] Deduced a trap composed of 343 places in 444 ms of which 167 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:10] [INFO ] Deduced a trap composed of 363 places in 488 ms of which 192 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:19] [INFO ] Deduced a trap composed of 387 places in 452 ms of which 195 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:20] [INFO ] Deduced a trap composed of 3 places in 320 ms of which 16 ms to minimize.
SMT process timed out in 60929ms, After SMT, problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 60939ms
Finished structural reductions in LTL mode , in 1 iterations and 116136 ms. Remains : 730/730 places, 1402/1402 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
RANDOM walk for 365 steps (0 resets) in 8 ms. (40 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
[2025-06-03 00:56:21] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 00:56:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:56:22] [INFO ] [Real]Absence check using 12 positive place invariants in 647 ms returned sat
[2025-06-03 00:56:23] [INFO ] [Real]Absence check using 12 positive and 30 generalized place invariants in 1297 ms returned sat
[2025-06-03 00:56:28] [INFO ] [Real]Absence check using state equation in 4883 ms returned sat
[2025-06-03 00:56:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 00:56:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 252 ms returned sat
[2025-06-03 00:56:31] [INFO ] [Nat]Absence check using 12 positive and 30 generalized place invariants in 2020 ms returned sat
[2025-06-03 00:56:40] [INFO ] [Nat]Absence check using state equation in 8578 ms returned sat
[2025-06-03 00:56:40] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 00:56:42] [INFO ] [Nat]Added 120 Read/Feed constraints in 1526 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:42] [INFO ] Deduced a trap composed of 57 places in 389 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:56:43] [INFO ] Deduced a trap composed of 95 places in 414 ms of which 102 ms to minimize.
[2025-06-03 00:56:43] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 1885 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 2722 reset in 312 ms.
Product exploration explored 100000 steps with 2709 reset in 322 ms.
Applying partial POR strategy [false, true, false, false, false, true]
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Support contains 41 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 1402/1402 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 730 transition count 1402
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 90 Pre rules applied. Total rules applied 50 place count 730 transition count 1492
Deduced a syphon composed of 140 places in 1 ms
Iterating global reduction 1 with 90 rules applied. Total rules applied 140 place count 730 transition count 1492
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 170 place count 700 transition count 1462
Deduced a syphon composed of 110 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 200 place count 700 transition count 1462
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 190 places in 1 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 280 place count 700 transition count 1462
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 310 place count 670 transition count 1432
Deduced a syphon composed of 170 places in 1 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 340 place count 670 transition count 1432
Deduced a syphon composed of 170 places in 1 ms
Applied a total of 340 rules in 185 ms. Remains 670 /730 variables (removed 60) and now considering 1432/1402 (removed -30) transitions.
Running 1430 sub problems to find dead transitions.
[2025-06-03 00:56:45] [INFO ] Flow matrix only has 1412 transitions (discarded 20 similar events)
// Phase 1: matrix 1412 rows 670 cols
[2025-06-03 00:56:45] [INFO ] Computed 42 invariants in 24 ms
[2025-06-03 00:56:45] [INFO ] State equation strengthened by 160 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/668 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1430 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/668 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1430 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:03] [INFO ] Deduced a trap composed of 42 places in 184 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:03] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:03] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:04] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:04] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:04] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:04] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:04] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:04] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:04] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:05] [INFO ] Deduced a trap composed of 173 places in 342 ms of which 92 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:05] [INFO ] Deduced a trap composed of 183 places in 374 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:06] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:57:06] [INFO ] Deduced a trap composed of 163 places in 360 ms of which 97 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 668/2082 variables, and 54 constraints, problems are : Problem set: 20 solved, 1410 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/670 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1430/1430 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 1410 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/668 variables, 14/14 constraints. Problems are: Problem set: 20 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/668 variables, 26/40 constraints. Problems are: Problem set: 20 solved, 1410 unsolved
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/668 variables, 14/54 constraints. Problems are: Problem set: 250 solved, 1180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 668/2082 variables, and 54 constraints, problems are : Problem set: 250 solved, 1180 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/670 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1430 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41215ms problems are : Problem set: 250 solved, 1180 unsolved
Search for dead transitions found 250 dead transitions in 41218ms
Found 250 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 250 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 250 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:57:26] [INFO ] Redundant transitions in 60 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 670/730 places, 1182/1402 transitions.
Graph (complete) has 3216 edges and 670 vertex of which 510 are kept as prefixes of interest. Removing 160 places using SCC suffix rule.4 ms
Discarding 160 places :
Also discarding 0 output transitions
Deduced a syphon composed of 10 places in 1 ms
Applied a total of 1 rules in 34 ms. Remains 510 /670 variables (removed 160) and now considering 1182/1182 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 510/730 places, 1182/1402 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41507 ms. Remains : 510/730 places, 1182/1402 transitions.
Built C files in :
/tmp/ltsmin18310930848985424071
[2025-06-03 00:57:26] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18310930848985424071
Running compilation step : cd /tmp/ltsmin18310930848985424071;'/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 2680 ms.
Running link step : cd /tmp/ltsmin18310930848985424071;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin18310930848985424071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8776385821867702756.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 41 out of 730 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 730/730 places, 1402/1402 transitions.
Applied a total of 0 rules in 15 ms. Remains 730 /730 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Running 1400 sub problems to find dead transitions.
[2025-06-03 00:57:41] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
// Phase 1: matrix 1382 rows 730 cols
[2025-06-03 00:57:41] [INFO ] Computed 42 invariants in 26 ms
[2025-06-03 00:57:41] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:00] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:00] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:00] [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-03 00:58:00] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:00] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:00] [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-03 00:58:00] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:01] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:01] [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-03 00:58:01] [INFO ] Deduced a trap composed of 353 places in 446 ms of which 178 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:02] [INFO ] Deduced a trap composed of 207 places in 379 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:02] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2112 variables, and 52 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:07] [INFO ] Deduced a trap composed of 332 places in 434 ms of which 168 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:07] [INFO ] Deduced a trap composed of 412 places in 413 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:19] [INFO ] Deduced a trap composed of 57 places in 198 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:21] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2112 variables, and 56 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40869ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 40871ms
[2025-06-03 00:58:22] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 00:58:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:58:23] [INFO ] Implicit Places using invariants in 684 ms returned []
[2025-06-03 00:58:23] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 00:58:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:58:24] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 00:58:36] [INFO ] Implicit Places using invariants and state equation in 13035 ms returned []
Implicit Place search using SMT with State Equation took 13726 ms to find 0 implicit places.
Running 1400 sub problems to find dead transitions.
[2025-06-03 00:58:36] [INFO ] Flow matrix only has 1382 transitions (discarded 20 similar events)
[2025-06-03 00:58:36] [INFO ] Invariant cache hit.
[2025-06-03 00:58:36] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:58] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:58] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:58] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:58] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:58] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:58:58] [INFO ] Deduced a trap composed of 65 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-03 00:59:02] [INFO ] Deduced a trap composed of 57 places in 206 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:02] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:03] [INFO ] Deduced a trap composed of 65 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-03 00:59:03] [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-03 00:59:03] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:06] [INFO ] Deduced a trap composed of 333 places in 406 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:06] [INFO ] Deduced a trap composed of 23 places in 315 ms of which 37 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2112 variables, and 53 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1400/1400 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:11] [INFO ] Deduced a trap composed of 152 places in 372 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:11] [INFO ] Deduced a trap composed of 207 places in 382 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:12] [INFO ] Deduced a trap composed of 332 places in 434 ms of which 167 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:12] [INFO ] Deduced a trap composed of 412 places in 420 ms of which 153 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:24] [INFO ] Deduced a trap composed of 343 places in 448 ms of which 168 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:27] [INFO ] Deduced a trap composed of 363 places in 481 ms of which 193 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:35] [INFO ] Deduced a trap composed of 387 places in 466 ms of which 196 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:59:36] [INFO ] Deduced a trap composed of 3 places in 283 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2112 variables, and 61 constraints, problems are : Problem set: 0 solved, 1400 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1400 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60928ms problems are : Problem set: 0 solved, 1400 unsolved
Search for dead transitions found 0 dead transitions in 60932ms
Finished structural reductions in LTL mode , in 1 iterations and 115555 ms. Remains : 730/730 places, 1402/1402 transitions.
Built C files in :
/tmp/ltsmin16618467324981474678
[2025-06-03 00:59:37] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16618467324981474678
Running compilation step : cd /tmp/ltsmin16618467324981474678;'/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 2475 ms.
Running link step : cd /tmp/ltsmin16618467324981474678;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16618467324981474678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10204877493124564112.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 00:59:52] [INFO ] Flatten gal took : 69 ms
[2025-06-03 00:59:52] [INFO ] Flatten gal took : 63 ms
[2025-06-03 00:59:52] [INFO ] Time to serialize gal into /tmp/LTL246648113430100847.gal : 17 ms
[2025-06-03 00:59:52] [INFO ] Time to serialize properties into /tmp/LTL14032424704996956801.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/LTL246648113430100847.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4447930502233649267.hoa' '-atoms' '/tmp/LTL14032424704996956801.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/LTL14032424704996956801.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4447930502233649267.hoa
Detected timeout of ITS tools.
[2025-06-03 01:00:07] [INFO ] Flatten gal took : 52 ms
[2025-06-03 01:00:08] [INFO ] Flatten gal took : 105 ms
[2025-06-03 01:00:08] [INFO ] Time to serialize gal into /tmp/LTL13193309845611272740.gal : 9 ms
[2025-06-03 01:00:08] [INFO ] Time to serialize properties into /tmp/LTL2689562995507995527.ltl : 15 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/LTL13193309845611272740.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2689562995507995527.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("((((((P_2321_0>=1)&&(TryAllocateOneTaskE_0>=1))||((P_2321_1>=1)&&(TryAllocateOneTaskE_1>=1)))||(((P_2321_2>=1)&&(TryAllocateOne...1214
Formula 0 simplified : G!"((((((P_2321_0>=1)&&(TryAllocateOneTaskE_0>=1))||((P_2321_1>=1)&&(TryAllocateOneTaskE_1>=1)))||(((P_2321_2>=1)&&(TryAllocateOneTa...1196
Detected timeout of ITS tools.
[2025-06-03 01:00:23] [INFO ] Flatten gal took : 51 ms
[2025-06-03 01:00:23] [INFO ] Applying decomposition
[2025-06-03 01:00:23] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17732988036228566054.txt' '-o' '/tmp/graph17732988036228566054.bin' '-w' '/tmp/graph17732988036228566054.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17732988036228566054.bin' '-l' '-1' '-v' '-w' '/tmp/graph17732988036228566054.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:00:23] [INFO ] Decomposing Gal with order
[2025-06-03 01:00:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:00:23] [INFO ] Removed a total of 1240 redundant transitions.
[2025-06-03 01:00:23] [INFO ] Flatten gal took : 250 ms
[2025-06-03 01:00:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 181 labels/synchronizations in 37 ms.
[2025-06-03 01:00:23] [INFO ] Time to serialize gal into /tmp/LTL16366558880973717356.gal : 19 ms
[2025-06-03 01:00:23] [INFO ] Time to serialize properties into /tmp/LTL5096541783274655071.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16366558880973717356.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5096541783274655071.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("((((((i11.i0.u69.P_2321_0>=1)&&(i1.u12.TryAllocateOneTaskE_0>=1))||((i10.i0.u70.P_2321_1>=1)&&(i1.u13.TryAllocateOneTaskE_1>=1)...1666
Formula 0 simplified : G!"((((((i11.i0.u69.P_2321_0>=1)&&(i1.u12.TryAllocateOneTaskE_0>=1))||((i10.i0.u70.P_2321_1>=1)&&(i1.u13.TryAllocateOneTaskE_1>=1)))...1648
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-01 finished in 512933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||F(p1))))'
Support contains 20 out of 742 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 742/742 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 740 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 730 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 730 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 720 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 720 transition count 1392
Applied a total of 42 rules in 31 ms. Remains 720 /742 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2025-06-03 01:00:38] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 720 cols
[2025-06-03 01:00:38] [INFO ] Computed 42 invariants in 25 ms
[2025-06-03 01:00:38] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 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 718/2092 variables, and 40 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:03] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:03] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:03] [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-03 01:01:03] [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-03 01:01:03] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:03] [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-03 01:01:03] [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-03 01:01:03] [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-03 01:01:03] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:04] [INFO ] Deduced a trap composed of 197 places in 362 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:05] [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-03 01:01:05] [INFO ] Deduced a trap composed of 402 places in 404 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:07] [INFO ] Deduced a trap composed of 362 places in 447 ms of which 177 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:09] [INFO ] Deduced a trap composed of 23 places in 310 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:09] [INFO ] Deduced a trap composed of 333 places in 412 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:18] [INFO ] Deduced a trap composed of 357 places in 399 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:18] [INFO ] Deduced a trap composed of 490 places in 412 ms of which 156 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 57 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40938ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 40940ms
[2025-06-03 01:01:19] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:01:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:01:20] [INFO ] Implicit Places using invariants in 931 ms returned []
[2025-06-03 01:01:20] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:01:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:01:21] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 01:01:33] [INFO ] Implicit Places using invariants and state equation in 12632 ms returned []
Implicit Place search using SMT with State Equation took 13565 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2025-06-03 01:01:33] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:01:33] [INFO ] Invariant cache hit.
[2025-06-03 01:01:33] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:52] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:52] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:52] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:52] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:52] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:52] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:52] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:53] [INFO ] Deduced a trap composed of 64 places in 332 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:54] [INFO ] Deduced a trap composed of 197 places in 386 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:59] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:01:59] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 3 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 718/2092 variables, and 51 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:08] [INFO ] Deduced a trap composed of 322 places in 386 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:20] [INFO ] Deduced a trap composed of 490 places in 423 ms of which 168 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:23] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:29] [INFO ] Deduced a trap composed of 333 places in 404 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:29] [INFO ] Deduced a trap composed of 366 places in 402 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:30] [INFO ] Deduced a trap composed of 362 places in 408 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:02:31] [INFO ] Deduced a trap composed of 57 places in 159 ms of which 32 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 58 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60888ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 60894ms
Starting structural reductions in LTL mode, iteration 1 : 720/742 places, 1392/1412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115439 ms. Remains : 720/742 places, 1392/1412 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-02
Product exploration explored 100000 steps with 7643 reset in 279 ms.
Product exploration explored 100000 steps with 7624 reset in 304 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) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 49 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2025-06-03 01:02:35] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:02:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 01:02:36] [INFO ] [Real]Absence check using 13 positive place invariants in 318 ms returned sat
[2025-06-03 01:02:37] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 1316 ms returned sat
[2025-06-03 01:02:43] [INFO ] [Real]Absence check using state equation in 5694 ms returned sat
[2025-06-03 01:02:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 01:02:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 203 ms returned sat
[2025-06-03 01:02:45] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 1098 ms returned sat
[2025-06-03 01:02:57] [INFO ] [Nat]Absence check using state equation in 11793 ms returned sat
[2025-06-03 01:02:57] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 01:02:58] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 01:02:58] [INFO ] [Nat]Added 120 Read/Feed constraints in 1320 ms returned unknown
Could not prove EG (NOT p1)
Support contains 10 out of 720 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 720/720 places, 1392/1392 transitions.
Applied a total of 0 rules in 13 ms. Remains 720 /720 variables (removed 0) and now considering 1392/1392 (removed 0) transitions.
Running 1390 sub problems to find dead transitions.
[2025-06-03 01:02:58] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:02:58] [INFO ] Invariant cache hit.
[2025-06-03 01:02:58] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:17] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:17] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:17] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:17] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:17] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:17] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:17] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:18] [INFO ] Deduced a trap composed of 64 places in 347 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:19] [INFO ] Deduced a trap composed of 197 places in 380 ms of which 135 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 49 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:22] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:24] [INFO ] Deduced a trap composed of 64 places in 342 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:24] [INFO ] Deduced a trap composed of 322 places in 379 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:25] [INFO ] Deduced a trap composed of 402 places in 435 ms of which 177 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:25] [INFO ] Deduced a trap composed of 57 places in 206 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:35] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:36] [INFO ] Deduced a trap composed of 357 places in 434 ms of which 177 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:03:37] [INFO ] Deduced a trap composed of 490 places in 412 ms of which 156 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 57 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40951ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 40953ms
[2025-06-03 01:03:39] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:03:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:03:40] [INFO ] Implicit Places using invariants in 935 ms returned []
[2025-06-03 01:03:40] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:03:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:03:41] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 01:03:53] [INFO ] Implicit Places using invariants and state equation in 12561 ms returned []
Implicit Place search using SMT with State Equation took 13498 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2025-06-03 01:03:53] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:03:53] [INFO ] Invariant cache hit.
[2025-06-03 01:03:53] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:11] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:11] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:11] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:11] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:11] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:11] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:12] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:12] [INFO ] Deduced a trap composed of 64 places in 312 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:13] [INFO ] Deduced a trap composed of 197 places in 382 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:18] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:18] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 51 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:28] [INFO ] Deduced a trap composed of 322 places in 400 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:39] [INFO ] Deduced a trap composed of 490 places in 417 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:42] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:48] [INFO ] Deduced a trap composed of 333 places in 396 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:49] [INFO ] Deduced a trap composed of 366 places in 384 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:49] [INFO ] Deduced a trap composed of 362 places in 413 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:04:51] [INFO ] Deduced a trap composed of 57 places in 167 ms of which 32 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 6)
(s1 4)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 10)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 1)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 1)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s348 0)
(s349 0)
(s350 1)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s371 1)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 58 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60894ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 60899ms
Finished structural reductions in LTL mode , in 1 iterations and 115373 ms. Remains : 720/720 places, 1392/1392 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 63 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 60 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2025-06-03 01:04:54] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:04:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 01:04:55] [INFO ] [Real]Absence check using 13 positive place invariants in 315 ms returned sat
[2025-06-03 01:04:56] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 1305 ms returned sat
[2025-06-03 01:05:02] [INFO ] [Real]Absence check using state equation in 5643 ms returned sat
[2025-06-03 01:05:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 01:05:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 202 ms returned sat
[2025-06-03 01:05:04] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 1078 ms returned sat
[2025-06-03 01:05:16] [INFO ] [Nat]Absence check using state equation in 11662 ms returned sat
[2025-06-03 01:05:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 01:05:17] [INFO ] [Nat]Added 120 Read/Feed constraints in 1334 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:17] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 4 ms to minimize.
[2025-06-03 01:05:17] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 137 ms
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7622 reset in 306 ms.
Product exploration explored 100000 steps with 7644 reset in 310 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 10 out of 720 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 720/720 places, 1392/1392 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 720 transition count 1392
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 90 Pre rules applied. Total rules applied 50 place count 720 transition count 1482
Deduced a syphon composed of 140 places in 1 ms
Iterating global reduction 1 with 90 rules applied. Total rules applied 140 place count 720 transition count 1482
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 160 place count 700 transition count 1462
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 180 place count 700 transition count 1462
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 200 places in 0 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 260 place count 700 transition count 1462
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 300 place count 660 transition count 1422
Deduced a syphon composed of 170 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 340 place count 660 transition count 1422
Deduced a syphon composed of 170 places in 1 ms
Applied a total of 340 rules in 80 ms. Remains 660 /720 variables (removed 60) and now considering 1422/1392 (removed -30) transitions.
Running 1420 sub problems to find dead transitions.
[2025-06-03 01:05:18] [INFO ] Flow matrix only has 1402 transitions (discarded 20 similar events)
// Phase 1: matrix 1402 rows 660 cols
[2025-06-03 01:05:18] [INFO ] Computed 42 invariants in 18 ms
[2025-06-03 01:05:18] [INFO ] State equation strengthened by 160 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/658 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/658 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1420 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:37] [INFO ] Deduced a trap composed of 41 places in 246 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:37] [INFO ] Deduced a trap composed of 41 places in 218 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:37] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:38] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:38] [INFO ] Deduced a trap composed of 41 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 01:05:38] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:38] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:38] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:38] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:38] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:39] [INFO ] Deduced a trap composed of 173 places in 366 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:39] [INFO ] Deduced a trap composed of 182 places in 361 ms of which 95 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 658/2062 variables, and 52 constraints, problems are : Problem set: 20 solved, 1400 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/660 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1420/1420 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 1400 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/658 variables, 12/12 constraints. Problems are: Problem set: 20 solved, 1400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/658 variables, 28/40 constraints. Problems are: Problem set: 20 solved, 1400 unsolved
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1401 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/658 variables, 12/52 constraints. Problems are: Problem set: 250 solved, 1170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:56] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:05:56] [INFO ] Deduced a trap composed of 163 places in 367 ms of which 98 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 658/2062 variables, and 54 constraints, problems are : Problem set: 250 solved, 1170 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/660 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1420 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41183ms problems are : Problem set: 250 solved, 1170 unsolved
Search for dead transitions found 250 dead transitions in 41186ms
Found 250 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 250 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 250 transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:05:59] [INFO ] Redundant transitions in 10 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 660/720 places, 1172/1392 transitions.
Graph (complete) has 3206 edges and 660 vertex of which 500 are kept as prefixes of interest. Removing 160 places using SCC suffix rule.6 ms
Discarding 160 places :
Also discarding 0 output transitions
Deduced a syphon composed of 10 places in 1 ms
Applied a total of 1 rules in 26 ms. Remains 500 /660 variables (removed 160) and now considering 1172/1172 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 500/720 places, 1172/1392 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41321 ms. Remains : 500/720 places, 1172/1392 transitions.
Built C files in :
/tmp/ltsmin9037167848360320477
[2025-06-03 01:05:59] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9037167848360320477
Running compilation step : cd /tmp/ltsmin9037167848360320477;'/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 2536 ms.
Running link step : cd /tmp/ltsmin9037167848360320477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin9037167848360320477;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10493577719073502029.hoa' '--buchi-type=spotba'
LTSmin run took 7680 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-02 finished in 331302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(p1)))))'
Support contains 22 out of 742 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 742/742 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 740 transition count 1342
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 670 transition count 1342
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 140 place count 670 transition count 1252
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 320 place count 580 transition count 1252
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 330 place count 570 transition count 1242
Iterating global reduction 2 with 10 rules applied. Total rules applied 340 place count 570 transition count 1242
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 440 place count 520 transition count 1192
Applied a total of 440 rules in 84 ms. Remains 520 /742 variables (removed 222) and now considering 1192/1412 (removed 220) transitions.
Running 1190 sub problems to find dead transitions.
[2025-06-03 01:06:10] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
// Phase 1: matrix 1172 rows 520 cols
[2025-06-03 01:06:10] [INFO ] Computed 42 invariants in 12 ms
[2025-06-03 01:06:10] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:22] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:23] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:23] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:23] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:23] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:23] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:23] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:23] [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 01:06:23] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:23] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:24] [INFO ] Deduced a trap composed of 203 places in 276 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:24] [INFO ] Deduced a trap composed of 193 places in 295 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:25] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:26] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1692 variables, and 54 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1190/1190 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1190 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:47] [INFO ] Deduced a trap composed of 222 places in 293 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:06:48] [INFO ] Deduced a trap composed of 212 places in 309 ms of which 88 ms to minimize.
(s258 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 9)
(s173 0)
(s174 1)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1692 variables, and 56 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1190 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40825ms problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 40827ms
[2025-06-03 01:06:51] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2025-06-03 01:06:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:06:51] [INFO ] Implicit Places using invariants in 722 ms returned []
[2025-06-03 01:06:51] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2025-06-03 01:06:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:06:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 01:06:59] [INFO ] Implicit Places using invariants and state equation in 7309 ms returned []
Implicit Place search using SMT with State Equation took 8033 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:06:59] [INFO ] Redundant transitions in 62 ms returned []
Running 1190 sub problems to find dead transitions.
[2025-06-03 01:06:59] [INFO ] Flow matrix only has 1172 transitions (discarded 20 similar events)
[2025-06-03 01:06:59] [INFO ] Invariant cache hit.
[2025-06-03 01:06:59] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:11] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:11] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:12] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:12] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:12] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:12] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:12] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:12] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:12] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:12] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:12] [INFO ] Deduced a trap composed of 203 places in 246 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:13] [INFO ] Deduced a trap composed of 193 places in 267 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:13] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:15] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:18] [INFO ] Deduced a trap composed of 193 places in 272 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:23] [INFO ] Deduced a trap composed of 222 places in 262 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:24] [INFO ] Deduced a trap composed of 117 places in 243 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:07:28] [INFO ] Deduced a trap composed of 206 places in 281 ms of which 82 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1692 variables, and 58 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1190/1190 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1692 variables, and 58 constraints, problems are : Problem set: 0 solved, 1190 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1190 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60866ms problems are : Problem set: 0 solved, 1190 unsolved
Search for dead transitions found 0 dead transitions in 60868ms
Starting structural reductions in SI_LTL mode, iteration 1 : 520/742 places, 1192/1412 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109886 ms. Remains : 520/742 places, 1192/1412 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-03
Product exploration explored 100000 steps with 102 reset in 429 ms.
Stack based approach found an accepted trace after 2196 steps with 0 reset with depth 2197 and stack size 2197 in 11 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-03 finished in 110447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p0)))||F(p1))))'
Support contains 36 out of 742 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 742/742 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 740 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 730 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 730 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 720 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 720 transition count 1392
Applied a total of 42 rules in 33 ms. Remains 720 /742 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2025-06-03 01:08:00] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 720 cols
[2025-06-03 01:08:00] [INFO ] Computed 42 invariants in 19 ms
[2025-06-03 01:08:00] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 40 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:24] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:24] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:24] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:25] [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-03 01:08: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-03 01:08:25] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:25] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:25] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:25] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:26] [INFO ] Deduced a trap composed of 197 places in 353 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:26] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:27] [INFO ] Deduced a trap composed of 402 places in 399 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:28] [INFO ] Deduced a trap composed of 362 places in 452 ms of which 178 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:30] [INFO ] Deduced a trap composed of 23 places in 312 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:31] [INFO ] Deduced a trap composed of 333 places in 402 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:39] [INFO ] Deduced a trap composed of 357 places in 387 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:08:39] [INFO ] Deduced a trap composed of 490 places in 399 ms of which 155 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 57 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40877ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 40879ms
[2025-06-03 01:08:41] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:08:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:08:42] [INFO ] Implicit Places using invariants in 831 ms returned []
[2025-06-03 01:08:42] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:08:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:08:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 01:08:52] [INFO ] Implicit Places using invariants and state equation in 10298 ms returned []
Implicit Place search using SMT with State Equation took 11133 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2025-06-03 01:08:52] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:08:52] [INFO ] Invariant cache hit.
[2025-06-03 01:08:52] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:11] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:11] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:11] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:11] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:11] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:11] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:11] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:12] [INFO ] Deduced a trap composed of 64 places in 335 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:12] [INFO ] Deduced a trap composed of 197 places in 372 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:17] [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-03 01:09:18] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 51 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:27] [INFO ] Deduced a trap composed of 322 places in 374 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:38] [INFO ] Deduced a trap composed of 490 places in 409 ms of which 165 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:41] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:47] [INFO ] Deduced a trap composed of 333 places in 389 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:47] [INFO ] Deduced a trap composed of 366 places in 389 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:48] [INFO ] Deduced a trap composed of 362 places in 397 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:49] [INFO ] Deduced a trap composed of 57 places in 159 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:09:53] [INFO ] Deduced a trap composed of 402 places in 394 ms of which 146 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60865ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 60870ms
Starting structural reductions in LTL mode, iteration 1 : 720/742 places, 1392/1412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112924 ms. Remains : 720/742 places, 1392/1412 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-05
Product exploration explored 100000 steps with 1443 reset in 417 ms.
Product exploration explored 100000 steps with 1415 reset in 429 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 p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (10 resets) in 443 ms. (90 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (9 resets) in 642 ms. (62 steps per ms) remains 1/1 properties
[2025-06-03 01:09:55] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:09:55] [INFO ] Invariant cache hit.
[2025-06-03 01:09:55] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 343/379 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/382 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 710/2092 variables, and 33 constraints, problems are : Problem set: 1 solved, 0 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 5/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 332ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-05 finished in 114891 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)&&(p1||X(X(F(p1)))))))'
Support contains 33 out of 742 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 742/742 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 740 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 650 transition count 1322
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 180 place count 650 transition count 1262
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 300 place count 590 transition count 1262
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 310 place count 580 transition count 1252
Iterating global reduction 2 with 10 rules applied. Total rules applied 320 place count 580 transition count 1252
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 480 place count 500 transition count 1172
Applied a total of 480 rules in 58 ms. Remains 500 /742 variables (removed 242) and now considering 1172/1412 (removed 240) transitions.
Running 1170 sub problems to find dead transitions.
[2025-06-03 01:09:55] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
// Phase 1: matrix 1152 rows 500 cols
[2025-06-03 01:09:55] [INFO ] Computed 42 invariants in 12 ms
[2025-06-03 01:09:55] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:07] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:07] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:07] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:07] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:07] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:07] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:07] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:07] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:07] [INFO ] Deduced a trap composed of 42 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 01:10:08] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:08] [INFO ] Deduced a trap composed of 193 places in 300 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:08] [INFO ] Deduced a trap composed of 202 places in 298 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:09] [INFO ] Deduced a trap composed of 183 places in 276 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:09] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:11] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/1652 variables, and 55 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1170/1170 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1170 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/1652 variables, and 55 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1170 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41036ms problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 41038ms
[2025-06-03 01:10:36] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2025-06-03 01:10:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:10:37] [INFO ] Implicit Places using invariants in 750 ms returned []
[2025-06-03 01:10:37] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2025-06-03 01:10:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:10:37] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 01:10:44] [INFO ] Implicit Places using invariants and state equation in 7187 ms returned []
Implicit Place search using SMT with State Equation took 7942 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:10:44] [INFO ] Redundant transitions in 21 ms returned []
Running 1170 sub problems to find dead transitions.
[2025-06-03 01:10:44] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2025-06-03 01:10:44] [INFO ] Invariant cache hit.
[2025-06-03 01:10:44] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:56] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:56] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:56] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:56] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:56] [INFO ] Deduced a trap composed of 42 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 01:10:56] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:56] [INFO ] Deduced a trap composed of 42 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 01:10:56] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:56] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:57] [INFO ] Deduced a trap composed of 193 places in 303 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:57] [INFO ] Deduced a trap composed of 202 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-03 01:10:58] [INFO ] Deduced a trap composed of 183 places in 274 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:58] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:10:59] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:11:10] [INFO ] Deduced a trap composed of 183 places in 256 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:11:11] [INFO ] Deduced a trap composed of 152 places in 236 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:11:12] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/1652 variables, and 57 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1170/1170 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/1652 variables, and 57 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1170 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60861ms problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 60863ms
Starting structural reductions in SI_LTL mode, iteration 1 : 500/742 places, 1172/1412 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109936 ms. Remains : 500/742 places, 1172/1412 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-06
Product exploration explored 100000 steps with 32 reset in 491 ms.
Stack based approach found an accepted trace after 800 steps with 0 reset with depth 801 and stack size 801 in 4 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-06 finished in 110632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U X(G(p1))) U X(X((!p2||X(F(!p3)))))))'
Support contains 77 out of 742 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 742/742 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 740 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 730 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 730 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 720 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 720 transition count 1392
Applied a total of 42 rules in 32 ms. Remains 720 /742 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2025-06-03 01:11:46] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 720 cols
[2025-06-03 01:11:46] [INFO ] Computed 42 invariants in 16 ms
[2025-06-03 01:11:46] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 40 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:10] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:10] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:10] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:10] [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-03 01:12:10] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:10] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:10] [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-03 01:12:11] [INFO ] Deduced a trap composed of 64 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 01:12:11] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:12] [INFO ] Deduced a trap composed of 197 places in 350 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:12] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:13] [INFO ] Deduced a trap composed of 402 places in 408 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:14] [INFO ] Deduced a trap composed of 362 places in 449 ms of which 177 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:16] [INFO ] Deduced a trap composed of 23 places in 302 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:16] [INFO ] Deduced a trap composed of 333 places in 395 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:25] [INFO ] Deduced a trap composed of 357 places in 389 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:25] [INFO ] Deduced a trap composed of 490 places in 396 ms of which 155 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 57 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40889ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 40891ms
[2025-06-03 01:12:27] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:12:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:12:27] [INFO ] Implicit Places using invariants in 681 ms returned []
[2025-06-03 01:12:27] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:12:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:12:28] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 01:12:40] [INFO ] Implicit Places using invariants and state equation in 12864 ms returned []
Implicit Place search using SMT with State Equation took 13549 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2025-06-03 01:12:40] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:12:40] [INFO ] Invariant cache hit.
[2025-06-03 01:12:40] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:58] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:59] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:59] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:59] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:59] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:59] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:12:59] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:00] [INFO ] Deduced a trap composed of 64 places in 324 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:00] [INFO ] Deduced a trap composed of 197 places in 381 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:05] [INFO ] Deduced a trap composed of 64 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-03 01:13:05] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 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 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 9.0)
(s203 1.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 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 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 718/2092 variables, and 51 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:15] [INFO ] Deduced a trap composed of 322 places in 392 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:26] [INFO ] Deduced a trap composed of 490 places in 423 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:30] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:35] [INFO ] Deduced a trap composed of 333 places in 393 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:36] [INFO ] Deduced a trap composed of 366 places in 396 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:37] [INFO ] Deduced a trap composed of 362 places in 395 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:13:38] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 32 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 58 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60875ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 60879ms
Starting structural reductions in LTL mode, iteration 1 : 720/742 places, 1392/1412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115357 ms. Remains : 720/742 places, 1392/1412 transitions.
Stuttering acceptance computed with spot in 757 ms :[(AND p2 p3), (AND (NOT p1) p2 p3), (AND p2 p3), (AND p2 p3 (NOT p1)), (AND (NOT p1) p2 p3), (AND p3 (NOT p1) p2), (AND (NOT p1) p2 p3), (AND p2 p3), (AND p3 p2 (NOT p1)), (AND p2 p3), p3, (AND (NOT p1) p3), (AND p3 (NOT p1)), (AND (NOT p1) p2 p3), (AND p3 (NOT p1) p2), (AND (NOT p1) p2 p3), (AND p2 p3), (AND p3 p2 (NOT p1)), (AND p3 p2)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 1582 ms.
Product exploration explored 100000 steps with 33333 reset in 1606 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 19 ms. Reduced automaton from 19 states, 40 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-07 finished in 119358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U (X(X(p0)) U G(p1))))'
Support contains 21 out of 742 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 742/742 places, 1412/1412 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 732 transition count 1402
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 732 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 722 transition count 1392
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 722 transition count 1392
Applied a total of 40 rules in 37 ms. Remains 722 /742 variables (removed 20) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2025-06-03 01:13:45] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 722 cols
[2025-06-03 01:13:45] [INFO ] Computed 44 invariants in 21 ms
[2025-06-03 01:13:45] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:14:06] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2094 variables, and 41 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/722 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:14:15] [INFO ] Deduced a trap composed of 64 places in 146 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:14:15] [INFO ] Deduced a trap composed of 64 places in 180 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:14:16] [INFO ] Deduced a trap composed of 64 places in 172 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:14:16] [INFO ] Deduced a trap composed of 64 places in 140 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:14:16] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:14:16] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:14:16] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:14:16] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:14:18] [INFO ] Deduced a trap composed of 64 places in 343 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:14:18] [INFO ] Deduced a trap composed of 197 places in 367 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:14:26] [INFO ] Deduced a trap composed of 97 places in 243 ms of which 59 ms to minimize.
SMT process timed out in 41010ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41012ms
[2025-06-03 01:14:26] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:14:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:14:28] [INFO ] Implicit Places using invariants in 1468 ms returned []
[2025-06-03 01:14:28] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:14:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:14:28] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 01:14:43] [INFO ] Implicit Places using invariants and state equation in 15936 ms returned []
Implicit Place search using SMT with State Equation took 17415 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2025-06-03 01:14:44] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:14:44] [INFO ] Invariant cache hit.
[2025-06-03 01:14:44] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:02] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:02] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:02] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:02] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:02] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:02] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:02] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:03] [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-03 01:15:03] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:03] [INFO ] Deduced a trap composed of 353 places in 456 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:04] [INFO ] Deduced a trap composed of 197 places in 349 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:04] [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-03 01:15:05] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:06] [INFO ] Deduced a trap composed of 362 places in 426 ms of which 164 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:06] [INFO ] Deduced a trap composed of 23 places in 305 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:07] [INFO ] Deduced a trap composed of 333 places in 398 ms of which 127 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 718/2094 variables, and 56 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/722 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:20] [INFO ] Deduced a trap composed of 402 places in 401 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:31] [INFO ] Deduced a trap composed of 490 places in 414 ms of which 161 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:39] [INFO ] Deduced a trap composed of 366 places in 397 ms of which 143 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2094 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/722 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60863ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 60866ms
Starting structural reductions in LTL mode, iteration 1 : 722/742 places, 1392/1412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119340 ms. Remains : 722/742 places, 1392/1412 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), false, false, false, false, p0, p0, (AND p0 (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-08
Product exploration explored 100000 steps with 1039 reset in 384 ms.
Product exploration explored 100000 steps with 1015 reset in 428 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 p1 (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 91 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), false, false, p0, p0, (AND (NOT p1) p0), false]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 21884 steps (5 resets) in 100 ms. (216 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT (AND p1 (NOT p0)))), (F (NOT p1)), (F p0), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 286 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), false, false, p0, p0, (AND (NOT p1) p0), false]
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), false, false, p0, p0, (AND (NOT p1) p0), false]
Support contains 21 out of 722 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 722/722 places, 1392/1392 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 722 transition count 1352
Reduce places removed 40 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 50 rules applied. Total rules applied 90 place count 682 transition count 1342
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 100 place count 672 transition count 1342
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 100 place count 672 transition count 1252
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 280 place count 582 transition count 1252
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 320 place count 562 transition count 1232
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 330 place count 552 transition count 1222
Iterating global reduction 3 with 10 rules applied. Total rules applied 340 place count 552 transition count 1222
Applied a total of 340 rules in 56 ms. Remains 552 /722 variables (removed 170) and now considering 1222/1392 (removed 170) transitions.
Running 1220 sub problems to find dead transitions.
[2025-06-03 01:15:47] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
// Phase 1: matrix 1202 rows 552 cols
[2025-06-03 01:15:47] [INFO ] Computed 44 invariants in 22 ms
[2025-06-03 01:15:47] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/548 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:59] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:59] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:59] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:59] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:59] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:59] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:15:59] [INFO ] Deduced a trap composed of 47 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 01:15:59] [INFO ] Deduced a trap composed of 47 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 01:15:59] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:00] [INFO ] Deduced a trap composed of 203 places in 281 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:00] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:00] [INFO ] Deduced a trap composed of 223 places in 322 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:03] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 548/1754 variables, and 53 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1220/1220 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1220 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/548 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/548 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:21] [INFO ] Deduced a trap composed of 232 places in 292 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:22] [INFO ] Deduced a trap composed of 66 places in 276 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:24] [INFO ] Deduced a trap composed of 172 places in 273 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:25] [INFO ] Deduced a trap composed of 72 places in 231 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:25] [INFO ] Deduced a trap composed of 137 places in 255 ms of which 66 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/1754 variables, and 58 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1220 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40931ms problems are : Problem set: 0 solved, 1220 unsolved
Search for dead transitions found 0 dead transitions in 40933ms
[2025-06-03 01:16:28] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2025-06-03 01:16:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:16:28] [INFO ] Implicit Places using invariants in 888 ms returned []
[2025-06-03 01:16:28] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2025-06-03 01:16:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:16:29] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 01:16:37] [INFO ] Implicit Places using invariants and state equation in 8930 ms returned []
Implicit Place search using SMT with State Equation took 9822 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:16:37] [INFO ] Redundant transitions in 15 ms returned []
Running 1220 sub problems to find dead transitions.
[2025-06-03 01:16:37] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2025-06-03 01:16:37] [INFO ] Invariant cache hit.
[2025-06-03 01:16:37] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/548 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:51] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:51] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:51] [INFO ] Deduced a trap composed of 47 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-03 01:16:51] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:51] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:51] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:52] [INFO ] Deduced a trap composed of 47 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 01:16:52] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:52] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:52] [INFO ] Deduced a trap composed of 47 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 01:16:55] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:58] [INFO ] Deduced a trap composed of 203 places in 283 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:58] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:59] [INFO ] Deduced a trap composed of 223 places in 311 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:16:59] [INFO ] Deduced a trap composed of 232 places in 311 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:00] [INFO ] Deduced a trap composed of 124 places in 295 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:01] [INFO ] Deduced a trap composed of 133 places in 284 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:01] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:03] [INFO ] Deduced a trap composed of 172 places in 280 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:03] [INFO ] Deduced a trap composed of 137 places in 256 ms of which 68 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/548 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 548/1754 variables, and 60 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1220/1220 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/548 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/548 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:18] [INFO ] Deduced a trap composed of 360 places in 321 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:25] [INFO ] Deduced a trap composed of 236 places in 282 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:26] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 53 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/548 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 1220 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 548/1754 variables, and 63 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1220 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60818ms problems are : Problem set: 0 solved, 1220 unsolved
Search for dead transitions found 0 dead transitions in 60820ms
Starting structural reductions in SI_LTL mode, iteration 1 : 552/722 places, 1222/1392 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111654 ms. Remains : 552/722 places, 1222/1392 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (OR p1 p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 137 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), false, false, p0, p0, (AND (NOT p1) p0), false]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 1753 steps (1 resets) in 21 ms. (79 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (OR p1 p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (OR p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 383 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), false, false, p0, p0, (AND (NOT p1) p0), false]
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), false, false, p0, p0, (AND (NOT p1) p0), false]
Stuttering acceptance computed with spot in 271 ms :[(NOT p1), false, false, p0, p0, (AND (NOT p1) p0), false]
Product exploration explored 100000 steps with 33247 reset in 591 ms.
Product exploration explored 100000 steps with 33320 reset in 570 ms.
Built C files in :
/tmp/ltsmin10485645862484101948
[2025-06-03 01:17:41] [INFO ] Computing symmetric may disable matrix : 1222 transitions.
[2025-06-03 01:17:41] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:17:41] [INFO ] Computing symmetric may enable matrix : 1222 transitions.
[2025-06-03 01:17:41] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:17:41] [INFO ] Computing Do-Not-Accords matrix : 1222 transitions.
[2025-06-03 01:17:41] [INFO ] Computation of Completed DNA matrix. took 47 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:17:41] [INFO ] Built C files in 371ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10485645862484101948
Running compilation step : cd /tmp/ltsmin10485645862484101948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10485645862484101948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10485645862484101948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 21 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 1222/1222 transitions.
Applied a total of 0 rules in 16 ms. Remains 552 /552 variables (removed 0) and now considering 1222/1222 (removed 0) transitions.
Running 1220 sub problems to find dead transitions.
[2025-06-03 01:17:44] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2025-06-03 01:17:44] [INFO ] Invariant cache hit.
[2025-06-03 01:17:44] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/548 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:58] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:58] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:58] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:58] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:58] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:58] [INFO ] Deduced a trap composed of 47 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 01:17:58] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:59] [INFO ] Deduced a trap composed of 57 places in 154 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:59] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:17:59] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:02] [INFO ] Deduced a trap composed of 47 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 01:18:05] [INFO ] Deduced a trap composed of 203 places in 279 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:05] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 29 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 548/1754 variables, and 53 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1220/1220 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1220 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/548 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/548 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:09] [INFO ] Deduced a trap composed of 172 places in 264 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:14] [INFO ] Deduced a trap composed of 227 places in 271 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:19] [INFO ] Deduced a trap composed of 223 places in 320 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:20] [INFO ] Deduced a trap composed of 232 places in 273 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:23] [INFO ] Deduced a trap composed of 72 places in 250 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:23] [INFO ] Deduced a trap composed of 137 places in 252 ms of which 68 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/1754 variables, and 59 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1220 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40834ms problems are : Problem set: 0 solved, 1220 unsolved
Search for dead transitions found 0 dead transitions in 40836ms
[2025-06-03 01:18:25] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2025-06-03 01:18:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:18:26] [INFO ] Implicit Places using invariants in 883 ms returned []
[2025-06-03 01:18:26] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2025-06-03 01:18:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:18:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 01:18:35] [INFO ] Implicit Places using invariants and state equation in 8698 ms returned []
Implicit Place search using SMT with State Equation took 9581 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:18:35] [INFO ] Redundant transitions in 16 ms returned []
Running 1220 sub problems to find dead transitions.
[2025-06-03 01:18:35] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
[2025-06-03 01:18:35] [INFO ] Invariant cache hit.
[2025-06-03 01:18:35] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/548 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:48] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:48] [INFO ] Deduced a trap composed of 47 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-03 01:18:48] [INFO ] Deduced a trap composed of 47 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-03 01:18:48] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:49] [INFO ] Deduced a trap composed of 47 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 01:18:49] [INFO ] Deduced a trap composed of 47 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:49] [INFO ] Deduced a trap composed of 47 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 01:18:49] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:49] [INFO ] Deduced a trap composed of 47 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 01:18:49] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:53] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:56] [INFO ] Deduced a trap composed of 203 places in 273 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:56] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:57] [INFO ] Deduced a trap composed of 223 places in 315 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:57] [INFO ] Deduced a trap composed of 232 places in 316 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:58] [INFO ] Deduced a trap composed of 124 places in 292 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:58] [INFO ] Deduced a trap composed of 133 places in 295 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:18:59] [INFO ] Deduced a trap composed of 3 places in 221 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:00] [INFO ] Deduced a trap composed of 172 places in 285 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:01] [INFO ] Deduced a trap composed of 137 places in 263 ms of which 68 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/548 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 548/1754 variables, and 60 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1220/1220 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/548 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/548 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:16] [INFO ] Deduced a trap composed of 360 places in 315 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:23] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:19:24] [INFO ] Deduced a trap composed of 66 places in 258 ms of which 54 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/548 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 1220 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 548/1754 variables, and 63 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/32 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1220 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60849ms problems are : Problem set: 0 solved, 1220 unsolved
Search for dead transitions found 0 dead transitions in 60850ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111307 ms. Remains : 552/552 places, 1222/1222 transitions.
Built C files in :
/tmp/ltsmin13982226450532861457
[2025-06-03 01:19:36] [INFO ] Computing symmetric may disable matrix : 1222 transitions.
[2025-06-03 01:19:36] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:19:36] [INFO ] Computing symmetric may enable matrix : 1222 transitions.
[2025-06-03 01:19:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:19:36] [INFO ] Computing Do-Not-Accords matrix : 1222 transitions.
[2025-06-03 01:19:36] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:19:36] [INFO ] Built C files in 291ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13982226450532861457
Running compilation step : cd /tmp/ltsmin13982226450532861457;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13982226450532861457;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13982226450532861457;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-06-03 01:19:39] [INFO ] Flatten gal took : 147 ms
[2025-06-03 01:19:40] [INFO ] Flatten gal took : 124 ms
[2025-06-03 01:19:40] [INFO ] Time to serialize gal into /tmp/LTL3068868138382712189.gal : 18 ms
[2025-06-03 01:19:40] [INFO ] Time to serialize properties into /tmp/LTL11069577040742611160.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3068868138382712189.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10923643409660062028.hoa' '-atoms' '/tmp/LTL11069577040742611160.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11069577040742611160.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10923643409660062028.hoa
Detected timeout of ITS tools.
[2025-06-03 01:19:55] [INFO ] Flatten gal took : 48 ms
[2025-06-03 01:19:55] [INFO ] Flatten gal took : 46 ms
[2025-06-03 01:19:55] [INFO ] Time to serialize gal into /tmp/LTL1953264306375676171.gal : 7 ms
[2025-06-03 01:19:55] [INFO ] Time to serialize properties into /tmp/LTL9729179476694955891.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1953264306375676171.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9729179476694955891.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G(F(!("(((((((((cBlockedTasks>=10)&&(PollingAbort>=1))&&((Abort_Check_Sources_E_7>=1)&&(ORB_Lock>=1)))&&(AbourtToModifySrc_1>=1))|...5054
Formula 0 simplified : FG"(((((((((cBlockedTasks>=10)&&(PollingAbort>=1))&&((Abort_Check_Sources_E_7>=1)&&(ORB_Lock>=1)))&&(AbourtToModifySrc_1>=1))||((((c...5038
Detected timeout of ITS tools.
[2025-06-03 01:20:10] [INFO ] Flatten gal took : 43 ms
[2025-06-03 01:20:10] [INFO ] Applying decomposition
[2025-06-03 01:20:10] [INFO ] Flatten gal took : 42 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/graph12981634104203720270.txt' '-o' '/tmp/graph12981634104203720270.bin' '-w' '/tmp/graph12981634104203720270.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12981634104203720270.bin' '-l' '-1' '-v' '-w' '/tmp/graph12981634104203720270.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:20:10] [INFO ] Decomposing Gal with order
[2025-06-03 01:20:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:20:10] [INFO ] Removed a total of 1103 redundant transitions.
[2025-06-03 01:20:10] [INFO ] Flatten gal took : 117 ms
[2025-06-03 01:20:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 541 labels/synchronizations in 27 ms.
[2025-06-03 01:20:10] [INFO ] Time to serialize gal into /tmp/LTL15074298054282236336.gal : 11 ms
[2025-06-03 01:20:10] [INFO ] Time to serialize properties into /tmp/LTL3745382640478931127.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15074298054282236336.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3745382640478931127.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G(F(!("(((((((((i7.u25.cBlockedTasks>=10)&&(i7.u25.PollingAbort>=1))&&((i7.u25.Abort_Check_Sources_E_7>=1)&&(i7.u25.ORB_Lock>=1)))...6510
Formula 0 simplified : FG"(((((((((i7.u25.cBlockedTasks>=10)&&(i7.u25.PollingAbort>=1))&&((i7.u25.Abort_Check_Sources_E_7>=1)&&(i7.u25.ORB_Lock>=1)))&&(i7....6494
Detected timeout of ITS tools.
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-08 finished in 400275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p0||X(p1))))||G(!p1))))'
Support contains 26 out of 742 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 742/742 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 740 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 730 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 730 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 720 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 720 transition count 1392
Applied a total of 42 rules in 34 ms. Remains 720 /742 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2025-06-03 01:20:25] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 720 cols
[2025-06-03 01:20:25] [INFO ] Computed 42 invariants in 23 ms
[2025-06-03 01:20:25] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 40 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:50] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:50] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:50] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:50] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:50] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:50] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:50] [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-03 01:20:50] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:50] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:51] [INFO ] Deduced a trap composed of 197 places in 378 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:51] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:52] [INFO ] Deduced a trap composed of 402 places in 421 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:53] [INFO ] Deduced a trap composed of 362 places in 456 ms of which 177 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:56] [INFO ] Deduced a trap composed of 23 places in 303 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:20:56] [INFO ] Deduced a trap composed of 333 places in 401 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:21:05] [INFO ] Deduced a trap composed of 357 places in 396 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:21:05] [INFO ] Deduced a trap composed of 490 places in 415 ms of which 156 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 57 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40903ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 40905ms
[2025-06-03 01:21:06] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:21:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:21:07] [INFO ] Implicit Places using invariants in 997 ms returned []
[2025-06-03 01:21:07] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:21:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:21:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 01:21:19] [INFO ] Implicit Places using invariants and state equation in 11361 ms returned []
Implicit Place search using SMT with State Equation took 12360 ms to find 0 implicit places.
Running 1390 sub problems to find dead transitions.
[2025-06-03 01:21:19] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2025-06-03 01:21:19] [INFO ] Invariant cache hit.
[2025-06-03 01:21:19] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:21:37] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:21:37] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:21:37] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:21:37] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:21:37] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:21:37] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:21:38] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:21:38] [INFO ] Deduced a trap composed of 64 places in 324 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:21:39] [INFO ] Deduced a trap composed of 197 places in 420 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:21:44] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:21:44] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 3 ms to minimize.
(s99 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
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 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 718/2092 variables, and 51 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/718 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/718 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/718 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:21:54] [INFO ] Deduced a trap composed of 322 places in 385 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:22:05] [INFO ] Deduced a trap composed of 490 places in 433 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:22:08] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:22:14] [INFO ] Deduced a trap composed of 333 places in 408 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:22:14] [INFO ] Deduced a trap composed of 366 places in 396 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:22:15] [INFO ] Deduced a trap composed of 362 places in 401 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:22:17] [INFO ] Deduced a trap composed of 57 places in 160 ms of which 33 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 718/2092 variables, and 58 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/720 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60890ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 60892ms
Starting structural reductions in LTL mode, iteration 1 : 720/742 places, 1392/1412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114204 ms. Remains : 720/742 places, 1392/1412 transitions.
Stuttering acceptance computed with spot in 156 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-09
Product exploration explored 100000 steps with 11 reset in 375 ms.
Stack based approach found an accepted trace after 2288 steps with 0 reset with depth 2289 and stack size 2289 in 9 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-09 finished in 114777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0)) U (X(X(G(!p0)))||(X(X(!p0))&&G(!p1)))))'
Support contains 70 out of 742 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 742/742 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 740 transition count 1412
Applied a total of 2 rules in 16 ms. Remains 740 /742 variables (removed 2) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2025-06-03 01:22:20] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 740 cols
[2025-06-03 01:22:20] [INFO ] Computed 42 invariants in 24 ms
[2025-06-03 01:22:20] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:22:39] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:22:39] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:22:39] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:22:40] [INFO ] Deduced a trap composed of 66 places in 327 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:22:40] [INFO ] Deduced a trap composed of 162 places in 384 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:22:41] [INFO ] Deduced a trap composed of 66 places in 329 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:22:41] [INFO ] Deduced a trap composed of 66 places in 340 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:22:41] [INFO ] Deduced a trap composed of 66 places in 335 ms of which 75 ms to minimize.
SMT process timed out in 21165ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 21167ms
[2025-06-03 01:22:41] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 01:22:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:22:42] [INFO ] Implicit Places using invariants in 1048 ms returned []
[2025-06-03 01:22:42] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 01:22:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:22:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 01:22:58] [INFO ] Implicit Places using invariants and state equation in 16109 ms returned []
Implicit Place search using SMT with State Equation took 17160 ms to find 0 implicit places.
Running 1410 sub problems to find dead transitions.
[2025-06-03 01:22:58] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 01:22:58] [INFO ] Invariant cache hit.
[2025-06-03 01:22:58] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:23:17] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:23:17] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:23:17] [INFO ] Deduced a trap composed of 66 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:23:17] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:23:17] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:23:17] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:23:17] [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-03 01:23:17] [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-03 01:23:17] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:23:18] [INFO ] Deduced a trap composed of 353 places in 440 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:23:19] [INFO ] Deduced a trap composed of 217 places in 385 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:23:19] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:23:21] [INFO ] Deduced a trap composed of 363 places in 452 ms of which 177 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:23:21] [INFO ] Deduced a trap composed of 23 places in 312 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:23:21] [INFO ] Deduced a trap composed of 333 places in 405 ms of which 134 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 738/2132 variables, and 55 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/740 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/738 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:23:34] [INFO ] Deduced a trap composed of 342 places in 396 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:23:34] [INFO ] Deduced a trap composed of 422 places in 413 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:23:46] [INFO ] Deduced a trap composed of 491 places in 473 ms of which 212 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:23:46] [INFO ] Deduced a trap composed of 377 places in 420 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:23:55] [INFO ] Deduced a trap composed of 367 places in 412 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:23:56] [INFO ] Deduced a trap composed of 66 places in 347 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:23:57] [INFO ] Deduced a trap composed of 387 places in 408 ms of which 153 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/2132 variables, and 62 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/740 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60925ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 60931ms
Starting structural reductions in LTL mode, iteration 1 : 740/742 places, 1412/1412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99285 ms. Remains : 740/742 places, 1412/1412 transitions.
Stuttering acceptance computed with spot in 277 ms :[p0, p0, (AND p0 p1), (AND p0 p1), p0, true, (AND p0 p1), (AND (NOT p0) p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-13
Product exploration explored 100000 steps with 25025 reset in 771 ms.
Product exploration explored 100000 steps with 25034 reset in 788 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 129 ms. Reduced automaton from 8 states, 20 edges and 2 AP (stutter sensitive) to 8 states, 20 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[p0, p0, (AND p0 p1), (AND p0 p1), p0, true, (AND p0 p1), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (9 resets) in 176 ms. (225 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (9 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
[2025-06-03 01:24:02] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 01:24:02] [INFO ] Invariant cache hit.
[2025-06-03 01:24:02] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 555/625 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/638 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/638 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/646 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 736/2132 variables, and 39 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1248 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/740 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 555/625 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/625 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/638 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/638 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/646 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 736/2132 variables, and 39 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1325 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/740 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2583ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 70 out of 740 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 740/740 places, 1412/1412 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 740 transition count 1342
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 670 transition count 1342
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 140 place count 670 transition count 1312
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 200 place count 640 transition count 1312
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 210 place count 630 transition count 1302
Iterating global reduction 2 with 10 rules applied. Total rules applied 220 place count 630 transition count 1302
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 340 place count 570 transition count 1242
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 2 with 30 rules applied. Total rules applied 370 place count 570 transition count 1212
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 400 place count 540 transition count 1212
Applied a total of 400 rules in 124 ms. Remains 540 /740 variables (removed 200) and now considering 1212/1412 (removed 200) transitions.
Running 1210 sub problems to find dead transitions.
[2025-06-03 01:24:04] [INFO ] Flow matrix only has 1192 transitions (discarded 20 similar events)
// Phase 1: matrix 1192 rows 540 cols
[2025-06-03 01:24:04] [INFO ] Computed 42 invariants in 17 ms
[2025-06-03 01:24:04] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:24:17] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:24:18] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:24:18] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:24:18] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:24:18] [INFO ] Deduced a trap composed of 46 places in 148 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:24:18] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:24:18] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:24:19] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:24:19] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:24:19] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:24:19] [INFO ] Deduced a trap composed of 46 places in 249 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:24:19] [INFO ] Deduced a trap composed of 213 places in 277 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:24:20] [INFO ] Deduced a trap composed of 223 places in 320 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:24:20] [INFO ] Deduced a trap composed of 203 places in 319 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:24:20] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 31 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1732 variables, and 55 constraints, problems are : Problem set: 0 solved, 1210 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/540 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1210/1210 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1210 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/1732 variables, and 55 constraints, problems are : Problem set: 0 solved, 1210 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 28/29 constraints, State Equation: 0/540 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1210 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41297ms problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 41298ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41425 ms. Remains : 540/740 places, 1212/1412 transitions.
RANDOM walk for 40000 steps (22 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (10 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 293766 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 1
Probabilistic random walk after 293766 steps, saw 163879 distinct states, run finished after 3008 ms. (steps per millisecond=97 ) properties seen :0
[2025-06-03 01:24:49] [INFO ] Flow matrix only has 1192 transitions (discarded 20 similar events)
[2025-06-03 01:24:49] [INFO ] Invariant cache hit.
[2025-06-03 01:24:49] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 174/244 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/274 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/284 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 531/1732 variables, and 34 constraints, problems are : Problem set: 1 solved, 0 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 8/13 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/540 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 697ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 321 ms. Reduced automaton from 8 states, 20 edges and 2 AP (stutter sensitive) to 8 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[p0, p0, (AND p0 p1), (AND p0 p1), p0, true, (AND p0 p1), p1]
Stuttering acceptance computed with spot in 271 ms :[p0, p0, (AND p0 p1), (AND p0 p1), p0, true, (AND p0 p1), p1]
Support contains 70 out of 740 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 740/740 places, 1412/1412 transitions.
Applied a total of 0 rules in 13 ms. Remains 740 /740 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2025-06-03 01:24:50] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 740 cols
[2025-06-03 01:24:50] [INFO ] Computed 42 invariants in 22 ms
[2025-06-03 01:24:50] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:25:09] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:25:09] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:25:09] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:25:10] [INFO ] Deduced a trap composed of 66 places in 336 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:25:11] [INFO ] Deduced a trap composed of 162 places in 395 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:25:11] [INFO ] Deduced a trap composed of 66 places in 329 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:25:11] [INFO ] Deduced a trap composed of 66 places in 333 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:25:12] [INFO ] Deduced a trap composed of 66 places in 329 ms of which 75 ms to minimize.
SMT process timed out in 21087ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 21089ms
[2025-06-03 01:25:12] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 01:25:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:25:13] [INFO ] Implicit Places using invariants in 1058 ms returned []
[2025-06-03 01:25:13] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 01:25:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:25:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 01:25:29] [INFO ] Implicit Places using invariants and state equation in 16661 ms returned []
Implicit Place search using SMT with State Equation took 17722 ms to find 0 implicit places.
Running 1410 sub problems to find dead transitions.
[2025-06-03 01:25:29] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2025-06-03 01:25:29] [INFO ] Invariant cache hit.
[2025-06-03 01:25:29] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:25:48] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:25:48] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:25:48] [INFO ] Deduced a trap composed of 66 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 01:25:48] [INFO ] Deduced a trap composed of 66 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-03 01:25:48] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:25:48] [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-03 01:25:48] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:25:48] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:25:48] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:25:49] [INFO ] Deduced a trap composed of 353 places in 423 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:25:50] [INFO ] Deduced a trap composed of 217 places in 386 ms of which 138 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:25:50] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:25:52] [INFO ] Deduced a trap composed of 363 places in 456 ms of which 175 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:25:52] [INFO ] Deduced a trap composed of 23 places in 303 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:25:53] [INFO ] Deduced a trap composed of 333 places in 413 ms of which 135 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 738/2132 variables, and 55 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/740 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/738 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/738 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/738 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:05] [INFO ] Deduced a trap composed of 342 places in 401 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:05] [INFO ] Deduced a trap composed of 422 places in 421 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:17] [INFO ] Deduced a trap composed of 491 places in 478 ms of which 213 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:17] [INFO ] Deduced a trap composed of 377 places in 408 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:26] [INFO ] Deduced a trap composed of 367 places in 429 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:28] [INFO ] Deduced a trap composed of 66 places in 343 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:28] [INFO ] Deduced a trap composed of 387 places in 415 ms of which 154 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 738/2132 variables, and 62 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/740 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60924ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 60930ms
Finished structural reductions in LTL mode , in 1 iterations and 99764 ms. Remains : 740/740 places, 1412/1412 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 110 ms. Reduced automaton from 8 states, 17 edges and 2 AP (stutter sensitive) to 8 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[p0, p0, (AND p0 p1), (AND p0 p1), p0, true, (AND p0 p1), p1]
RANDOM walk for 87 steps (0 resets) in 4 ms. (17 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 205 ms. Reduced automaton from 8 states, 17 edges and 2 AP (stutter sensitive) to 8 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[p0, p0, (AND p0 p1), (AND p0 p1), p0, true, (AND p0 p1), p1]
Stuttering acceptance computed with spot in 259 ms :[p0, p0, (AND p0 p1), (AND p0 p1), p0, true, (AND p0 p1), p1]
Stuttering acceptance computed with spot in 262 ms :[p0, p0, (AND p0 p1), (AND p0 p1), p0, true, (AND p0 p1), p1]
Product exploration explored 100000 steps with 24968 reset in 617 ms.
Entered a terminal (fully accepting) state of product in 50505 steps with 12659 reset in 311 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-13 finished in 252474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(F((X(p2)&&p1)))))))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J04T10-LTLFireability-01
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Support contains 41 out of 742 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 742/742 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 740 transition count 1352
Reduce places removed 60 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 80 rules applied. Total rules applied 140 place count 680 transition count 1332
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 160 place count 660 transition count 1332
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 160 place count 660 transition count 1252
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 320 place count 580 transition count 1252
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 330 place count 570 transition count 1242
Iterating global reduction 3 with 10 rules applied. Total rules applied 340 place count 570 transition count 1242
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 480 place count 500 transition count 1172
Applied a total of 480 rules in 51 ms. Remains 500 /742 variables (removed 242) and now considering 1172/1412 (removed 240) transitions.
Running 1170 sub problems to find dead transitions.
[2025-06-03 01:26:33] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
// Phase 1: matrix 1152 rows 500 cols
[2025-06-03 01:26:33] [INFO ] Computed 42 invariants in 20 ms
[2025-06-03 01:26:33] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:45] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:45] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:45] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:45] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:45] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:45] [INFO ] Deduced a trap composed of 42 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-03 01:26:45] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:45] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:45] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:46] [INFO ] Deduced a trap composed of 173 places in 239 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:46] [INFO ] Deduced a trap composed of 183 places in 286 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:46] [INFO ] Deduced a trap composed of 163 places in 243 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:47] [INFO ] Deduced a trap composed of 38 places in 237 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:47] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:47] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:47] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:26:48] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/1652 variables, and 57 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1170/1170 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1170 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/1652 variables, and 57 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1170 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40884ms problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 40885ms
[2025-06-03 01:27:14] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2025-06-03 01:27:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:27:15] [INFO ] Implicit Places using invariants in 752 ms returned []
[2025-06-03 01:27:15] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2025-06-03 01:27:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:27:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 01:27:22] [INFO ] Implicit Places using invariants and state equation in 7407 ms returned []
Implicit Place search using SMT with State Equation took 8164 ms to find 0 implicit places.
Running 1170 sub problems to find dead transitions.
[2025-06-03 01:27:22] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2025-06-03 01:27:22] [INFO ] Invariant cache hit.
[2025-06-03 01:27:22] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:27:34] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:27:34] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:27:34] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:27:34] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:27:35] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:27:35] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:27:35] [INFO ] Deduced a trap composed of 42 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 01:27:35] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:27:35] [INFO ] Deduced a trap composed of 42 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 01:27:35] [INFO ] Deduced a trap composed of 173 places in 292 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:27:36] [INFO ] Deduced a trap composed of 183 places in 333 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:27:38] [INFO ] Deduced a trap composed of 42 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 01:27:42] [INFO ] Deduced a trap composed of 163 places in 273 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:27:42] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:27:46] [INFO ] Deduced a trap composed of 177 places in 253 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:27:47] [INFO ] Deduced a trap composed of 187 places in 276 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:27:52] [INFO ] Deduced a trap composed of 142 places in 261 ms of which 64 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 498/1652 variables, and 57 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1170/1170 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/1652 variables, and 57 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1170 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60822ms problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 60825ms
Starting structural reductions in LI_LTL mode, iteration 1 : 500/742 places, 1172/1412 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 109934 ms. Remains : 500/742 places, 1172/1412 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-01
Product exploration explored 100000 steps with 3763 reset in 345 ms.
Product exploration explored 100000 steps with 3694 reset in 357 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
RANDOM walk for 40000 steps (12 resets) in 174 ms. (228 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40002 steps (10 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
[2025-06-03 01:28:24] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2025-06-03 01:28:24] [INFO ] Invariant cache hit.
[2025-06-03 01:28:24] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 196/217 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/258 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/267 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 491/1652 variables, and 34 constraints, problems are : Problem set: 1 solved, 0 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 9/14 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 142ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT p0))), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F p0)]
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
[2025-06-03 01:28:25] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2025-06-03 01:28:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 01:28:26] [INFO ] [Real]Absence check using 14 positive place invariants in 429 ms returned sat
[2025-06-03 01:28:27] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 812 ms returned sat
[2025-06-03 01:28:31] [INFO ] [Real]Absence check using state equation in 3930 ms returned sat
[2025-06-03 01:28:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 01:28:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 37 ms returned sat
[2025-06-03 01:28:32] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 956 ms returned sat
[2025-06-03 01:28:37] [INFO ] [Nat]Absence check using state equation in 4838 ms returned sat
[2025-06-03 01:28:37] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 01:28:37] [INFO ] [Nat]Added 120 Read/Feed constraints in 480 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:28:38] [INFO ] Deduced a trap composed of 42 places in 238 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:28:38] [INFO ] Deduced a trap composed of 70 places in 312 ms of which 62 ms to minimize.
[2025-06-03 01:28:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 846 ms
[2025-06-03 01:28:38] [INFO ] Computed and/alt/rep : 390/838/380 causal constraints (skipped 770 transitions) in 76 ms.
[2025-06-03 01:28:40] [INFO ] Added : 59 causal constraints over 12 iterations in 1493 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 41 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 1172/1172 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 1172/1172 (removed 0) transitions.
Running 1170 sub problems to find dead transitions.
[2025-06-03 01:28:40] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2025-06-03 01:28:40] [INFO ] Invariant cache hit.
[2025-06-03 01:28:40] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:28:52] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:28:52] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:28:52] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:28:52] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:28:52] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:28:52] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:28:52] [INFO ] Deduced a trap composed of 42 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 01:28:52] [INFO ] Deduced a trap composed of 42 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 01:28:53] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:28:53] [INFO ] Deduced a trap composed of 173 places in 304 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:28:53] [INFO ] Deduced a trap composed of 183 places in 337 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:28:56] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:28:59] [INFO ] Deduced a trap composed of 163 places in 317 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:29:00] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 28 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/1652 variables, and 54 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1170/1170 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1170 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/1652 variables, and 54 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1170 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40853ms problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 40855ms
[2025-06-03 01:29:21] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2025-06-03 01:29:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:29:21] [INFO ] Implicit Places using invariants in 710 ms returned []
[2025-06-03 01:29:21] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2025-06-03 01:29:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 01:29:22] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 01:29:29] [INFO ] Implicit Places using invariants and state equation in 7288 ms returned []
Implicit Place search using SMT with State Equation took 8002 ms to find 0 implicit places.
Running 1170 sub problems to find dead transitions.
[2025-06-03 01:29:29] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2025-06-03 01:29:29] [INFO ] Invariant cache hit.
[2025-06-03 01:29:29] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:29:41] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:29:41] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:29:41] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:29:41] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:29:41] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:29:41] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:29:41] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:29:41] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:29:41] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:29:42] [INFO ] Deduced a trap composed of 173 places in 294 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:29:42] [INFO ] Deduced a trap composed of 183 places in 337 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:29:44] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:29:48] [INFO ] Deduced a trap composed of 163 places in 271 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:29:48] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:29:53] [INFO ] Deduced a trap composed of 177 places in 247 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:29:53] [INFO ] Deduced a trap composed of 187 places in 271 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:29:58] [INFO ] Deduced a trap composed of 142 places in 259 ms of which 63 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/1652 variables, and 57 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1170/1170 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1170 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 498/1652 variables, and 57 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1170 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60853ms problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 60858ms
Finished structural reductions in LTL mode , in 1 iterations and 109727 ms. Remains : 500/500 places, 1172/1172 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
RANDOM walk for 200 steps (0 resets) in 8 ms. (22 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
[2025-06-03 01:30:31] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2025-06-03 01:30:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 01:30:32] [INFO ] [Real]Absence check using 14 positive place invariants in 424 ms returned sat
[2025-06-03 01:30:32] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 804 ms returned sat
[2025-06-03 01:30:36] [INFO ] [Real]Absence check using state equation in 3815 ms returned sat
[2025-06-03 01:30:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 01:30:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 30 ms returned sat
[2025-06-03 01:30:38] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 963 ms returned sat
[2025-06-03 01:30:43] [INFO ] [Nat]Absence check using state equation in 4929 ms returned sat
[2025-06-03 01:30:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2025-06-03 01:30:43] [INFO ] [Nat]Added 120 Read/Feed constraints in 487 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:30:44] [INFO ] Deduced a trap composed of 42 places in 256 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:30:44] [INFO ] Deduced a trap composed of 70 places in 255 ms of which 57 ms to minimize.
[2025-06-03 01:30:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 810 ms
[2025-06-03 01:30:44] [INFO ] Computed and/alt/rep : 390/838/380 causal constraints (skipped 770 transitions) in 80 ms.
[2025-06-03 01:30:46] [INFO ] Added : 59 causal constraints over 12 iterations in 1502 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 3731 reset in 338 ms.
Product exploration explored 100000 steps with 3714 reset in 371 ms.
Applying partial POR strategy [false, true, false, false, false, true]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Support contains 41 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 1172/1172 transitions.
Applied a total of 0 rules in 19 ms. Remains 500 /500 variables (removed 0) and now considering 1172/1172 (removed 0) transitions.
Running 1170 sub problems to find dead transitions.
[2025-06-03 01:30:47] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2025-06-03 01:30:47] [INFO ] Invariant cache hit.
[2025-06-03 01:30:47] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:30:59] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:30:59] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:30:59] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:30:59] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:30:59] [INFO ] Deduced a trap composed of 42 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-03 01:30:59] [INFO ] Deduced a trap composed of 42 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 01:30:59] [INFO ] Deduced a trap composed of 42 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 01:30:59] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:00] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:00] [INFO ] Deduced a trap composed of 173 places in 262 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:00] [INFO ] Deduced a trap composed of 183 places in 305 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:03] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:06] [INFO ] Deduced a trap composed of 163 places in 278 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:06] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 26 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/1652 variables, and 54 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1170/1170 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1170 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/1652 variables, and 54 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1170 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40874ms problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 40876ms
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 01:31:28] [INFO ] Redundant transitions in 9 ms returned []
Running 1170 sub problems to find dead transitions.
[2025-06-03 01:31:28] [INFO ] Flow matrix only has 1152 transitions (discarded 20 similar events)
[2025-06-03 01:31:28] [INFO ] Invariant cache hit.
[2025-06-03 01:31:28] [INFO ] State equation strengthened by 120 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:40] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:40] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:40] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:40] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:40] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:40] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:40] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:40] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:41] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:41] [INFO ] Deduced a trap composed of 173 places in 266 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:41] [INFO ] Deduced a trap composed of 183 places in 302 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:44] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:47] [INFO ] Deduced a trap composed of 163 places in 277 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:47] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:52] [INFO ] Deduced a trap composed of 177 places in 250 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:52] [INFO ] Deduced a trap composed of 187 places in 279 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 01:31:57] [INFO ] Deduced a trap composed of 142 places in 272 ms of which 64 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 498/1652 variables, and 57 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1170/1170 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 1170 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 498/1652 variables, and 57 constraints, problems are : Problem set: 0 solved, 1170 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1170 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60839ms problems are : Problem set: 0 solved, 1170 unsolved
Search for dead transitions found 0 dead transitions in 60841ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 101756 ms. Remains : 500/500 places, 1172/1172 transitions.
Built C files in :
/tmp/ltsmin15970080714192210223
[2025-06-03 01:32:29] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15970080714192210223
Running compilation step : cd /tmp/ltsmin15970080714192210223;'/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 2091 ms.
Running link step : cd /tmp/ltsmin15970080714192210223;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15970080714192210223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8250567435837436906.hoa' '--buchi-type=spotba'
LTSmin run took 11003 ms.
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-01 finished in 369184 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-01 TRUE TECHNIQUES SHORTENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U (X(X(p0)) U G(p1))))'
[2025-06-03 01:32:42] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12425041466408953941
[2025-06-03 01:32:42] [INFO ] Computing symmetric may disable matrix : 1412 transitions.
[2025-06-03 01:32:42] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:32:42] [INFO ] Applying decomposition
[2025-06-03 01:32:42] [INFO ] Computing symmetric may enable matrix : 1412 transitions.
[2025-06-03 01:32:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:32:42] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4170931412104886342.txt' '-o' '/tmp/graph4170931412104886342.bin' '-w' '/tmp/graph4170931412104886342.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4170931412104886342.bin' '-l' '-1' '-v' '-w' '/tmp/graph4170931412104886342.weights' '-q' '0' '-e' '0.001'
[2025-06-03 01:32:42] [INFO ] Decomposing Gal with order
[2025-06-03 01:32:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 01:32:42] [INFO ] Removed a total of 1126 redundant transitions.
[2025-06-03 01:32:42] [INFO ] Flatten gal took : 103 ms
[2025-06-03 01:32:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 14 ms.
[2025-06-03 01:32:42] [INFO ] Time to serialize gal into /tmp/LTLFireability4377140125799120582.gal : 11 ms
[2025-06-03 01:32:42] [INFO ] Time to serialize properties into /tmp/LTLFireability5823675278469876181.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4377140125799120582.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5823675278469876181.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
[2025-06-03 01:32:42] [INFO ] Computing Do-Not-Accords matrix : 1412 transitions.
[2025-06-03 01:32:42] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 01:32:42] [INFO ] Built C files in 499ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12425041466408953941
Running compilation step : cd /tmp/ltsmin12425041466408953941;'/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'
Checking formula 0 : !(((G(F(!("(((((((((i10.i0.u5.cBlockedTasks>=10)&&(i10.i0.u4.PollingAbort>=1))&&((i10.i0.u53.Abort_Check_Sources_E_7>=1)&&(i10.i0.u53....7190
Formula 0 simplified : FG"(((((((((i10.i0.u5.cBlockedTasks>=10)&&(i10.i0.u4.PollingAbort>=1))&&((i10.i0.u53.Abort_Check_Sources_E_7>=1)&&(i10.i0.u53.ORB_Lo...7174
Compilation finished in 5220 ms.
Running link step : cd /tmp/ltsmin12425041466408953941;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin12425041466408953941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>(!(LTLAPp3==true))) U (X(X((LTLAPp3==true))) U []((LTLAPp4==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.216: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.216: LTL layer: formula: ([](<>(!(LTLAPp3==true))) U (X(X((LTLAPp3==true))) U []((LTLAPp4==true))))
pins2lts-mc-linux64( 6/ 8), 0.216: "([](<>(!(LTLAPp3==true))) U (X(X((LTLAPp3==true))) U []((LTLAPp4==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.221: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.222: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.250: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.260: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.267: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.268: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.279: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.279: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.494: There are 1418 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.494: State length is 743, there are 1430 groups
pins2lts-mc-linux64( 0/ 8), 0.494: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.494: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.494: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.494: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.570: [Blue] ~115 levels ~960 states ~1824 transitions
pins2lts-mc-linux64( 2/ 8), 0.652: [Blue] ~224 levels ~1920 states ~3088 transitions
pins2lts-mc-linux64( 5/ 8), 0.788: [Blue] ~458 levels ~3840 states ~6888 transitions
pins2lts-mc-linux64( 6/ 8), 1.038: [Blue] ~901 levels ~7680 states ~14768 transitions
pins2lts-mc-linux64( 6/ 8), 1.545: [Blue] ~1735 levels ~15360 states ~32064 transitions
pins2lts-mc-linux64( 5/ 8), 2.439: [Blue] ~3642 levels ~30720 states ~62704 transitions
pins2lts-mc-linux64( 6/ 8), 4.104: [Blue] ~7014 levels ~61440 states ~124304 transitions
pins2lts-mc-linux64( 0/ 8), 7.183: [Blue] ~14080 levels ~122880 states ~255360 transitions
pins2lts-mc-linux64( 6/ 8), 12.856: [Blue] ~26833 levels ~245760 states ~466896 transitions
pins2lts-mc-linux64( 0/ 8), 23.874: [Blue] ~55596 levels ~491520 states ~1077880 transitions
pins2lts-mc-linux64( 0/ 8), 44.717: [Blue] ~108231 levels ~983040 states ~2105040 transitions
pins2lts-mc-linux64( 0/ 8), 85.675: [Blue] ~208653 levels ~1966080 states ~4230056 transitions
pins2lts-mc-linux64( 0/ 8), 168.944: [Blue] ~402245 levels ~3932160 states ~8368184 transitions
pins2lts-mc-linux64( 0/ 8), 337.730: [Blue] ~780291 levels ~7864320 states ~16703512 transitions
pins2lts-mc-linux64( 0/ 8), 674.280: [Blue] ~1522732 levels ~15728640 states ~33547648 transitions
pins2lts-mc-linux64( 3/ 8), 769.515: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 769.734:
pins2lts-mc-linux64( 0/ 8), 769.734: Explored 15746709 states 31335053 transitions, fanout: 1.990
pins2lts-mc-linux64( 0/ 8), 769.734: Total exploration time 769.230 sec (769.010 sec minimum, 769.056 sec on average)
pins2lts-mc-linux64( 0/ 8), 769.734: States per second: 20471, Transitions per second: 40736
pins2lts-mc-linux64( 0/ 8), 769.734:
pins2lts-mc-linux64( 0/ 8), 769.734: State space has 24414462 states, 636883 are accepting
pins2lts-mc-linux64( 0/ 8), 769.734: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 769.734: blue states: 15746709 (64.50%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 769.734: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 769.734: all-red states: 636883 (2.61%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 769.734:
pins2lts-mc-linux64( 0/ 8), 769.734: Total memory used for local state coloring: 174.8MB
pins2lts-mc-linux64( 0/ 8), 769.734:
pins2lts-mc-linux64( 0/ 8), 769.734: Queue width: 8B, total height: 11455598, memory: 87.40MB
pins2lts-mc-linux64( 0/ 8), 769.734: Tree memory: 442.3MB, 19.0 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 769.734: Tree fill ratio (roots/leafs): 18.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 769.734: Stored 1439 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 769.734: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 769.734: Est. total memory use: 529.7MB (~1111.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12425041466408953941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>(!(LTLAPp3==true))) U (X(X((LTLAPp3==true))) U []((LTLAPp4==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12425041466408953941;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>(!(LTLAPp3==true))) U (X(X((LTLAPp3==true))) U []((LTLAPp4==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T10.tgz
mv PolyORBLF-COL-S02J04T10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;