Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067000188.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 DLCround-PT-07b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067000188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K 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.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 963K 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 DLCround-PT-07b-LTLFireability-00
FORMULA_NAME DLCround-PT-07b-LTLFireability-01
FORMULA_NAME DLCround-PT-07b-LTLFireability-02
FORMULA_NAME DLCround-PT-07b-LTLFireability-03
FORMULA_NAME DLCround-PT-07b-LTLFireability-04
FORMULA_NAME DLCround-PT-07b-LTLFireability-05
FORMULA_NAME DLCround-PT-07b-LTLFireability-06
FORMULA_NAME DLCround-PT-07b-LTLFireability-07
FORMULA_NAME DLCround-PT-07b-LTLFireability-08
FORMULA_NAME DLCround-PT-07b-LTLFireability-09
FORMULA_NAME DLCround-PT-07b-LTLFireability-10
FORMULA_NAME DLCround-PT-07b-LTLFireability-11
FORMULA_NAME DLCround-PT-07b-LTLFireability-12
FORMULA_NAME DLCround-PT-07b-LTLFireability-13
FORMULA_NAME DLCround-PT-07b-LTLFireability-14
FORMULA_NAME DLCround-PT-07b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748671240690

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 06:00:41] [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-05-31 06:00:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 06:00:42] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2025-05-31 06:00:42] [INFO ] Transformed 2703 places.
[2025-05-31 06:00:42] [INFO ] Transformed 4071 transitions.
[2025-05-31 06:00:42] [INFO ] Found NUPN structural information;
[2025-05-31 06:00:42] [INFO ] Parsed PT model containing 2703 places and 4071 transitions and 11073 arcs in 312 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DLCround-PT-07b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 2703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2703/2703 places, 4071/4071 transitions.
Discarding 472 places :
Symmetric choice reduction at 0 with 472 rule applications. Total rules 472 place count 2231 transition count 3599
Iterating global reduction 0 with 472 rules applied. Total rules applied 944 place count 2231 transition count 3599
Discarding 370 places :
Symmetric choice reduction at 0 with 370 rule applications. Total rules 1314 place count 1861 transition count 3229
Iterating global reduction 0 with 370 rules applied. Total rules applied 1684 place count 1861 transition count 3229
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 1692 place count 1861 transition count 3221
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 1746 place count 1807 transition count 3084
Iterating global reduction 1 with 54 rules applied. Total rules applied 1800 place count 1807 transition count 3084
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 1832 place count 1775 transition count 3052
Iterating global reduction 1 with 32 rules applied. Total rules applied 1864 place count 1775 transition count 3052
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 1867 place count 1775 transition count 3049
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1884 place count 1758 transition count 3032
Iterating global reduction 2 with 17 rules applied. Total rules applied 1901 place count 1758 transition count 3032
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1917 place count 1742 transition count 3016
Iterating global reduction 2 with 16 rules applied. Total rules applied 1933 place count 1742 transition count 3016
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1949 place count 1726 transition count 3000
Iterating global reduction 2 with 16 rules applied. Total rules applied 1965 place count 1726 transition count 3000
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1975 place count 1716 transition count 2990
Iterating global reduction 2 with 10 rules applied. Total rules applied 1985 place count 1716 transition count 2990
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1992 place count 1709 transition count 2983
Iterating global reduction 2 with 7 rules applied. Total rules applied 1999 place count 1709 transition count 2983
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 2006 place count 1702 transition count 2976
Iterating global reduction 2 with 7 rules applied. Total rules applied 2013 place count 1702 transition count 2976
Applied a total of 2013 rules in 1186 ms. Remains 1702 /2703 variables (removed 1001) and now considering 2976/4071 (removed 1095) transitions.
// Phase 1: matrix 2976 rows 1702 cols
[2025-05-31 06:00:44] [INFO ] Computed 132 invariants in 28 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:00:45] [INFO ] Implicit Places using invariants in 952 ms returned []
[2025-05-31 06:00:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:00:46] [INFO ] Implicit Places using invariants and state equation in 1685 ms returned []
Implicit Place search using SMT with State Equation took 3208 ms to find 0 implicit places.
Running 2975 sub problems to find dead transitions.
[2025-05-31 06:00:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1701/4678 variables, and 0 constraints, problems are : Problem set: 0 solved, 2975 unsolved in 31032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1702 constraints, PredecessorRefiner: 2975/2975 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2975 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1701/4678 variables, and 0 constraints, problems are : Problem set: 0 solved, 2975 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1702 constraints, PredecessorRefiner: 0/2975 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62210ms problems are : Problem set: 0 solved, 2975 unsolved
Search for dead transitions found 0 dead transitions in 62532ms
Starting structural reductions in LTL mode, iteration 1 : 1702/2703 places, 2976/4071 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66961 ms. Remains : 1702/2703 places, 2976/4071 transitions.
Support contains 38 out of 1702 places after structural reductions.
[2025-05-31 06:01:49] [INFO ] Flatten gal took : 173 ms
[2025-05-31 06:01:49] [INFO ] Flatten gal took : 112 ms
[2025-05-31 06:01:50] [INFO ] Input system was already deterministic with 2976 transitions.
RANDOM walk for 40000 steps (8 resets) in 1749 ms. (22 steps per ms) remains 2/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
[2025-05-31 06:01:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 257/261 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1441/1702 variables, 128/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1702 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2976/4678 variables, 1702/1834 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4678 variables, 0/1834 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/4678 variables, 0/1834 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4678/4678 variables, and 1834 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1882 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 1702/1702 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 257/261 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1441/1702 variables, 128/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1702 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2976/4678 variables, 1702/1834 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4678 variables, 2/1836 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4678 variables, 0/1836 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/4678 variables, 0/1836 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4678/4678 variables, and 1836 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1662 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 1702/1702 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3564ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 608 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=101 )
Parikh walk visited 2 properties in 12 ms.
Computed a total of 265 stabilizing places and 265 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((X(p1)&&p0)) U X(p2))))'
Support contains 4 out of 1702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1702/1702 places, 2976/2976 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1687 transition count 2960
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1687 transition count 2960
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 1676 transition count 2949
Iterating global reduction 0 with 11 rules applied. Total rules applied 52 place count 1676 transition count 2949
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 1676 transition count 2948
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 1671 transition count 2943
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 1671 transition count 2943
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 1667 transition count 2939
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 1667 transition count 2939
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 1664 transition count 2936
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 1664 transition count 2936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 1663 transition count 2935
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 1663 transition count 2935
Applied a total of 79 rules in 295 ms. Remains 1663 /1702 variables (removed 39) and now considering 2935/2976 (removed 41) transitions.
// Phase 1: matrix 2935 rows 1663 cols
[2025-05-31 06:01:55] [INFO ] Computed 132 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:01:55] [INFO ] Implicit Places using invariants in 749 ms returned []
[2025-05-31 06:01:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:01:57] [INFO ] Implicit Places using invariants and state equation in 1643 ms returned []
Implicit Place search using SMT with State Equation took 2402 ms to find 0 implicit places.
Running 2934 sub problems to find dead transitions.
[2025-05-31 06:01:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 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 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1662/4598 variables, and 0 constraints, problems are : Problem set: 0 solved, 2934 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1663 constraints, PredecessorRefiner: 2934/2934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2934 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/4598 variables, and 0 constraints, problems are : Problem set: 0 solved, 2934 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1663 constraints, PredecessorRefiner: 0/2934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60924ms problems are : Problem set: 0 solved, 2934 unsolved
Search for dead transitions found 0 dead transitions in 60932ms
Starting structural reductions in LTL mode, iteration 1 : 1663/1702 places, 2935/2976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63639 ms. Remains : 1663/1702 places, 2935/2976 transitions.
Stuttering acceptance computed with spot in 351 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-07b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-00 finished in 64107 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((X(X(X(p0)))||G((p0||F(p1))))))'
Support contains 2 out of 1702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1702/1702 places, 2976/2976 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1688 transition count 2961
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1688 transition count 2961
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 38 place count 1678 transition count 2951
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 1678 transition count 2951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1678 transition count 2950
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 1673 transition count 2945
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 1673 transition count 2945
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 1669 transition count 2941
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 1669 transition count 2941
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 1666 transition count 2938
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 1666 transition count 2938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 1665 transition count 2937
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 1665 transition count 2937
Applied a total of 75 rules in 318 ms. Remains 1665 /1702 variables (removed 37) and now considering 2937/2976 (removed 39) transitions.
// Phase 1: matrix 2937 rows 1665 cols
[2025-05-31 06:02:59] [INFO ] Computed 132 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:02:59] [INFO ] Implicit Places using invariants in 750 ms returned []
[2025-05-31 06:02:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:03:01] [INFO ] Implicit Places using invariants and state equation in 1544 ms returned []
Implicit Place search using SMT with State Equation took 2298 ms to find 0 implicit places.
Running 2936 sub problems to find dead transitions.
[2025-05-31 06:03:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1664/4602 variables, and 0 constraints, problems are : Problem set: 0 solved, 2936 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1665 constraints, PredecessorRefiner: 2936/2936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2936 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1664/4602 variables, and 0 constraints, problems are : Problem set: 0 solved, 2936 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1665 constraints, PredecessorRefiner: 0/2936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60878ms problems are : Problem set: 0 solved, 2936 unsolved
Search for dead transitions found 0 dead transitions in 60883ms
Starting structural reductions in LTL mode, iteration 1 : 1665/1702 places, 2937/2976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63510 ms. Remains : 1665/1702 places, 2937/2976 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 405 ms.
Product exploration explored 100000 steps with 25000 reset in 376 ms.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Detected a total of 259/1665 stabilizing places and 259/2937 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 126 steps (0 resets) in 7 ms. (15 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 212 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 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1665/1665 places, 2937/2937 transitions.
Applied a total of 0 rules in 55 ms. Remains 1665 /1665 variables (removed 0) and now considering 2937/2937 (removed 0) transitions.
[2025-05-31 06:04:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:04:05] [INFO ] Implicit Places using invariants in 684 ms returned []
[2025-05-31 06:04:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:04:06] [INFO ] Implicit Places using invariants and state equation in 1629 ms returned []
Implicit Place search using SMT with State Equation took 2316 ms to find 0 implicit places.
Running 2936 sub problems to find dead transitions.
[2025-05-31 06:04:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1664/4602 variables, and 0 constraints, problems are : Problem set: 0 solved, 2936 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1665 constraints, PredecessorRefiner: 2936/2936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2936 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1664/4602 variables, and 0 constraints, problems are : Problem set: 0 solved, 2936 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1665 constraints, PredecessorRefiner: 0/2936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60932ms problems are : Problem set: 0 solved, 2936 unsolved
Search for dead transitions found 0 dead transitions in 60938ms
Finished structural reductions in LTL mode , in 1 iterations and 63320 ms. Remains : 1665/1665 places, 2937/2937 transitions.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Detected a total of 259/1665 stabilizing places and 259/2937 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 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 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 197 steps (0 resets) in 7 ms. (24 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 2 factoid took 160 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 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 299 ms.
Product exploration explored 100000 steps with 25000 reset in 339 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1665 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1665/1665 places, 2937/2937 transitions.
Graph (trivial) has 1492 edges and 1665 vertex of which 430 / 1665 are part of one of the 35 SCC in 7 ms
Free SCC test removed 395 places
Ensure Unique test removed 427 transitions
Reduce isomorphic transitions removed 427 transitions.
Performed 262 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 262 rules applied. Total rules applied 263 place count 1270 transition count 2510
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 287 place count 1270 transition count 2498
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 287 place count 1270 transition count 2502
Deduced a syphon composed of 283 places in 6 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 296 place count 1270 transition count 2502
Discarding 131 places :
Symmetric choice reduction at 2 with 131 rule applications. Total rules 427 place count 1139 transition count 2033
Deduced a syphon composed of 207 places in 5 ms
Iterating global reduction 2 with 131 rules applied. Total rules applied 558 place count 1139 transition count 2033
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 562 place count 1139 transition count 2029
Performed 421 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 628 places in 1 ms
Iterating global reduction 3 with 421 rules applied. Total rules applied 983 place count 1139 transition count 2037
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 991 place count 1139 transition count 2029
Renaming transitions due to excessive name length > 1024 char.
Discarding 313 places :
Symmetric choice reduction at 4 with 313 rule applications. Total rules 1304 place count 826 transition count 1528
Deduced a syphon composed of 335 places in 1 ms
Iterating global reduction 4 with 313 rules applied. Total rules applied 1617 place count 826 transition count 1528
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 1637 place count 826 transition count 1508
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1645 place count 818 transition count 1500
Deduced a syphon composed of 327 places in 1 ms
Iterating global reduction 5 with 8 rules applied. Total rules applied 1653 place count 818 transition count 1500
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -183
Deduced a syphon composed of 355 places in 1 ms
Iterating global reduction 5 with 28 rules applied. Total rules applied 1681 place count 818 transition count 1683
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1697 place count 818 transition count 1667
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 1737 place count 778 transition count 1523
Deduced a syphon composed of 319 places in 1 ms
Iterating global reduction 6 with 40 rules applied. Total rules applied 1777 place count 778 transition count 1523
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1785 place count 778 transition count 1515
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1793 place count 770 transition count 1499
Deduced a syphon composed of 311 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1801 place count 770 transition count 1499
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 315 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1805 place count 770 transition count 1531
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1809 place count 766 transition count 1523
Deduced a syphon composed of 311 places in 1 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1813 place count 766 transition count 1523
Deduced a syphon composed of 311 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 7 with 35 rules applied. Total rules applied 1848 place count 766 transition count 1488
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1863 place count 751 transition count 1458
Deduced a syphon composed of 311 places in 1 ms
Iterating global reduction 7 with 15 rules applied. Total rules applied 1878 place count 751 transition count 1458
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1893 place count 736 transition count 1287
Deduced a syphon composed of 311 places in 1 ms
Iterating global reduction 7 with 15 rules applied. Total rules applied 1908 place count 736 transition count 1287
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 1930 place count 736 transition count 1265
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 1945 place count 721 transition count 1243
Deduced a syphon composed of 296 places in 1 ms
Iterating global reduction 8 with 15 rules applied. Total rules applied 1960 place count 721 transition count 1243
Deduced a syphon composed of 296 places in 1 ms
Applied a total of 1960 rules in 942 ms. Remains 721 /1665 variables (removed 944) and now considering 1243/2937 (removed 1694) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:05:11] [INFO ] Redundant transitions in 77 ms returned []
Running 1241 sub problems to find dead transitions.
[2025-05-31 06:05:11] [INFO ] Flow matrix only has 1220 transitions (discarded 23 similar events)
// Phase 1: matrix 1220 rows 721 cols
[2025-05-31 06:05:11] [INFO ] Computed 132 invariants in 25 ms
[2025-05-31 06:05:11] [INFO ] State equation strengthened by 158 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/720 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1241 unsolved
SMT process timed out in 30654ms, After SMT, problems are : Problem set: 0 solved, 1241 unsolved
Search for dead transitions found 0 dead transitions in 30656ms
Starting structural reductions in SI_LTL mode, iteration 1 : 721/1665 places, 1243/2937 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31685 ms. Remains : 721/1665 places, 1243/2937 transitions.
Built C files in :
/tmp/ltsmin8581816155600560943
[2025-05-31 06:05:41] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8581816155600560943
Running compilation step : cd /tmp/ltsmin8581816155600560943;'/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/ltsmin8581816155600560943;'/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/ltsmin8581816155600560943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 1665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1665/1665 places, 2937/2937 transitions.
Applied a total of 0 rules in 44 ms. Remains 1665 /1665 variables (removed 0) and now considering 2937/2937 (removed 0) transitions.
// Phase 1: matrix 2937 rows 1665 cols
[2025-05-31 06:05:44] [INFO ] Computed 132 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:05:45] [INFO ] Implicit Places using invariants in 730 ms returned []
[2025-05-31 06:05:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:05:47] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 2344 ms to find 0 implicit places.
Running 2936 sub problems to find dead transitions.
[2025-05-31 06:05:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1664/4602 variables, and 0 constraints, problems are : Problem set: 0 solved, 2936 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1665 constraints, PredecessorRefiner: 2936/2936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2936 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1664/4602 variables, and 0 constraints, problems are : Problem set: 0 solved, 2936 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1665 constraints, PredecessorRefiner: 0/2936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60874ms problems are : Problem set: 0 solved, 2936 unsolved
Search for dead transitions found 0 dead transitions in 60879ms
Finished structural reductions in LTL mode , in 1 iterations and 63276 ms. Remains : 1665/1665 places, 2937/2937 transitions.
Built C files in :
/tmp/ltsmin6262591127536638445
[2025-05-31 06:06:48] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6262591127536638445
Running compilation step : cd /tmp/ltsmin6262591127536638445;'/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/ltsmin6262591127536638445;'/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/ltsmin6262591127536638445;'/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-05-31 06:06:51] [INFO ] Flatten gal took : 75 ms
[2025-05-31 06:06:51] [INFO ] Flatten gal took : 70 ms
[2025-05-31 06:06:51] [INFO ] Time to serialize gal into /tmp/LTL10459920803439454381.gal : 22 ms
[2025-05-31 06:06:51] [INFO ] Time to serialize properties into /tmp/LTL7546600226184419347.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/LTL10459920803439454381.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5483356392670999404.hoa' '-atoms' '/tmp/LTL7546600226184419347.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7546600226184419347.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5483356392670999404.hoa
Detected timeout of ITS tools.
[2025-05-31 06:07:06] [INFO ] Flatten gal took : 64 ms
[2025-05-31 06:07:06] [INFO ] Flatten gal took : 65 ms
[2025-05-31 06:07:06] [INFO ] Time to serialize gal into /tmp/LTL9235969112710821050.gal : 14 ms
[2025-05-31 06:07:06] [INFO ] Time to serialize properties into /tmp/LTL5171270655578268709.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9235969112710821050.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5171270655578268709.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((X(X(X("(p7==0)"))))||(G(("(p7==0)")||(F("((p7==0)&&(p811==0))")))))))
Formula 0 simplified : G(XXX!"(p7==0)" & F(!"(p7==0)" & G!"((p7==0)&&(p811==0))"))
Detected timeout of ITS tools.
[2025-05-31 06:07:21] [INFO ] Flatten gal took : 59 ms
[2025-05-31 06:07:21] [INFO ] Applying decomposition
[2025-05-31 06:07:21] [INFO ] Flatten gal took : 59 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/graph10865657429041711296.txt' '-o' '/tmp/graph10865657429041711296.bin' '-w' '/tmp/graph10865657429041711296.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10865657429041711296.bin' '-l' '-1' '-v' '-w' '/tmp/graph10865657429041711296.weights' '-q' '0' '-e' '0.001'
[2025-05-31 06:07:22] [INFO ] Decomposing Gal with order
[2025-05-31 06:07:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 06:07:22] [INFO ] Removed a total of 2697 redundant transitions.
[2025-05-31 06:07:22] [INFO ] Flatten gal took : 189 ms
[2025-05-31 06:07:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 58 ms.
[2025-05-31 06:07:22] [INFO ] Time to serialize gal into /tmp/LTL5670298689104241680.gal : 25 ms
[2025-05-31 06:07:22] [INFO ] Time to serialize properties into /tmp/LTL117910958216874422.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/LTL5670298689104241680.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL117910958216874422.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F((X(X(X("(i4.i0.i0.u3.p7==0)"))))||(G(("(i4.i0.i0.u3.p7==0)")||(F("((i4.i0.i0.u3.p7==0)&&(i8.u191.p811==0))")))))))
Formula 0 simplified : G(XXX!"(i4.i0.i0.u3.p7==0)" & F(!"(i4.i0.i0.u3.p7==0)" & G!"((i4.i0.i0.u3.p7==0)&&(i8.u191.p811==0))"))
Detected timeout of ITS tools.
Treatment of property DLCround-PT-07b-LTLFireability-01 finished in 278906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 1702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1702/1702 places, 2976/2976 transitions.
Graph (trivial) has 1528 edges and 1702 vertex of which 444 / 1702 are part of one of the 36 SCC in 4 ms
Free SCC test removed 408 places
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 439 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 279 place count 1293 transition count 2258
Reduce places removed 278 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 316 rules applied. Total rules applied 595 place count 1015 transition count 2220
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 620 place count 990 transition count 2220
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 132 Pre rules applied. Total rules applied 620 place count 990 transition count 2088
Deduced a syphon composed of 132 places in 5 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 884 place count 858 transition count 2088
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 943 place count 799 transition count 1698
Iterating global reduction 3 with 59 rules applied. Total rules applied 1002 place count 799 transition count 1698
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1005 place count 799 transition count 1695
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1005 place count 799 transition count 1691
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1013 place count 795 transition count 1691
Performed 300 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 300 places in 1 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 4 with 600 rules applied. Total rules applied 1613 place count 495 transition count 1383
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1622 place count 495 transition count 1374
Renaming transitions due to excessive name length > 1024 char.
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1643 place count 474 transition count 1155
Iterating global reduction 5 with 21 rules applied. Total rules applied 1664 place count 474 transition count 1155
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1684 place count 474 transition count 1135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1686 place count 473 transition count 1134
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1710 place count 461 transition count 1225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1714 place count 461 transition count 1221
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1718 place count 457 transition count 1153
Iterating global reduction 7 with 4 rules applied. Total rules applied 1722 place count 457 transition count 1153
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1726 place count 457 transition count 1149
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1734 place count 453 transition count 1175
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 8 with 34 rules applied. Total rules applied 1768 place count 453 transition count 1141
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1784 place count 437 transition count 1109
Iterating global reduction 8 with 16 rules applied. Total rules applied 1800 place count 437 transition count 1109
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1816 place count 421 transition count 929
Iterating global reduction 8 with 16 rules applied. Total rules applied 1832 place count 421 transition count 929
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 1848 place count 421 transition count 913
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1849 place count 420 transition count 912
Applied a total of 1849 rules in 255 ms. Remains 420 /1702 variables (removed 1282) and now considering 912/2976 (removed 2064) transitions.
[2025-05-31 06:07:38] [INFO ] Flow matrix only has 888 transitions (discarded 24 similar events)
// Phase 1: matrix 888 rows 420 cols
[2025-05-31 06:07:38] [INFO ] Computed 132 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:07:38] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-05-31 06:07:38] [INFO ] Flow matrix only has 888 transitions (discarded 24 similar events)
[2025-05-31 06:07:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:07:38] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-31 06:07:38] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:07:38] [INFO ] Redundant transitions in 13 ms returned []
Running 847 sub problems to find dead transitions.
[2025-05-31 06:07:38] [INFO ] Flow matrix only has 888 transitions (discarded 24 similar events)
[2025-05-31 06:07:38] [INFO ] Invariant cache hit.
[2025-05-31 06:07:38] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (OVERLAPS) 1/420 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 847 unsolved
SMT process timed out in 30436ms, After SMT, problems are : Problem set: 0 solved, 847 unsolved
Search for dead transitions found 0 dead transitions in 30437ms
Starting structural reductions in SI_LTL mode, iteration 1 : 420/1702 places, 912/2976 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31293 ms. Remains : 420/1702 places, 912/2976 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-02
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 7 ms.
FORMULA DLCround-PT-07b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-02 finished in 31363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(F(p0))||(p1&&F((p2&&F(G(p3)))))))))'
Support contains 5 out of 1702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1702/1702 places, 2976/2976 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1689 transition count 2963
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1689 transition count 2963
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1679 transition count 2953
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1679 transition count 2953
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1674 transition count 2948
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1674 transition count 2948
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 1670 transition count 2944
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 1670 transition count 2944
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 1667 transition count 2941
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 1667 transition count 2941
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1666 transition count 2940
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1666 transition count 2940
Applied a total of 72 rules in 365 ms. Remains 1666 /1702 variables (removed 36) and now considering 2940/2976 (removed 36) transitions.
// Phase 1: matrix 2940 rows 1666 cols
[2025-05-31 06:08:09] [INFO ] Computed 132 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:08:10] [INFO ] Implicit Places using invariants in 709 ms returned []
[2025-05-31 06:08:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:08:11] [INFO ] Implicit Places using invariants and state equation in 1629 ms returned []
Implicit Place search using SMT with State Equation took 2341 ms to find 0 implicit places.
Running 2939 sub problems to find dead transitions.
[2025-05-31 06:08:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1665/4606 variables, and 0 constraints, problems are : Problem set: 0 solved, 2939 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1666 constraints, PredecessorRefiner: 2939/2939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2939 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1665/4606 variables, and 0 constraints, problems are : Problem set: 0 solved, 2939 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1666 constraints, PredecessorRefiner: 0/2939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60917ms problems are : Problem set: 0 solved, 2939 unsolved
Search for dead transitions found 0 dead transitions in 60922ms
Starting structural reductions in LTL mode, iteration 1 : 1666/1702 places, 2940/2976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63638 ms. Remains : 1666/1702 places, 2940/2976 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-03
Product exploration explored 100000 steps with 17 reset in 488 ms.
Product exploration explored 100000 steps with 19 reset in 598 ms.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 101 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 388 ms. (102 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
[2025-05-31 06:09:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1481/1666 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1666 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2940/4606 variables, 1666/1798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 06:09:15] [INFO ] Deduced a trap along path composed of 5 places in 30 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/4606 variables, 1/1799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4606 variables, 0/1799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4606 variables, 0/1799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4606/4606 variables, and 1799 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1472 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 1666/1666 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/185 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1481/1666 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1666 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2940/4606 variables, 1666/1798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4606 variables, 1/1799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4606 variables, 1/1800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4606 variables, 0/1800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/4606 variables, 0/1800 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4606/4606 variables, and 1800 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1288 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 1666/1666 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2772ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 35094 steps, including 54 resets, run visited all 1 properties in 140 ms. (steps per millisecond=250 )
Parikh walk visited 1 properties in 141 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR (NOT p3) p0))), (F (NOT (OR (NOT p1) p3 p0))), (F p1), (F p2), (F (NOT (AND (NOT p2) (NOT p0)))), (F p3), (F p0), (F (NOT (AND (NOT p3) (NOT p0))))]
Knowledge based reduction with 15 factoid took 348 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter insensitive) to 4 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2))]
[2025-05-31 06:09:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:09:20] [INFO ] [Real]Absence check using 132 positive place invariants in 899 ms returned sat
[2025-05-31 06:09:33] [INFO ] [Real]Absence check using state equation in 13157 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
[2025-05-31 06:09:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:09:35] [INFO ] [Real]Absence check using 132 positive place invariants in 791 ms returned sat
[2025-05-31 06:09:48] [INFO ] [Real]Absence check using state equation in 13233 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p3))
[2025-05-31 06:09:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:09:50] [INFO ] [Real]Absence check using 132 positive place invariants in 815 ms returned sat
[2025-05-31 06:10:03] [INFO ] [Real]Absence check using state equation in 13184 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 5 out of 1666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1666/1666 places, 2940/2940 transitions.
Graph (trivial) has 1489 edges and 1666 vertex of which 436 / 1666 are part of one of the 36 SCC in 4 ms
Free SCC test removed 400 places
Ensure Unique test removed 433 transitions
Reduce isomorphic transitions removed 433 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 257 transitions
Trivial Post-agglo rules discarded 257 transitions
Performed 257 trivial Post agglomeration. Transition count delta: 257
Iterating post reduction 0 with 257 rules applied. Total rules applied 258 place count 1265 transition count 2249
Reduce places removed 257 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 293 rules applied. Total rules applied 551 place count 1008 transition count 2213
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 575 place count 984 transition count 2213
Performed 133 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 133 Pre rules applied. Total rules applied 575 place count 984 transition count 2080
Deduced a syphon composed of 133 places in 6 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 841 place count 851 transition count 2080
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 895 place count 797 transition count 1688
Iterating global reduction 3 with 54 rules applied. Total rules applied 949 place count 797 transition count 1688
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 953 place count 797 transition count 1684
Performed 300 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 300 places in 0 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 4 with 600 rules applied. Total rules applied 1553 place count 497 transition count 1376
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1561 place count 497 transition count 1368
Renaming transitions due to excessive name length > 1024 char.
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1581 place count 477 transition count 1160
Iterating global reduction 5 with 20 rules applied. Total rules applied 1601 place count 477 transition count 1160
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1621 place count 477 transition count 1140
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -89
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1647 place count 464 transition count 1229
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1651 place count 464 transition count 1225
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1654 place count 461 transition count 1173
Iterating global reduction 7 with 3 rules applied. Total rules applied 1657 place count 461 transition count 1173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1660 place count 461 transition count 1170
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1668 place count 457 transition count 1202
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 8 with 31 rules applied. Total rules applied 1699 place count 457 transition count 1171
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1713 place count 443 transition count 1143
Iterating global reduction 8 with 14 rules applied. Total rules applied 1727 place count 443 transition count 1143
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1741 place count 429 transition count 987
Iterating global reduction 8 with 14 rules applied. Total rules applied 1755 place count 429 transition count 987
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1769 place count 429 transition count 973
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1770 place count 428 transition count 972
Applied a total of 1770 rules in 205 ms. Remains 428 /1666 variables (removed 1238) and now considering 972/2940 (removed 1968) transitions.
[2025-05-31 06:10:03] [INFO ] Flow matrix only has 946 transitions (discarded 26 similar events)
// Phase 1: matrix 946 rows 428 cols
[2025-05-31 06:10:03] [INFO ] Computed 132 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:10:03] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-05-31 06:10:03] [INFO ] Flow matrix only has 946 transitions (discarded 26 similar events)
[2025-05-31 06:10:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:10:03] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-31 06:10:04] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:10:04] [INFO ] Redundant transitions in 16 ms returned []
Running 906 sub problems to find dead transitions.
[2025-05-31 06:10:04] [INFO ] Flow matrix only has 946 transitions (discarded 26 similar events)
[2025-05-31 06:10:04] [INFO ] Invariant cache hit.
[2025-05-31 06:10:04] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 2 (OVERLAPS) 1/428 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 906 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 906 unsolved
SMT process timed out in 30457ms, After SMT, problems are : Problem set: 0 solved, 906 unsolved
Search for dead transitions found 0 dead transitions in 30459ms
Starting structural reductions in SI_LTL mode, iteration 1 : 428/1666 places, 972/2940 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31289 ms. Remains : 428/1666 places, 972/2940 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p3 (NOT p0)))), (X (AND (NOT p3) (NOT p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 105 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter insensitive) to 4 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 5366 steps (0 resets) in 178 ms. (29 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p3 (NOT p0)))), (X (AND (NOT p3) (NOT p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p3), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 p3 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p3)))), (F p2), (F p0), (F (NOT (OR p0 (NOT p3))))]
Knowledge based reduction with 13 factoid took 332 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter insensitive) to 4 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
[2025-05-31 06:10:35] [INFO ] Flow matrix only has 946 transitions (discarded 26 similar events)
[2025-05-31 06:10:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:10:36] [INFO ] [Real]Absence check using 132 positive place invariants in 40 ms returned sat
[2025-05-31 06:10:36] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2025-05-31 06:10:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:10:36] [INFO ] [Nat]Absence check using 132 positive place invariants in 43 ms returned sat
[2025-05-31 06:10:37] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2025-05-31 06:10:37] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-31 06:10:37] [INFO ] [Nat]Added 45 Read/Feed constraints in 7 ms returned sat
[2025-05-31 06:10:37] [INFO ] Computed and/alt/rep : 596/1404/596 causal constraints (skipped 295 transitions) in 48 ms.
[2025-05-31 06:10:37] [INFO ] Added : 3 causal constraints over 1 iterations in 160 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2025-05-31 06:10:37] [INFO ] Flow matrix only has 946 transitions (discarded 26 similar events)
[2025-05-31 06:10:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:10:37] [INFO ] [Real]Absence check using 132 positive place invariants in 40 ms returned sat
[2025-05-31 06:10:38] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2025-05-31 06:10:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:10:38] [INFO ] [Nat]Absence check using 132 positive place invariants in 44 ms returned sat
[2025-05-31 06:10:38] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2025-05-31 06:10:38] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-31 06:10:38] [INFO ] [Nat]Added 45 Read/Feed constraints in 5 ms returned sat
[2025-05-31 06:10:38] [INFO ] Computed and/alt/rep : 596/1404/596 causal constraints (skipped 295 transitions) in 48 ms.
[2025-05-31 06:10:39] [INFO ] Added : 2 causal constraints over 1 iterations in 194 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
[2025-05-31 06:10:39] [INFO ] Flow matrix only has 946 transitions (discarded 26 similar events)
[2025-05-31 06:10:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:10:39] [INFO ] [Real]Absence check using 132 positive place invariants in 42 ms returned sat
[2025-05-31 06:10:39] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2025-05-31 06:10:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:10:40] [INFO ] [Nat]Absence check using 132 positive place invariants in 42 ms returned sat
[2025-05-31 06:10:40] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2025-05-31 06:10:40] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-31 06:10:40] [INFO ] [Nat]Added 45 Read/Feed constraints in 6 ms returned sat
[2025-05-31 06:10:40] [INFO ] Computed and/alt/rep : 596/1404/596 causal constraints (skipped 295 transitions) in 48 ms.
[2025-05-31 06:10:40] [INFO ] Added : 2 causal constraints over 1 iterations in 155 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2))]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-03 finished in 151752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((X((F(G(p1))||G(!p1))) U (p0&&X((F(G(p1))||G(!p1)))))))))'
Support contains 2 out of 1702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1702/1702 places, 2976/2976 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1689 transition count 2962
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1689 transition count 2962
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1679 transition count 2952
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1679 transition count 2952
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1679 transition count 2951
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 1675 transition count 2947
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 1675 transition count 2947
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 1672 transition count 2944
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 1672 transition count 2944
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 1669 transition count 2941
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 1669 transition count 2941
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1668 transition count 2940
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1668 transition count 2940
Applied a total of 69 rules in 352 ms. Remains 1668 /1702 variables (removed 34) and now considering 2940/2976 (removed 36) transitions.
// Phase 1: matrix 2940 rows 1668 cols
[2025-05-31 06:10:41] [INFO ] Computed 132 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:10:41] [INFO ] Implicit Places using invariants in 694 ms returned []
[2025-05-31 06:10:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:10:43] [INFO ] Implicit Places using invariants and state equation in 1640 ms returned []
Implicit Place search using SMT with State Equation took 2336 ms to find 0 implicit places.
Running 2939 sub problems to find dead transitions.
[2025-05-31 06:10:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1667/4608 variables, and 0 constraints, problems are : Problem set: 0 solved, 2939 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1668 constraints, PredecessorRefiner: 2939/2939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2939 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1667/4608 variables, and 0 constraints, problems are : Problem set: 0 solved, 2939 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1668 constraints, PredecessorRefiner: 0/2939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60910ms problems are : Problem set: 0 solved, 2939 unsolved
Search for dead transitions found 0 dead transitions in 60914ms
Starting structural reductions in LTL mode, iteration 1 : 1668/1702 places, 2940/2976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63610 ms. Remains : 1668/1702 places, 2940/2976 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), false, (NOT p1)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 506 ms.
Product exploration explored 100000 steps with 0 reset in 599 ms.
Computed a total of 260 stabilizing places and 260 stable transitions
Computed a total of 260 stabilizing places and 260 stable transitions
Detected a total of 260/1668 stabilizing places and 260/2940 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), false, (NOT p1)]
RANDOM walk for 13620 steps (2 resets) in 85 ms. (158 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), false, (NOT p1)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), false, (NOT p1)]
[2025-05-31 06:11:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:11:48] [INFO ] [Real]Absence check using 132 positive place invariants in 919 ms returned sat
[2025-05-31 06:12:01] [INFO ] [Real]Absence check using state equation in 13146 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 1668 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1668/1668 places, 2940/2940 transitions.
Applied a total of 0 rules in 53 ms. Remains 1668 /1668 variables (removed 0) and now considering 2940/2940 (removed 0) transitions.
[2025-05-31 06:12:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:12:02] [INFO ] Implicit Places using invariants in 737 ms returned []
[2025-05-31 06:12:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:12:04] [INFO ] Implicit Places using invariants and state equation in 1686 ms returned []
Implicit Place search using SMT with State Equation took 2427 ms to find 0 implicit places.
Running 2939 sub problems to find dead transitions.
[2025-05-31 06:12:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1667/4608 variables, and 0 constraints, problems are : Problem set: 0 solved, 2939 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1668 constraints, PredecessorRefiner: 2939/2939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2939 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1667/4608 variables, and 0 constraints, problems are : Problem set: 0 solved, 2939 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1668 constraints, PredecessorRefiner: 0/2939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60888ms problems are : Problem set: 0 solved, 2939 unsolved
Search for dead transitions found 0 dead transitions in 60892ms
Finished structural reductions in LTL mode , in 1 iterations and 63379 ms. Remains : 1668/1668 places, 2940/2940 transitions.
Computed a total of 260 stabilizing places and 260 stable transitions
Computed a total of 260 stabilizing places and 260 stable transitions
Detected a total of 260/1668 stabilizing places and 260/2940 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), false, (NOT p1)]
RANDOM walk for 8932 steps (1 resets) in 55 ms. (159 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), false, (NOT p1)]
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), false, (NOT p1)]
[2025-05-31 06:13:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:13:08] [INFO ] [Real]Absence check using 132 positive place invariants in 908 ms returned sat
[2025-05-31 06:13:21] [INFO ] [Real]Absence check using state equation in 13129 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), false, (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 464 ms.
Product exploration explored 100000 steps with 0 reset in 564 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), false, (NOT p1)]
Support contains 2 out of 1668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1668/1668 places, 2940/2940 transitions.
Graph (trivial) has 1493 edges and 1668 vertex of which 436 / 1668 are part of one of the 36 SCC in 1 ms
Free SCC test removed 400 places
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Performed 261 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 261 rules applied. Total rules applied 262 place count 1268 transition count 2508
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 286 place count 1268 transition count 2496
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 286 place count 1268 transition count 2501
Deduced a syphon composed of 283 places in 6 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 296 place count 1268 transition count 2501
Discarding 134 places :
Symmetric choice reduction at 2 with 134 rule applications. Total rules 430 place count 1134 transition count 2019
Deduced a syphon composed of 205 places in 5 ms
Iterating global reduction 2 with 134 rules applied. Total rules applied 564 place count 1134 transition count 2019
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 568 place count 1134 transition count 2015
Performed 420 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 625 places in 0 ms
Iterating global reduction 3 with 420 rules applied. Total rules applied 988 place count 1134 transition count 2023
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 996 place count 1134 transition count 2015
Renaming transitions due to excessive name length > 1024 char.
Discarding 308 places :
Symmetric choice reduction at 4 with 308 rule applications. Total rules 1304 place count 826 transition count 1526
Deduced a syphon composed of 336 places in 0 ms
Iterating global reduction 4 with 308 rules applied. Total rules applied 1612 place count 826 transition count 1526
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 1631 place count 826 transition count 1507
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1639 place count 818 transition count 1499
Deduced a syphon composed of 328 places in 1 ms
Iterating global reduction 5 with 8 rules applied. Total rules applied 1647 place count 818 transition count 1499
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -189
Deduced a syphon composed of 356 places in 0 ms
Iterating global reduction 5 with 28 rules applied. Total rules applied 1675 place count 818 transition count 1688
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1691 place count 818 transition count 1672
Discarding 41 places :
Symmetric choice reduction at 6 with 41 rule applications. Total rules 1732 place count 777 transition count 1526
Deduced a syphon composed of 319 places in 0 ms
Iterating global reduction 6 with 41 rules applied. Total rules applied 1773 place count 777 transition count 1526
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1781 place count 777 transition count 1518
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1789 place count 769 transition count 1502
Deduced a syphon composed of 311 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1797 place count 769 transition count 1502
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 315 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1801 place count 769 transition count 1534
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1805 place count 765 transition count 1526
Deduced a syphon composed of 311 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 1809 place count 765 transition count 1526
Deduced a syphon composed of 311 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 7 with 39 rules applied. Total rules applied 1848 place count 765 transition count 1487
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1864 place count 749 transition count 1455
Deduced a syphon composed of 311 places in 0 ms
Iterating global reduction 7 with 16 rules applied. Total rules applied 1880 place count 749 transition count 1455
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1896 place count 733 transition count 1271
Deduced a syphon composed of 311 places in 1 ms
Iterating global reduction 7 with 16 rules applied. Total rules applied 1912 place count 733 transition count 1271
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 1936 place count 733 transition count 1247
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1952 place count 717 transition count 1223
Deduced a syphon composed of 295 places in 0 ms
Iterating global reduction 8 with 16 rules applied. Total rules applied 1968 place count 717 transition count 1223
Deduced a syphon composed of 295 places in 0 ms
Applied a total of 1968 rules in 640 ms. Remains 717 /1668 variables (removed 951) and now considering 1223/2940 (removed 1717) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:13:23] [INFO ] Redundant transitions in 20 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-05-31 06:13:23] [INFO ] Flow matrix only has 1199 transitions (discarded 24 similar events)
// Phase 1: matrix 1199 rows 717 cols
[2025-05-31 06:13:23] [INFO ] Computed 132 invariants in 23 ms
[2025-05-31 06:13:23] [INFO ] State equation strengthened by 160 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/716 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 30607ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 30609ms
Starting structural reductions in SI_LTL mode, iteration 1 : 717/1668 places, 1223/2940 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31279 ms. Remains : 717/1668 places, 1223/2940 transitions.
Built C files in :
/tmp/ltsmin6927830217328203728
[2025-05-31 06:13:54] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6927830217328203728
Running compilation step : cd /tmp/ltsmin6927830217328203728;'/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/ltsmin6927830217328203728;'/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/ltsmin6927830217328203728;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 1668 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1668/1668 places, 2940/2940 transitions.
Applied a total of 0 rules in 61 ms. Remains 1668 /1668 variables (removed 0) and now considering 2940/2940 (removed 0) transitions.
// Phase 1: matrix 2940 rows 1668 cols
[2025-05-31 06:13:57] [INFO ] Computed 132 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:13:57] [INFO ] Implicit Places using invariants in 717 ms returned []
[2025-05-31 06:13:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:13:59] [INFO ] Implicit Places using invariants and state equation in 1643 ms returned []
Implicit Place search using SMT with State Equation took 2361 ms to find 0 implicit places.
Running 2939 sub problems to find dead transitions.
[2025-05-31 06:13:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1667/4608 variables, and 0 constraints, problems are : Problem set: 0 solved, 2939 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1668 constraints, PredecessorRefiner: 2939/2939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2939 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1667/4608 variables, and 0 constraints, problems are : Problem set: 0 solved, 2939 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1668 constraints, PredecessorRefiner: 0/2939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60894ms problems are : Problem set: 0 solved, 2939 unsolved
Search for dead transitions found 0 dead transitions in 60899ms
Finished structural reductions in LTL mode , in 1 iterations and 63328 ms. Remains : 1668/1668 places, 2940/2940 transitions.
Built C files in :
/tmp/ltsmin10601234536454612456
[2025-05-31 06:15:00] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10601234536454612456
Running compilation step : cd /tmp/ltsmin10601234536454612456;'/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/ltsmin10601234536454612456;'/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/ltsmin10601234536454612456;'/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-05-31 06:15:03] [INFO ] Flatten gal took : 52 ms
[2025-05-31 06:15:03] [INFO ] Flatten gal took : 55 ms
[2025-05-31 06:15:03] [INFO ] Time to serialize gal into /tmp/LTL15735391384017970594.gal : 11 ms
[2025-05-31 06:15:03] [INFO ] Time to serialize properties into /tmp/LTL15587183071061545963.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/LTL15735391384017970594.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13212138982266443390.hoa' '-atoms' '/tmp/LTL15587183071061545963.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...320
Loading property file /tmp/LTL15587183071061545963.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13212138982266443390.hoa
Detected timeout of ITS tools.
[2025-05-31 06:15:18] [INFO ] Flatten gal took : 49 ms
[2025-05-31 06:15:18] [INFO ] Flatten gal took : 50 ms
[2025-05-31 06:15:18] [INFO ] Time to serialize gal into /tmp/LTL2129840072853286879.gal : 10 ms
[2025-05-31 06:15:18] [INFO ] Time to serialize properties into /tmp/LTL12390212366689962156.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2129840072853286879.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12390212366689962156.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(("(p2542==1)")||(X((X((F(G("(p150==1)")))||(G("(p150!=1)"))))U(("(p2542==1)")&&(X((F(G("(p150==1)")))||(G("(p150!=1)"))))))))))
Formula 0 simplified : X(!"(p2542==1)" & X(!"(p2542==1)" W X(GF!"(p150==1)" & F!"(p150!=1)")))
Detected timeout of ITS tools.
[2025-05-31 06:15:34] [INFO ] Flatten gal took : 48 ms
[2025-05-31 06:15:34] [INFO ] Applying decomposition
[2025-05-31 06:15:34] [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/graph17669007305472314763.txt' '-o' '/tmp/graph17669007305472314763.bin' '-w' '/tmp/graph17669007305472314763.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17669007305472314763.bin' '-l' '-1' '-v' '-w' '/tmp/graph17669007305472314763.weights' '-q' '0' '-e' '0.001'
[2025-05-31 06:15:34] [INFO ] Decomposing Gal with order
[2025-05-31 06:15:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 06:15:34] [INFO ] Removed a total of 2660 redundant transitions.
[2025-05-31 06:15:34] [INFO ] Flatten gal took : 102 ms
[2025-05-31 06:15:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 39 ms.
[2025-05-31 06:15:34] [INFO ] Time to serialize gal into /tmp/LTL7686908818148219179.gal : 17 ms
[2025-05-31 06:15:34] [INFO ] Time to serialize properties into /tmp/LTL7933474699784638967.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7686908818148219179.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7933474699784638967.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(("(i12.u595.p2542==1)")||(X((X((F(G("(i1.i1.i0.u34.p150==1)")))||(G("(i1.i1.i0.u34.p150!=1)"))))U(("(i12.u595.p2542==1)")&&(X((F(...223
Formula 0 simplified : X(!"(i12.u595.p2542==1)" & X(!"(i12.u595.p2542==1)" W X(GF!"(i1.i1.i0.u34.p150==1)" & F!"(i1.i1.i0.u34.p150!=1)")))
Detected timeout of ITS tools.
Treatment of property DLCround-PT-07b-LTLFireability-04 finished in 308735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||X(G(p1)))))))'
Support contains 4 out of 1702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1702/1702 places, 2976/2976 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1688 transition count 2961
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1688 transition count 2961
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 38 place count 1678 transition count 2951
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 1678 transition count 2951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1678 transition count 2950
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 1673 transition count 2945
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 1673 transition count 2945
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 1669 transition count 2941
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 1669 transition count 2941
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 1666 transition count 2938
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 1666 transition count 2938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 1665 transition count 2937
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 1665 transition count 2937
Applied a total of 75 rules in 352 ms. Remains 1665 /1702 variables (removed 37) and now considering 2937/2976 (removed 39) transitions.
// Phase 1: matrix 2937 rows 1665 cols
[2025-05-31 06:15:50] [INFO ] Computed 132 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:15:50] [INFO ] Implicit Places using invariants in 735 ms returned []
[2025-05-31 06:15:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:15:52] [INFO ] Implicit Places using invariants and state equation in 1665 ms returned []
Implicit Place search using SMT with State Equation took 2402 ms to find 0 implicit places.
Running 2936 sub problems to find dead transitions.
[2025-05-31 06:15:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1664/4602 variables, and 0 constraints, problems are : Problem set: 0 solved, 2936 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1665 constraints, PredecessorRefiner: 2936/2936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2936 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1664/4602 variables, and 0 constraints, problems are : Problem set: 0 solved, 2936 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1665 constraints, PredecessorRefiner: 0/2936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60874ms problems are : Problem set: 0 solved, 2936 unsolved
Search for dead transitions found 0 dead transitions in 60882ms
Starting structural reductions in LTL mode, iteration 1 : 1665/1702 places, 2937/2976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63645 ms. Remains : 1665/1702 places, 2937/2976 transitions.
Stuttering acceptance computed with spot in 281 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 698 steps with 0 reset in 4 ms.
FORMULA DLCround-PT-07b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-06 finished in 63960 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((G(F(p0))||(p1&&F(p0)&&X(F(!p2)))))))'
Support contains 4 out of 1702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1702/1702 places, 2976/2976 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1689 transition count 2962
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1689 transition count 2962
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 1680 transition count 2953
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 1680 transition count 2953
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 1680 transition count 2952
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 1675 transition count 2947
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 1675 transition count 2947
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 1671 transition count 2943
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 1671 transition count 2943
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 1668 transition count 2940
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 1668 transition count 2940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 1667 transition count 2939
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 1667 transition count 2939
Applied a total of 71 rules in 372 ms. Remains 1667 /1702 variables (removed 35) and now considering 2939/2976 (removed 37) transitions.
// Phase 1: matrix 2939 rows 1667 cols
[2025-05-31 06:16:53] [INFO ] Computed 132 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:16:54] [INFO ] Implicit Places using invariants in 699 ms returned []
[2025-05-31 06:16:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:16:56] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned []
Implicit Place search using SMT with State Equation took 2299 ms to find 0 implicit places.
Running 2938 sub problems to find dead transitions.
[2025-05-31 06:16:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1666/4606 variables, and 0 constraints, problems are : Problem set: 0 solved, 2938 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1667 constraints, PredecessorRefiner: 2938/2938 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2938 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1666/4606 variables, and 0 constraints, problems are : Problem set: 0 solved, 2938 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1667 constraints, PredecessorRefiner: 0/2938 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60871ms problems are : Problem set: 0 solved, 2938 unsolved
Search for dead transitions found 0 dead transitions in 60876ms
Starting structural reductions in LTL mode, iteration 1 : 1667/1702 places, 2939/2976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63558 ms. Remains : 1667/1702 places, 2939/2976 transitions.
Stuttering acceptance computed with spot in 314 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p2 (NOT p0)), (NOT p0), true, (AND (NOT p0) p2)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-07
Product exploration explored 100000 steps with 40017 reset in 389 ms.
Product exploration explored 100000 steps with 39990 reset in 401 ms.
Computed a total of 261 stabilizing places and 261 stable transitions
Computed a total of 261 stabilizing places and 261 stable transitions
Detected a total of 261/1667 stabilizing places and 261/2939 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X p1), (X (NOT (AND (NOT p0) p2))), (X p0), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
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 8 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-07b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-07b-LTLFireability-07 finished in 64758 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) U X(X(p1)))&&F(G(p2)))))'
Support contains 2 out of 1702 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1702/1702 places, 2976/2976 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1688 transition count 2961
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1688 transition count 2961
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 38 place count 1678 transition count 2951
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 1678 transition count 2951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1678 transition count 2950
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 1673 transition count 2945
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 1673 transition count 2945
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 1669 transition count 2941
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 1669 transition count 2941
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 1666 transition count 2938
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 1666 transition count 2938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 1665 transition count 2937
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 1665 transition count 2937
Applied a total of 75 rules in 352 ms. Remains 1665 /1702 variables (removed 37) and now considering 2937/2976 (removed 39) transitions.
// Phase 1: matrix 2937 rows 1665 cols
[2025-05-31 06:17:58] [INFO ] Computed 132 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:17:59] [INFO ] Implicit Places using invariants in 742 ms returned []
[2025-05-31 06:17:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:18:01] [INFO ] Implicit Places using invariants and state equation in 1618 ms returned []
Implicit Place search using SMT with State Equation took 2362 ms to find 0 implicit places.
Running 2936 sub problems to find dead transitions.
[2025-05-31 06:18:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1664/4602 variables, and 0 constraints, problems are : Problem set: 0 solved, 2936 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1665 constraints, PredecessorRefiner: 2936/2936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2936 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1664/4602 variables, and 0 constraints, problems are : Problem set: 0 solved, 2936 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1665 constraints, PredecessorRefiner: 0/2936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60889ms problems are : Problem set: 0 solved, 2936 unsolved
Search for dead transitions found 0 dead transitions in 60895ms
Starting structural reductions in LTL mode, iteration 1 : 1665/1702 places, 2937/2976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63619 ms. Remains : 1665/1702 places, 2937/2976 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-09
Product exploration explored 100000 steps with 1 reset in 462 ms.
Product exploration explored 100000 steps with 1 reset in 532 ms.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Detected a total of 259/1665 stabilizing places and 259/2937 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
RANDOM walk for 28423 steps (5 resets) in 157 ms. (179 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F p1)]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
[2025-05-31 06:19:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:19:06] [INFO ] [Real]Absence check using 132 positive place invariants in 914 ms returned sat
[2025-05-31 06:19:19] [INFO ] [Real]Absence check using state equation in 13148 ms returned unknown
Could not prove EG (NOT p2)
[2025-05-31 06:19:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:19:21] [INFO ] [Real]Absence check using 132 positive place invariants in 847 ms returned sat
[2025-05-31 06:19:34] [INFO ] [Real]Absence check using state equation in 13168 ms returned unknown
Could not prove EG (NOT p1)
Support contains 2 out of 1665 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1665/1665 places, 2937/2937 transitions.
Applied a total of 0 rules in 54 ms. Remains 1665 /1665 variables (removed 0) and now considering 2937/2937 (removed 0) transitions.
[2025-05-31 06:19:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:19:34] [INFO ] Implicit Places using invariants in 696 ms returned []
[2025-05-31 06:19:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:19:36] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned []
Implicit Place search using SMT with State Equation took 2322 ms to find 0 implicit places.
Running 2936 sub problems to find dead transitions.
[2025-05-31 06:19:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1664/4602 variables, and 0 constraints, problems are : Problem set: 0 solved, 2936 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1665 constraints, PredecessorRefiner: 2936/2936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2936 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1664/4602 variables, and 0 constraints, problems are : Problem set: 0 solved, 2936 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1665 constraints, PredecessorRefiner: 0/2936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60858ms problems are : Problem set: 0 solved, 2936 unsolved
Search for dead transitions found 0 dead transitions in 60864ms
Finished structural reductions in LTL mode , in 1 iterations and 63248 ms. Remains : 1665/1665 places, 2937/2937 transitions.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Detected a total of 259/1665 stabilizing places and 259/2937 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
RANDOM walk for 19291 steps (3 resets) in 114 ms. (167 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F p1)]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
[2025-05-31 06:20:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:20:40] [INFO ] [Real]Absence check using 132 positive place invariants in 937 ms returned sat
[2025-05-31 06:20:53] [INFO ] [Real]Absence check using state equation in 13133 ms returned unknown
Could not prove EG (NOT p2)
[2025-05-31 06:20:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:20:55] [INFO ] [Real]Absence check using 132 positive place invariants in 834 ms returned sat
[2025-05-31 06:21:08] [INFO ] [Real]Absence check using state equation in 13210 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 459 ms.
Product exploration explored 100000 steps with 1 reset in 558 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Support contains 2 out of 1665 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1665/1665 places, 2937/2937 transitions.
Graph (trivial) has 1491 edges and 1665 vertex of which 436 / 1665 are part of one of the 36 SCC in 1 ms
Free SCC test removed 400 places
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Performed 260 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 260 rules applied. Total rules applied 261 place count 1265 transition count 2505
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 285 place count 1265 transition count 2493
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 285 place count 1265 transition count 2497
Deduced a syphon composed of 280 places in 6 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 293 place count 1265 transition count 2497
Discarding 132 places :
Symmetric choice reduction at 2 with 132 rule applications. Total rules 425 place count 1133 transition count 2017
Deduced a syphon composed of 204 places in 5 ms
Iterating global reduction 2 with 132 rules applied. Total rules applied 557 place count 1133 transition count 2017
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 561 place count 1133 transition count 2013
Performed 420 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 624 places in 0 ms
Iterating global reduction 3 with 420 rules applied. Total rules applied 981 place count 1133 transition count 2021
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 989 place count 1133 transition count 2013
Renaming transitions due to excessive name length > 1024 char.
Discarding 311 places :
Symmetric choice reduction at 4 with 311 rule applications. Total rules 1300 place count 822 transition count 1514
Deduced a syphon composed of 333 places in 0 ms
Iterating global reduction 4 with 311 rules applied. Total rules applied 1611 place count 822 transition count 1514
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 1631 place count 822 transition count 1494
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1639 place count 814 transition count 1486
Deduced a syphon composed of 325 places in 0 ms
Iterating global reduction 5 with 8 rules applied. Total rules applied 1647 place count 814 transition count 1486
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -215
Deduced a syphon composed of 355 places in 1 ms
Iterating global reduction 5 with 30 rules applied. Total rules applied 1677 place count 814 transition count 1701
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 1693 place count 814 transition count 1685
Discarding 42 places :
Symmetric choice reduction at 6 with 42 rule applications. Total rules 1735 place count 772 transition count 1535
Deduced a syphon composed of 317 places in 0 ms
Iterating global reduction 6 with 42 rules applied. Total rules applied 1777 place count 772 transition count 1535
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1785 place count 772 transition count 1527
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1793 place count 764 transition count 1511
Deduced a syphon composed of 309 places in 1 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1801 place count 764 transition count 1511
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 314 places in 0 ms
Iterating global reduction 7 with 5 rules applied. Total rules applied 1806 place count 764 transition count 1559
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1811 place count 759 transition count 1549
Deduced a syphon composed of 309 places in 1 ms
Iterating global reduction 7 with 5 rules applied. Total rules applied 1816 place count 759 transition count 1549
Deduced a syphon composed of 309 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 7 with 47 rules applied. Total rules applied 1863 place count 759 transition count 1502
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1879 place count 743 transition count 1470
Deduced a syphon composed of 309 places in 0 ms
Iterating global reduction 7 with 16 rules applied. Total rules applied 1895 place count 743 transition count 1470
Discarding 16 places :
Symmetric choice reduction at 7 with 16 rule applications. Total rules 1911 place count 727 transition count 1284
Deduced a syphon composed of 309 places in 0 ms
Iterating global reduction 7 with 16 rules applied. Total rules applied 1927 place count 727 transition count 1284
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 1951 place count 727 transition count 1260
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1967 place count 711 transition count 1236
Deduced a syphon composed of 293 places in 0 ms
Iterating global reduction 8 with 16 rules applied. Total rules applied 1983 place count 711 transition count 1236
Deduced a syphon composed of 293 places in 0 ms
Applied a total of 1983 rules in 532 ms. Remains 711 /1665 variables (removed 954) and now considering 1236/2937 (removed 1701) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:21:10] [INFO ] Redundant transitions in 19 ms returned []
Running 1235 sub problems to find dead transitions.
[2025-05-31 06:21:10] [INFO ] Flow matrix only has 1207 transitions (discarded 29 similar events)
// Phase 1: matrix 1207 rows 711 cols
[2025-05-31 06:21:10] [INFO ] Computed 132 invariants in 25 ms
[2025-05-31 06:21:10] [INFO ] State equation strengthened by 170 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/710 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1235 unsolved
SMT process timed out in 30593ms, After SMT, problems are : Problem set: 0 solved, 1235 unsolved
Search for dead transitions found 0 dead transitions in 30595ms
Starting structural reductions in SI_LTL mode, iteration 1 : 711/1665 places, 1236/2937 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31156 ms. Remains : 711/1665 places, 1236/2937 transitions.
Built C files in :
/tmp/ltsmin16837539468117620297
[2025-05-31 06:21:41] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16837539468117620297
Running compilation step : cd /tmp/ltsmin16837539468117620297;'/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/ltsmin16837539468117620297;'/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/ltsmin16837539468117620297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 1665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1665/1665 places, 2937/2937 transitions.
Applied a total of 0 rules in 49 ms. Remains 1665 /1665 variables (removed 0) and now considering 2937/2937 (removed 0) transitions.
// Phase 1: matrix 2937 rows 1665 cols
[2025-05-31 06:21:44] [INFO ] Computed 132 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:21:45] [INFO ] Implicit Places using invariants in 749 ms returned []
[2025-05-31 06:21:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:21:46] [INFO ] Implicit Places using invariants and state equation in 1643 ms returned []
Implicit Place search using SMT with State Equation took 2394 ms to find 0 implicit places.
Running 2936 sub problems to find dead transitions.
[2025-05-31 06:21:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1664/4602 variables, and 0 constraints, problems are : Problem set: 0 solved, 2936 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1665 constraints, PredecessorRefiner: 2936/2936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2936 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1664/4602 variables, and 0 constraints, problems are : Problem set: 0 solved, 2936 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1665 constraints, PredecessorRefiner: 0/2936 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60887ms problems are : Problem set: 0 solved, 2936 unsolved
Search for dead transitions found 0 dead transitions in 60891ms
Finished structural reductions in LTL mode , in 1 iterations and 63344 ms. Remains : 1665/1665 places, 2937/2937 transitions.
Built C files in :
/tmp/ltsmin8308857817785541476
[2025-05-31 06:22:47] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8308857817785541476
Running compilation step : cd /tmp/ltsmin8308857817785541476;'/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/ltsmin8308857817785541476;'/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/ltsmin8308857817785541476;'/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-05-31 06:22:50] [INFO ] Flatten gal took : 46 ms
[2025-05-31 06:22:50] [INFO ] Flatten gal took : 48 ms
[2025-05-31 06:22:50] [INFO ] Time to serialize gal into /tmp/LTL6373722416933502735.gal : 10 ms
[2025-05-31 06:22:50] [INFO ] Time to serialize properties into /tmp/LTL4955554364918330907.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/LTL6373722416933502735.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1683210294415615034.hoa' '-atoms' '/tmp/LTL4955554364918330907.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/LTL4955554364918330907.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1683210294415615034.hoa
Detected timeout of ITS tools.
[2025-05-31 06:23:05] [INFO ] Flatten gal took : 45 ms
[2025-05-31 06:23:05] [INFO ] Flatten gal took : 45 ms
[2025-05-31 06:23:05] [INFO ] Time to serialize gal into /tmp/LTL13018628358352564368.gal : 12 ms
[2025-05-31 06:23:05] [INFO ] Time to serialize properties into /tmp/LTL17728951672744370462.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13018628358352564368.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17728951672744370462.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(((G("(p2113==1)"))U(X(X("(p1533==1)"))))&&(F(G("(p1967==1)"))))))
Formula 0 simplified : XX(GF!"(p1967==1)" | G!"(p1533==1)")
Detected timeout of ITS tools.
[2025-05-31 06:23:21] [INFO ] Flatten gal took : 45 ms
[2025-05-31 06:23:21] [INFO ] Applying decomposition
[2025-05-31 06:23:21] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10822155395611497043.txt' '-o' '/tmp/graph10822155395611497043.bin' '-w' '/tmp/graph10822155395611497043.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10822155395611497043.bin' '-l' '-1' '-v' '-w' '/tmp/graph10822155395611497043.weights' '-q' '0' '-e' '0.001'
[2025-05-31 06:23:21] [INFO ] Decomposing Gal with order
[2025-05-31 06:23:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 06:23:21] [INFO ] Removed a total of 2698 redundant transitions.
[2025-05-31 06:23:21] [INFO ] Flatten gal took : 88 ms
[2025-05-31 06:23:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 20 ms.
[2025-05-31 06:23:21] [INFO ] Time to serialize gal into /tmp/LTL3683513693082772125.gal : 15 ms
[2025-05-31 06:23:21] [INFO ] Time to serialize properties into /tmp/LTL758227020770035698.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/LTL3683513693082772125.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL758227020770035698.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F(((G("(i16.u517.p2113==1)"))U(X(X("(i4.u411.p1533==1)"))))&&(F(G("(i13.u488.p1967==1)"))))))
Formula 0 simplified : XX(GF!"(i13.u488.p1967==1)" | G!"(i4.u411.p1533==1)")
Detected timeout of ITS tools.
Treatment of property DLCround-PT-07b-LTLFireability-09 finished in 338230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((X((p2&&G(p0)))||p1)))))'
Support contains 4 out of 1702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1702/1702 places, 2976/2976 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1688 transition count 2961
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1688 transition count 2961
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 38 place count 1678 transition count 2951
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 1678 transition count 2951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1678 transition count 2950
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 53 place count 1674 transition count 2946
Iterating global reduction 1 with 4 rules applied. Total rules applied 57 place count 1674 transition count 2946
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 1671 transition count 2943
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 1671 transition count 2943
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 1669 transition count 2941
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 1669 transition count 2941
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 1668 transition count 2940
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 1668 transition count 2940
Applied a total of 69 rules in 361 ms. Remains 1668 /1702 variables (removed 34) and now considering 2940/2976 (removed 36) transitions.
// Phase 1: matrix 2940 rows 1668 cols
[2025-05-31 06:23:36] [INFO ] Computed 132 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:23:37] [INFO ] Implicit Places using invariants in 694 ms returned []
[2025-05-31 06:23:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:23:39] [INFO ] Implicit Places using invariants and state equation in 1618 ms returned []
Implicit Place search using SMT with State Equation took 2318 ms to find 0 implicit places.
Running 2939 sub problems to find dead transitions.
[2025-05-31 06:23:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1667/4608 variables, and 0 constraints, problems are : Problem set: 0 solved, 2939 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1668 constraints, PredecessorRefiner: 2939/2939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2939 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1667/4608 variables, and 0 constraints, problems are : Problem set: 0 solved, 2939 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1668 constraints, PredecessorRefiner: 0/2939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60862ms problems are : Problem set: 0 solved, 2939 unsolved
Search for dead transitions found 0 dead transitions in 60867ms
Starting structural reductions in LTL mode, iteration 1 : 1668/1702 places, 2940/2976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63553 ms. Remains : 1668/1702 places, 2940/2976 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-10
Product exploration explored 100000 steps with 506 reset in 275 ms.
Product exploration explored 100000 steps with 491 reset in 288 ms.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 142 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 323 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), false, false, false, false, false]
RANDOM walk for 40000 steps (8 resets) in 224 ms. (177 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 216 ms. (184 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
[2025-05-31 06:24:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf5 is UNSAT
Problem apf9 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 189/193 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1475/1668 variables, 129/132 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1668 variables, 0/132 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2940/4608 variables, 1668/1800 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4608 variables, 0/1800 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4608 variables, 0/1800 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4608/4608 variables, and 1800 constraints, problems are : Problem set: 2 solved, 1 unsolved in 892 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 1668/1668 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 193/4608 variables, and 3 constraints, problems are : Problem set: 3 solved, 0 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 3/132 constraints, State Equation: 0/1668 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 947ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (G (OR (NOT p0) p1 (NOT p2))), (G (OR p0 (NOT p1) p2)), (G (OR (NOT p0) (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 15 factoid took 374 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
[2025-05-31 06:24:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:24:44] [INFO ] [Real]Absence check using 132 positive place invariants in 892 ms returned sat
[2025-05-31 06:24:58] [INFO ] [Real]Absence check using state equation in 13164 ms returned unknown
Could not prove EG (NOT p1)
Support contains 2 out of 1668 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1668/1668 places, 2940/2940 transitions.
Graph (trivial) has 1490 edges and 1668 vertex of which 422 / 1668 are part of one of the 37 SCC in 1 ms
Free SCC test removed 385 places
Ensure Unique test removed 414 transitions
Reduce isomorphic transitions removed 414 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 266 rules applied. Total rules applied 267 place count 1282 transition count 2259
Reduce places removed 266 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 302 rules applied. Total rules applied 569 place count 1016 transition count 2223
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 593 place count 992 transition count 2223
Performed 135 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 135 Pre rules applied. Total rules applied 593 place count 992 transition count 2088
Deduced a syphon composed of 135 places in 6 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 863 place count 857 transition count 2088
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 915 place count 805 transition count 1708
Iterating global reduction 3 with 52 rules applied. Total rules applied 967 place count 805 transition count 1708
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 971 place count 805 transition count 1704
Performed 305 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 305 places in 0 ms
Reduce places removed 305 places and 0 transitions.
Iterating global reduction 4 with 610 rules applied. Total rules applied 1581 place count 500 transition count 1391
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1589 place count 500 transition count 1383
Renaming transitions due to excessive name length > 1024 char.
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1608 place count 481 transition count 1186
Iterating global reduction 5 with 19 rules applied. Total rules applied 1627 place count 481 transition count 1186
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 1645 place count 481 transition count 1168
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1647 place count 480 transition count 1167
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -109
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1673 place count 467 transition count 1276
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1676 place count 467 transition count 1273
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1679 place count 464 transition count 1221
Iterating global reduction 7 with 3 rules applied. Total rules applied 1682 place count 464 transition count 1221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1685 place count 464 transition count 1218
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1691 place count 461 transition count 1238
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 8 with 32 rules applied. Total rules applied 1723 place count 461 transition count 1206
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1737 place count 447 transition count 1178
Iterating global reduction 8 with 14 rules applied. Total rules applied 1751 place count 447 transition count 1178
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1765 place count 433 transition count 1020
Iterating global reduction 8 with 14 rules applied. Total rules applied 1779 place count 433 transition count 1020
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1793 place count 433 transition count 1006
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1794 place count 432 transition count 1005
Applied a total of 1794 rules in 187 ms. Remains 432 /1668 variables (removed 1236) and now considering 1005/2940 (removed 1935) transitions.
[2025-05-31 06:24:58] [INFO ] Flow matrix only has 978 transitions (discarded 27 similar events)
// Phase 1: matrix 978 rows 432 cols
[2025-05-31 06:24:58] [INFO ] Computed 132 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:24:58] [INFO ] Implicit Places using invariants in 168 ms returned []
[2025-05-31 06:24:58] [INFO ] Flow matrix only has 978 transitions (discarded 27 similar events)
[2025-05-31 06:24:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:24:58] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-31 06:24:58] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:24:58] [INFO ] Redundant transitions in 14 ms returned []
Running 944 sub problems to find dead transitions.
[2025-05-31 06:24:58] [INFO ] Flow matrix only has 978 transitions (discarded 27 similar events)
[2025-05-31 06:24:58] [INFO ] Invariant cache hit.
[2025-05-31 06:24:58] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 2 (OVERLAPS) 2/432 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 944 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/432 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 944 unsolved
SMT process timed out in 30418ms, After SMT, problems are : Problem set: 0 solved, 944 unsolved
Search for dead transitions found 0 dead transitions in 30420ms
Starting structural reductions in SI_LTL mode, iteration 1 : 432/1668 places, 1005/2940 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31241 ms. Remains : 432/1668 places, 1005/2940 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 334 steps (0 resets) in 14 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
[2025-05-31 06:25:29] [INFO ] Flow matrix only has 978 transitions (discarded 27 similar events)
[2025-05-31 06:25:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:25:30] [INFO ] [Real]Absence check using 132 positive place invariants in 39 ms returned sat
[2025-05-31 06:25:30] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2025-05-31 06:25:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:25:31] [INFO ] [Nat]Absence check using 132 positive place invariants in 41 ms returned sat
[2025-05-31 06:25:31] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2025-05-31 06:25:31] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-31 06:25:31] [INFO ] [Nat]Added 56 Read/Feed constraints in 10 ms returned sat
[2025-05-31 06:25:31] [INFO ] Computed and/alt/rep : 602/1340/602 causal constraints (skipped 325 transitions) in 50 ms.
[2025-05-31 06:25:31] [INFO ] Added : 4 causal constraints over 1 iterations in 166 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 53 ms :[(NOT p1), (NOT p1)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-10 finished in 115153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1702/1702 places, 2976/2976 transitions.
Graph (trivial) has 1530 edges and 1702 vertex of which 450 / 1702 are part of one of the 36 SCC in 1 ms
Free SCC test removed 414 places
Ensure Unique test removed 447 transitions
Reduce isomorphic transitions removed 447 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 278 place count 1287 transition count 2251
Reduce places removed 277 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 315 rules applied. Total rules applied 593 place count 1010 transition count 2213
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 618 place count 985 transition count 2213
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 618 place count 985 transition count 2083
Deduced a syphon composed of 130 places in 5 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 878 place count 855 transition count 2083
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 939 place count 794 transition count 1684
Iterating global reduction 3 with 61 rules applied. Total rules applied 1000 place count 794 transition count 1684
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1004 place count 794 transition count 1680
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1004 place count 794 transition count 1676
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1012 place count 790 transition count 1676
Performed 298 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 298 places in 0 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 4 with 596 rules applied. Total rules applied 1608 place count 492 transition count 1370
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1616 place count 492 transition count 1362
Renaming transitions due to excessive name length > 1024 char.
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1637 place count 471 transition count 1143
Iterating global reduction 5 with 21 rules applied. Total rules applied 1658 place count 471 transition count 1143
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1678 place count 471 transition count 1123
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1702 place count 459 transition count 1214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1706 place count 459 transition count 1210
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1710 place count 455 transition count 1142
Iterating global reduction 7 with 4 rules applied. Total rules applied 1714 place count 455 transition count 1142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1718 place count 455 transition count 1138
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1726 place count 451 transition count 1164
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 8 with 34 rules applied. Total rules applied 1760 place count 451 transition count 1130
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1776 place count 435 transition count 1098
Iterating global reduction 8 with 16 rules applied. Total rules applied 1792 place count 435 transition count 1098
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1808 place count 419 transition count 918
Iterating global reduction 8 with 16 rules applied. Total rules applied 1824 place count 419 transition count 918
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 1840 place count 419 transition count 902
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1841 place count 418 transition count 901
Applied a total of 1841 rules in 196 ms. Remains 418 /1702 variables (removed 1284) and now considering 901/2976 (removed 2075) transitions.
[2025-05-31 06:25:31] [INFO ] Flow matrix only has 877 transitions (discarded 24 similar events)
// Phase 1: matrix 877 rows 418 cols
[2025-05-31 06:25:31] [INFO ] Computed 132 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:25:32] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-05-31 06:25:32] [INFO ] Flow matrix only has 877 transitions (discarded 24 similar events)
[2025-05-31 06:25:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:25:32] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-31 06:25:32] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:25:32] [INFO ] Redundant transitions in 12 ms returned []
Running 837 sub problems to find dead transitions.
[2025-05-31 06:25:32] [INFO ] Flow matrix only has 877 transitions (discarded 24 similar events)
[2025-05-31 06:25:32] [INFO ] Invariant cache hit.
[2025-05-31 06:25:32] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 837 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/417 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 837 unsolved
At refinement iteration 2 (OVERLAPS) 1/418 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 837 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 timeout
0.0)
(s191 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 837 unsolved
SMT process timed out in 30431ms, After SMT, problems are : Problem set: 0 solved, 837 unsolved
Search for dead transitions found 0 dead transitions in 30432ms
Starting structural reductions in SI_LTL mode, iteration 1 : 418/1702 places, 901/2976 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31226 ms. Remains : 418/1702 places, 901/2976 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-11 finished in 31283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(G(p1))))))'
Support contains 3 out of 1702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1702/1702 places, 2976/2976 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1690 transition count 2963
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1690 transition count 2963
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 1681 transition count 2954
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 1681 transition count 2954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 1681 transition count 2953
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 1678 transition count 2950
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 1678 transition count 2950
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 1676 transition count 2948
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 1676 transition count 2948
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1675 transition count 2947
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1675 transition count 2947
Applied a total of 55 rules in 306 ms. Remains 1675 /1702 variables (removed 27) and now considering 2947/2976 (removed 29) transitions.
// Phase 1: matrix 2947 rows 1675 cols
[2025-05-31 06:26:03] [INFO ] Computed 132 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:26:04] [INFO ] Implicit Places using invariants in 709 ms returned []
[2025-05-31 06:26:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:26:05] [INFO ] Implicit Places using invariants and state equation in 1627 ms returned []
Implicit Place search using SMT with State Equation took 2338 ms to find 0 implicit places.
Running 2946 sub problems to find dead transitions.
[2025-05-31 06:26:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1674/4622 variables, and 0 constraints, problems are : Problem set: 0 solved, 2946 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1675 constraints, PredecessorRefiner: 2946/2946 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2946 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1674/4622 variables, and 0 constraints, problems are : Problem set: 0 solved, 2946 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1675 constraints, PredecessorRefiner: 0/2946 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60887ms problems are : Problem set: 0 solved, 2946 unsolved
Search for dead transitions found 0 dead transitions in 60891ms
Starting structural reductions in LTL mode, iteration 1 : 1675/1702 places, 2947/2976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63545 ms. Remains : 1675/1702 places, 2947/2976 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-12
Product exploration explored 100000 steps with 597 reset in 258 ms.
Product exploration explored 100000 steps with 600 reset in 274 ms.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 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 201 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 18561 steps (3 resets) in 138 ms. (133 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 179 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 212 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-05-31 06:27:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:27:10] [INFO ] [Real]Absence check using 132 positive place invariants in 786 ms returned sat
[2025-05-31 06:27:23] [INFO ] [Real]Absence check using state equation in 13236 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 1675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1675/1675 places, 2947/2947 transitions.
Applied a total of 0 rules in 49 ms. Remains 1675 /1675 variables (removed 0) and now considering 2947/2947 (removed 0) transitions.
[2025-05-31 06:27:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:27:24] [INFO ] Implicit Places using invariants in 701 ms returned []
[2025-05-31 06:27:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:27:25] [INFO ] Implicit Places using invariants and state equation in 1638 ms returned []
Implicit Place search using SMT with State Equation took 2340 ms to find 0 implicit places.
Running 2946 sub problems to find dead transitions.
[2025-05-31 06:27:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1674/4622 variables, and 0 constraints, problems are : Problem set: 0 solved, 2946 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1675 constraints, PredecessorRefiner: 2946/2946 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2946 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1674/4622 variables, and 0 constraints, problems are : Problem set: 0 solved, 2946 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1675 constraints, PredecessorRefiner: 0/2946 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60868ms problems are : Problem set: 0 solved, 2946 unsolved
Search for dead transitions found 0 dead transitions in 60873ms
Finished structural reductions in LTL mode , in 1 iterations and 63270 ms. Remains : 1675/1675 places, 2947/2947 transitions.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 102 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 207 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 8906 steps (0 resets) in 72 ms. (122 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 164 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 207 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-05-31 06:28:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:28:29] [INFO ] [Real]Absence check using 132 positive place invariants in 778 ms returned sat
[2025-05-31 06:28:42] [INFO ] [Real]Absence check using state equation in 13245 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 601 reset in 267 ms.
Product exploration explored 100000 steps with 577 reset in 269 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1675/1675 places, 2947/2947 transitions.
Graph (trivial) has 1498 edges and 1675 vertex of which 408 / 1675 are part of one of the 38 SCC in 2 ms
Free SCC test removed 370 places
Ensure Unique test removed 396 transitions
Reduce isomorphic transitions removed 396 transitions.
Performed 274 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 274 rules applied. Total rules applied 275 place count 1305 transition count 2551
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 299 place count 1305 transition count 2539
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 299 place count 1305 transition count 2545
Deduced a syphon composed of 299 places in 7 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 312 place count 1305 transition count 2545
Discarding 136 places :
Symmetric choice reduction at 2 with 136 rule applications. Total rules 448 place count 1169 transition count 2081
Deduced a syphon composed of 213 places in 5 ms
Iterating global reduction 2 with 136 rules applied. Total rules applied 584 place count 1169 transition count 2081
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 588 place count 1169 transition count 2077
Performed 436 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 649 places in 1 ms
Iterating global reduction 3 with 436 rules applied. Total rules applied 1024 place count 1169 transition count 2083
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1032 place count 1169 transition count 2075
Renaming transitions due to excessive name length > 1024 char.
Discarding 323 places :
Symmetric choice reduction at 4 with 323 rule applications. Total rules 1355 place count 846 transition count 1584
Deduced a syphon composed of 344 places in 0 ms
Iterating global reduction 4 with 323 rules applied. Total rules applied 1678 place count 846 transition count 1584
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1694 place count 846 transition count 1568
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1702 place count 838 transition count 1560
Deduced a syphon composed of 336 places in 0 ms
Iterating global reduction 5 with 8 rules applied. Total rules applied 1710 place count 838 transition count 1560
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -211
Deduced a syphon composed of 366 places in 0 ms
Iterating global reduction 5 with 30 rules applied. Total rules applied 1740 place count 838 transition count 1771
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1754 place count 838 transition count 1757
Discarding 43 places :
Symmetric choice reduction at 6 with 43 rule applications. Total rules 1797 place count 795 transition count 1621
Deduced a syphon composed of 326 places in 0 ms
Iterating global reduction 6 with 43 rules applied. Total rules applied 1840 place count 795 transition count 1621
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1846 place count 795 transition count 1615
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1852 place count 789 transition count 1603
Deduced a syphon composed of 320 places in 0 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 1858 place count 789 transition count 1603
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 323 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1861 place count 789 transition count 1627
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1864 place count 786 transition count 1621
Deduced a syphon composed of 320 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 1867 place count 786 transition count 1621
Deduced a syphon composed of 320 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 7 with 33 rules applied. Total rules applied 1900 place count 786 transition count 1588
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1912 place count 774 transition count 1564
Deduced a syphon composed of 320 places in 0 ms
Iterating global reduction 7 with 12 rules applied. Total rules applied 1924 place count 774 transition count 1564
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1936 place count 762 transition count 1426
Deduced a syphon composed of 320 places in 1 ms
Iterating global reduction 7 with 12 rules applied. Total rules applied 1948 place count 762 transition count 1426
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 1966 place count 762 transition count 1408
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 1978 place count 750 transition count 1390
Deduced a syphon composed of 308 places in 1 ms
Iterating global reduction 8 with 12 rules applied. Total rules applied 1990 place count 750 transition count 1390
Deduced a syphon composed of 308 places in 0 ms
Applied a total of 1990 rules in 552 ms. Remains 750 /1675 variables (removed 925) and now considering 1390/2947 (removed 1557) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:28:44] [INFO ] Redundant transitions in 25 ms returned []
Running 1389 sub problems to find dead transitions.
[2025-05-31 06:28:44] [INFO ] Flow matrix only has 1353 transitions (discarded 37 similar events)
// Phase 1: matrix 1353 rows 750 cols
[2025-05-31 06:28:44] [INFO ] Computed 132 invariants in 25 ms
[2025-05-31 06:28:44] [INFO ] State equation strengthened by 158 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
SMT process timed out in 30658ms, After SMT, problems are : Problem set: 0 solved, 1389 unsolved
Search for dead transitions found 0 dead transitions in 30660ms
Starting structural reductions in SI_LTL mode, iteration 1 : 750/1675 places, 1390/2947 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31250 ms. Remains : 750/1675 places, 1390/2947 transitions.
Built C files in :
/tmp/ltsmin920858292355509982
[2025-05-31 06:29:15] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin920858292355509982
Running compilation step : cd /tmp/ltsmin920858292355509982;'/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/ltsmin920858292355509982;'/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/ltsmin920858292355509982;'/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 3 out of 1675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1675/1675 places, 2947/2947 transitions.
Applied a total of 0 rules in 49 ms. Remains 1675 /1675 variables (removed 0) and now considering 2947/2947 (removed 0) transitions.
// Phase 1: matrix 2947 rows 1675 cols
[2025-05-31 06:29:18] [INFO ] Computed 132 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:29:18] [INFO ] Implicit Places using invariants in 716 ms returned []
[2025-05-31 06:29:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:29:20] [INFO ] Implicit Places using invariants and state equation in 1634 ms returned []
Implicit Place search using SMT with State Equation took 2352 ms to find 0 implicit places.
Running 2946 sub problems to find dead transitions.
[2025-05-31 06:29:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1674/4622 variables, and 0 constraints, problems are : Problem set: 0 solved, 2946 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1675 constraints, PredecessorRefiner: 2946/2946 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2946 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1674/4622 variables, and 0 constraints, problems are : Problem set: 0 solved, 2946 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1675 constraints, PredecessorRefiner: 0/2946 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60863ms problems are : Problem set: 0 solved, 2946 unsolved
Search for dead transitions found 0 dead transitions in 60868ms
Finished structural reductions in LTL mode , in 1 iterations and 63279 ms. Remains : 1675/1675 places, 2947/2947 transitions.
Built C files in :
/tmp/ltsmin1993359771377909245
[2025-05-31 06:30:21] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1993359771377909245
Running compilation step : cd /tmp/ltsmin1993359771377909245;'/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/ltsmin1993359771377909245;'/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/ltsmin1993359771377909245;'/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-05-31 06:30:24] [INFO ] Flatten gal took : 44 ms
[2025-05-31 06:30:24] [INFO ] Flatten gal took : 45 ms
[2025-05-31 06:30:24] [INFO ] Time to serialize gal into /tmp/LTL17797134144650342934.gal : 10 ms
[2025-05-31 06:30:24] [INFO ] Time to serialize properties into /tmp/LTL3604353186792873016.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/LTL17797134144650342934.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5451340668319311639.hoa' '-atoms' '/tmp/LTL3604353186792873016.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3604353186792873016.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5451340668319311639.hoa
Detected timeout of ITS tools.
[2025-05-31 06:30:39] [INFO ] Flatten gal took : 46 ms
[2025-05-31 06:30:39] [INFO ] Flatten gal took : 46 ms
[2025-05-31 06:30:39] [INFO ] Time to serialize gal into /tmp/LTL3942118085083926665.gal : 9 ms
[2025-05-31 06:30:39] [INFO ] Time to serialize properties into /tmp/LTL17200882294635763916.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/LTL3942118085083926665.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17200882294635763916.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F("(((p1014==1)||(p556==1))||(p1014==1))"))||(X(X(G("(p15==1)")))))))
Formula 0 simplified : X(G!"(((p1014==1)||(p556==1))||(p1014==1))" & XXF!"(p15==1)")
Detected timeout of ITS tools.
[2025-05-31 06:30:54] [INFO ] Flatten gal took : 45 ms
[2025-05-31 06:30:54] [INFO ] Applying decomposition
[2025-05-31 06:30:54] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7373436578622837060.txt' '-o' '/tmp/graph7373436578622837060.bin' '-w' '/tmp/graph7373436578622837060.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7373436578622837060.bin' '-l' '-1' '-v' '-w' '/tmp/graph7373436578622837060.weights' '-q' '0' '-e' '0.001'
[2025-05-31 06:30:55] [INFO ] Decomposing Gal with order
[2025-05-31 06:30:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 06:30:55] [INFO ] Removed a total of 2687 redundant transitions.
[2025-05-31 06:30:55] [INFO ] Flatten gal took : 83 ms
[2025-05-31 06:30:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 22 ms.
[2025-05-31 06:30:55] [INFO ] Time to serialize gal into /tmp/LTL14212211326520047865.gal : 15 ms
[2025-05-31 06:30:55] [INFO ] Time to serialize properties into /tmp/LTL11019777994435944500.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/LTL14212211326520047865.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11019777994435944500.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((F("(((i11.u251.p1014==1)||(i5.u120.p556==1))||(i11.u251.p1014==1))"))||(X(X(G("(i0.i1.i0.u6.p15==1)")))))))
Formula 0 simplified : X(G!"(((i11.u251.p1014==1)||(i5.u120.p556==1))||(i11.u251.p1014==1))" & XXF!"(i0.i1.i0.u6.p15==1)")
Detected timeout of ITS tools.
Treatment of property DLCround-PT-07b-LTLFireability-12 finished in 307309 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 3 out of 1702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1702/1702 places, 2976/2976 transitions.
Graph (trivial) has 1529 edges and 1702 vertex of which 450 / 1702 are part of one of the 36 SCC in 2 ms
Free SCC test removed 414 places
Ensure Unique test removed 447 transitions
Reduce isomorphic transitions removed 447 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 276 transitions
Trivial Post-agglo rules discarded 276 transitions
Performed 276 trivial Post agglomeration. Transition count delta: 276
Iterating post reduction 0 with 276 rules applied. Total rules applied 277 place count 1287 transition count 2252
Reduce places removed 276 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 314 rules applied. Total rules applied 591 place count 1011 transition count 2214
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 616 place count 986 transition count 2214
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 616 place count 986 transition count 2084
Deduced a syphon composed of 130 places in 6 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 876 place count 856 transition count 2084
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 936 place count 796 transition count 1686
Iterating global reduction 3 with 60 rules applied. Total rules applied 996 place count 796 transition count 1686
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1000 place count 796 transition count 1682
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1000 place count 796 transition count 1679
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1006 place count 793 transition count 1679
Performed 299 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 299 places in 0 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 4 with 598 rules applied. Total rules applied 1604 place count 494 transition count 1372
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1612 place count 494 transition count 1364
Renaming transitions due to excessive name length > 1024 char.
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1632 place count 474 transition count 1156
Iterating global reduction 5 with 20 rules applied. Total rules applied 1652 place count 474 transition count 1156
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 1671 place count 474 transition count 1137
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1697 place count 461 transition count 1234
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1701 place count 461 transition count 1230
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1705 place count 457 transition count 1160
Iterating global reduction 7 with 4 rules applied. Total rules applied 1709 place count 457 transition count 1160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1713 place count 457 transition count 1156
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1721 place count 453 transition count 1182
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 8 with 36 rules applied. Total rules applied 1757 place count 453 transition count 1146
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1773 place count 437 transition count 1114
Iterating global reduction 8 with 16 rules applied. Total rules applied 1789 place count 437 transition count 1114
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1805 place count 421 transition count 934
Iterating global reduction 8 with 16 rules applied. Total rules applied 1821 place count 421 transition count 934
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 1837 place count 421 transition count 918
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1838 place count 420 transition count 917
Applied a total of 1838 rules in 191 ms. Remains 420 /1702 variables (removed 1282) and now considering 917/2976 (removed 2059) transitions.
[2025-05-31 06:31:10] [INFO ] Flow matrix only has 892 transitions (discarded 25 similar events)
// Phase 1: matrix 892 rows 420 cols
[2025-05-31 06:31:10] [INFO ] Computed 132 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:31:10] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-05-31 06:31:10] [INFO ] Flow matrix only has 892 transitions (discarded 25 similar events)
[2025-05-31 06:31:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:31:10] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-05-31 06:31:11] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:31:11] [INFO ] Redundant transitions in 12 ms returned []
Running 852 sub problems to find dead transitions.
[2025-05-31 06:31:11] [INFO ] Flow matrix only has 892 transitions (discarded 25 similar events)
[2025-05-31 06:31:11] [INFO ] Invariant cache hit.
[2025-05-31 06:31:11] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 2 (OVERLAPS) 1/420 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 852 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 852 unsolved
SMT process timed out in 30412ms, After SMT, problems are : Problem set: 0 solved, 852 unsolved
Search for dead transitions found 0 dead transitions in 30413ms
Starting structural reductions in SI_LTL mode, iteration 1 : 420/1702 places, 917/2976 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31199 ms. Remains : 420/1702 places, 917/2976 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-13 finished in 31349 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(F(p1)))))'
Support contains 2 out of 1702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1702/1702 places, 2976/2976 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1688 transition count 2961
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1688 transition count 2961
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 38 place count 1678 transition count 2951
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 1678 transition count 2951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1678 transition count 2950
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 53 place count 1674 transition count 2946
Iterating global reduction 1 with 4 rules applied. Total rules applied 57 place count 1674 transition count 2946
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 1670 transition count 2942
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 1670 transition count 2942
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 1667 transition count 2939
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 1667 transition count 2939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 1666 transition count 2938
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 1666 transition count 2938
Applied a total of 73 rules in 356 ms. Remains 1666 /1702 variables (removed 36) and now considering 2938/2976 (removed 38) transitions.
// Phase 1: matrix 2938 rows 1666 cols
[2025-05-31 06:31:42] [INFO ] Computed 132 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:31:42] [INFO ] Implicit Places using invariants in 697 ms returned []
[2025-05-31 06:31:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:31:44] [INFO ] Implicit Places using invariants and state equation in 1633 ms returned []
Implicit Place search using SMT with State Equation took 2332 ms to find 0 implicit places.
Running 2937 sub problems to find dead transitions.
[2025-05-31 06:31:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1665/4604 variables, and 0 constraints, problems are : Problem set: 0 solved, 2937 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1666 constraints, PredecessorRefiner: 2937/2937 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2937 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s53 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1665/4604 variables, and 0 constraints, problems are : Problem set: 0 solved, 2937 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/132 constraints, State Equation: 0/1666 constraints, PredecessorRefiner: 0/2937 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60882ms problems are : Problem set: 0 solved, 2937 unsolved
Search for dead transitions found 0 dead transitions in 60892ms
Starting structural reductions in LTL mode, iteration 1 : 1666/1702 places, 2938/2976 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63586 ms. Remains : 1666/1702 places, 2938/2976 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-07b-LTLFireability-15
Product exploration explored 100000 steps with 96 reset in 353 ms.
Product exploration explored 100000 steps with 97 reset in 378 ms.
Computed a total of 259 stabilizing places and 259 stable transitions
Computed a total of 259 stabilizing places and 259 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 109 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 206 ms. (193 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
[2025-05-31 06:32:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/167 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1499/1666 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1666 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2938/4604 variables, 1666/1798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4604 variables, 0/1798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4604 variables, 0/1798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4604/4604 variables, and 1798 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1257 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 1666/1666 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 165/167 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1499/1666 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1666 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2938/4604 variables, 1666/1798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4604 variables, 1/1799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4604 variables, 0/1799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4604 variables, 0/1799 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4604/4604 variables, and 1799 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1215 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 1666/1666 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2483ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 8710 steps, including 13 resets, run visited all 1 properties in 34 ms. (steps per millisecond=256 )
Parikh walk visited 1 properties in 35 ms.
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 p1), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 277 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-05-31 06:32:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:32:51] [INFO ] [Real]Absence check using 132 positive place invariants in 877 ms returned sat
[2025-05-31 06:33:04] [INFO ] [Real]Absence check using state equation in 13170 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 1666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1666/1666 places, 2938/2938 transitions.
Graph (trivial) has 1491 edges and 1666 vertex of which 436 / 1666 are part of one of the 36 SCC in 2 ms
Free SCC test removed 400 places
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 259 transitions
Trivial Post-agglo rules discarded 259 transitions
Performed 259 trivial Post agglomeration. Transition count delta: 259
Iterating post reduction 0 with 259 rules applied. Total rules applied 260 place count 1265 transition count 2246
Reduce places removed 259 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 295 rules applied. Total rules applied 555 place count 1006 transition count 2210
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 579 place count 982 transition count 2210
Performed 133 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 133 Pre rules applied. Total rules applied 579 place count 982 transition count 2077
Deduced a syphon composed of 133 places in 6 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 845 place count 849 transition count 2077
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 901 place count 793 transition count 1673
Iterating global reduction 3 with 56 rules applied. Total rules applied 957 place count 793 transition count 1673
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 961 place count 793 transition count 1669
Performed 299 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 299 places in 0 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 4 with 598 rules applied. Total rules applied 1559 place count 494 transition count 1362
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1566 place count 494 transition count 1355
Renaming transitions due to excessive name length > 1024 char.
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1586 place count 474 transition count 1147
Iterating global reduction 5 with 20 rules applied. Total rules applied 1606 place count 474 transition count 1147
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1626 place count 474 transition count 1127
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1650 place count 462 transition count 1218
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1654 place count 462 transition count 1214
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1658 place count 458 transition count 1146
Iterating global reduction 7 with 4 rules applied. Total rules applied 1662 place count 458 transition count 1146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1666 place count 458 transition count 1142
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1674 place count 454 transition count 1168
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 8 with 32 rules applied. Total rules applied 1706 place count 454 transition count 1136
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1720 place count 440 transition count 1108
Iterating global reduction 8 with 14 rules applied. Total rules applied 1734 place count 440 transition count 1108
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1748 place count 426 transition count 950
Iterating global reduction 8 with 14 rules applied. Total rules applied 1762 place count 426 transition count 950
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1776 place count 426 transition count 936
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1777 place count 425 transition count 935
Applied a total of 1777 rules in 189 ms. Remains 425 /1666 variables (removed 1241) and now considering 935/2938 (removed 2003) transitions.
[2025-05-31 06:33:04] [INFO ] Flow matrix only has 909 transitions (discarded 26 similar events)
// Phase 1: matrix 909 rows 425 cols
[2025-05-31 06:33:04] [INFO ] Computed 132 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:33:05] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-05-31 06:33:05] [INFO ] Flow matrix only has 909 transitions (discarded 26 similar events)
[2025-05-31 06:33:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:33:05] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-31 06:33:05] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 06:33:05] [INFO ] Redundant transitions in 15 ms returned []
Running 870 sub problems to find dead transitions.
[2025-05-31 06:33:05] [INFO ] Flow matrix only has 909 transitions (discarded 26 similar events)
[2025-05-31 06:33:05] [INFO ] Invariant cache hit.
[2025-05-31 06:33:05] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 870 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 870 unsolved
At refinement iteration 2 (OVERLAPS) 1/425 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 870 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 870 unsolved
SMT process timed out in 30426ms, After SMT, problems are : Problem set: 0 solved, 870 unsolved
Search for dead transitions found 0 dead transitions in 30429ms
Starting structural reductions in SI_LTL mode, iteration 1 : 425/1666 places, 935/2938 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31236 ms. Remains : 425/1666 places, 935/2938 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 10 factoid took 294 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2426 steps (0 resets) in 46 ms. (51 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 498 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-05-31 06:33:37] [INFO ] Flow matrix only has 909 transitions (discarded 26 similar events)
[2025-05-31 06:33:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:33:37] [INFO ] [Real]Absence check using 132 positive place invariants in 39 ms returned sat
[2025-05-31 06:33:38] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2025-05-31 06:33:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 06:33:38] [INFO ] [Nat]Absence check using 132 positive place invariants in 40 ms returned sat
[2025-05-31 06:33:38] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2025-05-31 06:33:38] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-31 06:33:38] [INFO ] [Nat]Added 45 Read/Feed constraints in 6 ms returned sat
[2025-05-31 06:33:38] [INFO ] Computed and/alt/rep : 553/1242/553 causal constraints (skipped 302 transitions) in 44 ms.
[2025-05-31 06:33:39] [INFO ] Added : 2 causal constraints over 1 iterations in 157 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-07b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-07b-LTLFireability-15 finished in 117575 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((X(X(X(p0)))||G((p0||F(p1))))))'
Found a Shortening insensitive property : DLCround-PT-07b-LTLFireability-01
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1702 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1702/1702 places, 2976/2976 transitions.
Graph (trivial) has 1531 edges and 1702 vertex of which 444 / 1702 are part of one of the 35 SCC in 2 ms
Free SCC test removed 409 places
Ensure Unique test removed 442 transitions
Reduce isomorphic transitions removed 442 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 280 place count 1292 transition count 2254
Reduce places removed 279 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 317 rules applied. Total rules applied 597 place count 1013 transition count 2216
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 622 place count 988 transition count 2216
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 622 place count 988 transition count 2085
Deduced a syphon composed of 131 places in 6 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 884 place count 857 transition count 2085
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 945 place count 796 transition count 1686
Iterating global reduction 3 with 61 rules applied. Total rules applied 1006 place count 796 transition count 1686
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1010 place count 796 transition count 1682
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1010 place count 796 transition count 1678
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1018 place count 792 transition count 1678
Performed 297 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 297 places in 0 ms
Reduce places removed 297 places and 0 transitions.
Iterating global reduction 4 with 594 rules applied. Total rules applied 1612 place count 495 transition count 1373
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1620 place count 495 transition count 1365
Renaming transitions due to excessive name length > 1024 char.
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1640 place count 475 transition count 1157
Iterating global reduction 5 with 20 rules applied. Total rules applied 1660 place count 475 transition count 1157
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1680 place count 475 transition count 1137
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1704 place count 463 transition count 1228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1708 place count 463 transition count 1224
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1712 place count 459 transition count 1156
Iterating global reduction 7 with 4 rules applied. Total rules applied 1716 place count 459 transition count 1156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1720 place count 459 transition count 1152
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1728 place count 455 transition count 1178
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1732 place count 455 transition count 1174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1733 place count 454 transition count 1173
Applied a total of 1733 rules in 157 ms. Remains 454 /1702 variables (removed 1248) and now considering 1173/2976 (removed 1803) transitions.
[2025-05-31 06:33:39] [INFO ] Flow matrix only has 1132 transitions (discarded 41 similar events)
// Phase 1: matrix 1132 rows 454 cols
[2025-05-31 06:33:39] [INFO ] Computed 132 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:33:39] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-05-31 06:33:39] [INFO ] Flow matrix only has 1132 transitions (discarded 41 similar events)
[2025-05-31 06:33:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:33:40] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-05-31 06:33:40] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
Running 1126 sub problems to find dead transitions.
[2025-05-31 06:33:40] [INFO ] Flow matrix only has 1132 transitions (discarded 41 similar events)
[2025-05-31 06:33:40] [INFO ] Invariant cache hit.
[2025-05-31 06:33:40] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1126 unsolved
At refinement iteration 2 (OVERLAPS) 2/454 variables, 127/132 constraints. Problems are: Problem set: 0 solved, 1126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1586 variables, and 132 constraints, problems are : Problem set: 0 solved, 1126 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 0/454 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1126/1126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1126 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1126 unsolved
At refinement iteration 2 (OVERLAPS) 2/454 variables, 127/132 constraints. Problems are: Problem set: 0 solved, 1126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1126 unsolved
SMT process timed out in 60565ms, After SMT, problems are : Problem set: 0 solved, 1126 unsolved
Search for dead transitions found 0 dead transitions in 60566ms
Starting structural reductions in LI_LTL mode, iteration 1 : 454/1702 places, 1173/2976 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61441 ms. Remains : 454/1702 places, 1173/2976 transitions.
Running random walk in product with property : DLCround-PT-07b-LTLFireability-01
Stuttering criterion allowed to conclude after 35 steps with 8 reset in 0 ms.
Treatment of property DLCround-PT-07b-LTLFireability-01 finished in 61758 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((X((F(G(p1))||G(!p1))) U (p0&&X((F(G(p1))||G(!p1)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0) U X(X(p1)))&&F(G(p2)))))'
Found a Shortening insensitive property : DLCround-PT-07b-LTLFireability-09
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Support contains 2 out of 1702 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 1702/1702 places, 2976/2976 transitions.
Graph (trivial) has 1529 edges and 1702 vertex of which 450 / 1702 are part of one of the 36 SCC in 1 ms
Free SCC test removed 414 places
Ensure Unique test removed 447 transitions
Reduce isomorphic transitions removed 447 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 278 place count 1287 transition count 2251
Reduce places removed 277 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 315 rules applied. Total rules applied 593 place count 1010 transition count 2213
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 618 place count 985 transition count 2213
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 618 place count 985 transition count 2083
Deduced a syphon composed of 130 places in 5 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 878 place count 855 transition count 2083
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 938 place count 795 transition count 1685
Iterating global reduction 3 with 60 rules applied. Total rules applied 998 place count 795 transition count 1685
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1002 place count 795 transition count 1681
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1002 place count 795 transition count 1678
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1008 place count 792 transition count 1678
Performed 295 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 295 places in 0 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 4 with 590 rules applied. Total rules applied 1598 place count 497 transition count 1375
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1606 place count 497 transition count 1367
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 1627 place count 476 transition count 1148
Iterating global reduction 5 with 21 rules applied. Total rules applied 1648 place count 476 transition count 1148
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 1668 place count 476 transition count 1128
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -158
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 1710 place count 455 transition count 1286
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1714 place count 455 transition count 1282
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1718 place count 451 transition count 1208
Iterating global reduction 7 with 4 rules applied. Total rules applied 1722 place count 451 transition count 1208
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1726 place count 451 transition count 1204
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1734 place count 447 transition count 1234
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 1747 place count 447 transition count 1221
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1748 place count 446 transition count 1220
Applied a total of 1748 rules in 155 ms. Remains 446 /1702 variables (removed 1256) and now considering 1220/2976 (removed 1756) transitions.
[2025-05-31 06:34:41] [INFO ] Flow matrix only has 1145 transitions (discarded 75 similar events)
// Phase 1: matrix 1145 rows 446 cols
[2025-05-31 06:34:41] [INFO ] Computed 132 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:34:41] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-05-31 06:34:41] [INFO ] Flow matrix only has 1145 transitions (discarded 75 similar events)
[2025-05-31 06:34:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:34:42] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-31 06:34:42] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
Running 1140 sub problems to find dead transitions.
[2025-05-31 06:34:42] [INFO ] Flow matrix only has 1145 transitions (discarded 75 similar events)
[2025-05-31 06:34:42] [INFO ] Invariant cache hit.
[2025-05-31 06:34:42] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 2 (OVERLAPS) 1/446 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/1591 variables, and 132 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 0/446 constraints, ReadFeed: 0/64 constraints, PredecessorRefiner: 1140/1140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1140 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 2 (OVERLAPS) 1/446 variables, 120/132 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/1591 variables, and 132 constraints, problems are : Problem set: 0 solved, 1140 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 132/132 constraints, State Equation: 0/446 constraints, ReadFeed: 0/64 constraints, PredecessorRefiner: 0/1140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60443ms problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 60445ms
Starting structural reductions in LI_LTL mode, iteration 1 : 446/1702 places, 1220/2976 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61306 ms. Remains : 446/1702 places, 1220/2976 transitions.
Running random walk in product with property : DLCround-PT-07b-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property DLCround-PT-07b-LTLFireability-09 finished in 61620 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(G(p1))))))'
[2025-05-31 06:35:42] [INFO ] Flatten gal took : 45 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13394837245484556876
[2025-05-31 06:35:42] [INFO ] Too many transitions (2976) to apply POR reductions. Disabling POR matrices.
[2025-05-31 06:35:42] [INFO ] Applying decomposition
[2025-05-31 06:35:42] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13394837245484556876
Running compilation step : cd /tmp/ltsmin13394837245484556876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-31 06:35:43] [INFO ] Flatten gal took : 48 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/graph14913558416277072268.txt' '-o' '/tmp/graph14913558416277072268.bin' '-w' '/tmp/graph14913558416277072268.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14913558416277072268.bin' '-l' '-1' '-v' '-w' '/tmp/graph14913558416277072268.weights' '-q' '0' '-e' '0.001'
[2025-05-31 06:35:43] [INFO ] Decomposing Gal with order
[2025-05-31 06:35:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 06:35:43] [INFO ] Removed a total of 2659 redundant transitions.
[2025-05-31 06:35:43] [INFO ] Flatten gal took : 86 ms
[2025-05-31 06:35:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 11 ms.
[2025-05-31 06:35:43] [INFO ] Time to serialize gal into /tmp/LTLFireability11636566200305493307.gal : 16 ms
[2025-05-31 06:35:43] [INFO ] Time to serialize properties into /tmp/LTLFireability7112276251404967667.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/LTLFireability11636566200305493307.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7112276251404967667.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((F((X(X(X("(i0.i0.i1.u3.p7==0)"))))||(G(("(i0.i0.i1.u3.p7==0)")||(F("((i0.i0.i1.u3.p7==0)&&(i12.u201.p811==0))")))))))
Formula 0 simplified : G(XXX!"(i0.i0.i1.u3.p7==0)" & F(!"(i0.i0.i1.u3.p7==0)" & G!"((i0.i0.i1.u3.p7==0)&&(i12.u201.p811==0))"))
Compilation finished in 6543 ms.
Running link step : cd /tmp/ltsmin13394837245484556876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin13394837245484556876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(X(X((LTLAPp0==true))))||[](((LTLAPp0==true)||<>((LTLAPp1==true))))))' '--buchi-type=spotba'
LTSmin run took 1064 ms.
FORMULA DLCround-PT-07b-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin13394837245484556876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp2==true)||X((X((<>([]((LTLAPp3==true)))||[](!(LTLAPp3==true)))) U ((LTLAPp2==true)&&X((<>([]((LTLAPp3==true)))||[](!(LTLAPp3==true)))))))))' '--buchi-type=spotba'
LTSmin run took 8947 ms.
FORMULA DLCround-PT-07b-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin13394837245484556876;'/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' '<>((([]((LTLAPp4==true)) U X(X((LTLAPp5==true))))&&<>([]((LTLAPp6==true)))))' '--buchi-type=spotba'
LTSmin run took 1166 ms.
FORMULA DLCround-PT-07b-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin13394837245484556876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp7==true))||X(X([]((LTLAPp8==true))))))' '--buchi-type=spotba'
LTSmin run took 62366 ms.
FORMULA DLCround-PT-07b-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2181422 ms.

BK_STOP 1748673423288

--------------------
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="DLCround-PT-07b"
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 DLCround-PT-07b, 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 r072-tall-174860067000188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-07b.tgz
mv DLCround-PT-07b 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 ;