Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r240-tall-174915590100619.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 TwoPhaseLocking-PT-nC10000vN, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915590100619
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.4K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 209K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 4.6K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749260941338

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TwoPhaseLocking-PT-nC10000vN
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-07 01:49:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 01:49:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 01:49:02] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2025-06-07 01:49:02] [INFO ] Transformed 8 places.
[2025-06-07 01:49:02] [INFO ] Transformed 6 transitions.
[2025-06-07 01:49:02] [INFO ] Parsed PT model containing 8 places and 6 transitions and 18 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA TwoPhaseLocking-PT-nC10000vN-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC10000vN-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 6 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2025-06-07 01:49:03] [INFO ] Computed 3 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:03] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-06-07 01:49:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:03] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2025-06-07 01:49:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 264ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 276ms
Finished structural reductions in LTL mode , in 1 iterations and 522 ms. Remains : 8/8 places, 6/6 transitions.
Support contains 8 out of 8 places after structural reductions.
[2025-06-07 01:49:03] [INFO ] Flatten gal took : 13 ms
[2025-06-07 01:49:03] [INFO ] Flatten gal took : 4 ms
[2025-06-07 01:49:03] [INFO ] Input system was already deterministic with 6 transitions.
RANDOM walk for 40012 steps (4 resets) in 110 ms. (360 steps per ms) remains 20/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 91 ms. (43 steps per ms) remains 10/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 10/10 properties
[2025-06-07 01:49:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 10 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 21 constraints, problems are : Problem set: 0 solved, 10 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 246ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 8 different solutions.
Finished Parikh walk after 1981781 steps, including 98 resets, run visited all 6 properties in 3677 ms. (steps per millisecond=538 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 24452 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA TwoPhaseLocking-PT-nC10000vN-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
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 0 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 13 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2025-06-07 01:49:29] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:29] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-07 01:49:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:29] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 01:49:29] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-07 01:49:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/10 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/10 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 91ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 4/6 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 6/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vN-LTLCardinality-00 finished in 485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U ((p1&&X(X(p0)))||X(X(G(p0))))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2025-06-07 01:49:29] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:29] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-07 01:49:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:29] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2025-06-07 01:49:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 128ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 128ms
Finished structural reductions in LTL mode , in 1 iterations and 187 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vN-LTLCardinality-01 finished in 332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((p1&&X(p0)&&F(p2))||X(G(p0)))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2025-06-07 01:49:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:30] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-07 01:49:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:30] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2025-06-07 01:49:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 131ms
Finished structural reductions in LTL mode , in 1 iterations and 188 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 11 steps with 1 reset in 1 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vN-LTLCardinality-02 finished in 421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((p0&&X(X(p1)))||G(p1))))||(p2&&X(F(((p0&&X(X(p1)))||G(p1))))))))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2025-06-07 01:49:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:30] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-07 01:49:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:30] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2025-06-07 01:49:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 128ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 128ms
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 423 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 239 ms.
Stack based approach found an accepted trace after 31 steps with 0 reset with depth 32 and stack size 32 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vN-LTLCardinality-03 finished in 890 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(X(p2)&&(p0 U (p1||G(p0))))))))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2025-06-07 01:49:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:31] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-07 01:49:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:31] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2025-06-07 01:49:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 127ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 127ms
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 143 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vN-LTLCardinality-04 finished in 465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U ((X(X(p1))&&F(p2))||X(X(G(p1))))) U G(p2)))'
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2025-06-07 01:49:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:31] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-07 01:49:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:31] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2025-06-07 01:49:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 113ms
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 717 ms :[(NOT p2), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 95 ms.
Stack based approach found an accepted trace after 66 steps with 0 reset with depth 67 and stack size 67 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vN-LTLCardinality-06 finished in 998 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(G(((p0 U X(p1)) U X(X(p2)))))))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2025-06-07 01:49:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:32] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-07 01:49:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:32] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2025-06-07 01:49:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 111ms
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 609 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vN-LTLCardinality-08 finished in 803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(p0))) U (p1&&X(X(X(p0)))))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2025-06-07 01:49:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:33] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-07 01:49:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:33] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2025-06-07 01:49:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 127ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 127ms
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vN-LTLCardinality-11 finished in 412 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&&G(p1))))'
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2025-06-07 01:49:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:34] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-07 01:49:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:34] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2025-06-07 01:49:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 120ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 120ms
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vN-LTLCardinality-12 finished in 295 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))||G(!p0)))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 4 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2025-06-07 01:49:34] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:34] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-07 01:49:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:34] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 01:49:34] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-07 01:49:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 14 constraints, problems are : Problem set: 0 solved, 4 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 99ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8 places, 5/6 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 105 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 79 ms.
Product exploration explored 100000 steps with 0 reset in 195 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 102 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40012 steps (4 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
[2025-06-07 01:49:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 10 constraints, problems are : Problem set: 0 solved, 2 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 12 constraints, problems are : Problem set: 0 solved, 2 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 10003 steps, including 0 resets, run visited all 2 properties in 74 ms. (steps per millisecond=135 )
Parikh walk visited 2 properties in 74 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 222 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2025-06-07 01:49:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:35] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-07 01:49:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:35] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 01:49:35] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-07 01:49:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 14 constraints, problems are : Problem set: 0 solved, 4 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 118ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 7/7 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 96 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40012 steps (4 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
[2025-06-07 01:49:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 10 constraints, problems are : Problem set: 0 solved, 2 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 12 constraints, problems are : Problem set: 0 solved, 2 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 240ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 10003 steps, including 0 resets, run visited all 2 properties in 64 ms. (steps per millisecond=156 )
Parikh walk visited 2 properties in 63 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 221 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 74 ms.
Product exploration explored 100000 steps with 0 reset in 118 ms.
Built C files in :
/tmp/ltsmin3364699994561972261
[2025-06-07 01:49:37] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2025-06-07 01:49:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 01:49:37] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2025-06-07 01:49:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 01:49:37] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2025-06-07 01:49:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 01:49:37] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3364699994561972261
Running compilation step : cd /tmp/ltsmin3364699994561972261;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 241 ms.
Running link step : cd /tmp/ltsmin3364699994561972261;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin3364699994561972261;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1944429724559582943.hoa' '--buchi-type=spotba'
LTSmin run took 1410 ms.
FORMULA TwoPhaseLocking-PT-nC10000vN-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC10000vN-LTLCardinality-13 finished in 4957 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(p1)&&F(p0)) U p2)))))'
Support contains 2 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2025-06-07 01:49:39] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:39] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-07 01:49:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:39] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2025-06-07 01:49:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 123ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 123ms
Finished structural reductions in LTL mode , in 1 iterations and 177 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-LTLCardinality-14
Product exploration explored 100000 steps with 11564 reset in 183 ms.
Product exploration explored 100000 steps with 11543 reset in 199 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 80 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 p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40012 steps (4 resets) in 15 ms. (2500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4449 steps (0 resets) in 13 ms. (317 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F p2)]
Knowledge based reduction with 7 factoid took 263 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 195 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2025-06-07 01:49:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 01:49:40] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2025-06-07 01:49:40] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-07 01:49:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 01:49:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-07 01:49:40] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-07 01:49:40] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-07 01:49:40] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 2 out of 8 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 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2025-06-07 01:49:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:41] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-07 01:49:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:41] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 01:49:41] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-07 01:49:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 120ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 120ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 ms. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 114 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 195 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40015 steps (4 resets) in 15 ms. (2500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 3849 steps (1 resets) in 11 ms. (320 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F p2)]
Knowledge based reduction with 13 factoid took 341 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 200 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2025-06-07 01:49:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 01:49:42] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2025-06-07 01:49:42] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-07 01:49:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 01:49:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-07 01:49:42] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-07 01:49:42] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-07 01:49:42] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 11569 reset in 81 ms.
Product exploration explored 100000 steps with 11465 reset in 93 ms.
Built C files in :
/tmp/ltsmin7739513829286123393
[2025-06-07 01:49:42] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2025-06-07 01:49:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 01:49:42] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2025-06-07 01:49:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 01:49:42] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2025-06-07 01:49:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 01:49:42] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7739513829286123393
Running compilation step : cd /tmp/ltsmin7739513829286123393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 72 ms.
Running link step : cd /tmp/ltsmin7739513829286123393;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin7739513829286123393;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12544037546254904239.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 4 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2025-06-07 01:49:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:57] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-07 01:49:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:49:58] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 01:49:58] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-07 01:49:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 131ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 132ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 8/8 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin16733959050709589390
[2025-06-07 01:49:58] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2025-06-07 01:49:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 01:49:58] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2025-06-07 01:49:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 01:49:58] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2025-06-07 01:49:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 01:49:58] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16733959050709589390
Running compilation step : cd /tmp/ltsmin16733959050709589390;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 85 ms.
Running link step : cd /tmp/ltsmin16733959050709589390;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16733959050709589390;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2043522734986814607.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 01:50:13] [INFO ] Flatten gal took : 2 ms
[2025-06-07 01:50:13] [INFO ] Flatten gal took : 1 ms
[2025-06-07 01:50:13] [INFO ] Time to serialize gal into /tmp/LTL3536882366011630402.gal : 0 ms
[2025-06-07 01:50:13] [INFO ] Time to serialize properties into /tmp/LTL6399594980969989908.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/LTL3536882366011630402.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12346544715298619113.hoa' '-atoms' '/tmp/LTL6399594980969989908.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/LTL6399594980969989908.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12346544715298619113.hoa
Detected timeout of ITS tools.
[2025-06-07 01:50:28] [INFO ] Flatten gal took : 3 ms
[2025-06-07 01:50:28] [INFO ] Flatten gal took : 1 ms
[2025-06-07 01:50:28] [INFO ] Time to serialize gal into /tmp/LTL16202462955050394196.gal : 0 ms
[2025-06-07 01:50:28] [INFO ] Time to serialize properties into /tmp/LTL10892375262691960353.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/LTL16202462955050394196.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10892375262691960353.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 : !((X(F(("(haveA2>=1)")||(((X("(resB<=haveA)"))&&(F("(haveA2>=1)")))U("((haveAandB>=2)||(haveAandB>=3))"))))))
Formula 0 simplified : XG(!"(haveA2>=1)" & ((X!"(resB<=haveA)" | G!"(haveA2>=1)") R !"((haveAandB>=2)||(haveAandB>=3))"))
Detected timeout of ITS tools.
[2025-06-07 01:50:43] [INFO ] Flatten gal took : 3 ms
[2025-06-07 01:50:43] [INFO ] Applying decomposition
[2025-06-07 01:50:43] [INFO ] Flatten gal took : 3 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/graph3626396719164590327.txt' '-o' '/tmp/graph3626396719164590327.bin' '-w' '/tmp/graph3626396719164590327.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3626396719164590327.bin' '-l' '-1' '-v' '-w' '/tmp/graph3626396719164590327.weights' '-q' '0' '-e' '0.001'
[2025-06-07 01:50:43] [INFO ] Decomposing Gal with order
[2025-06-07 01:50:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 01:50:43] [INFO ] Flatten gal took : 39 ms
[2025-06-07 01:50:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-07 01:50:43] [INFO ] Time to serialize gal into /tmp/LTL2039439500093029483.gal : 1 ms
[2025-06-07 01:50:43] [INFO ] Time to serialize properties into /tmp/LTL9513948944278613472.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/LTL2039439500093029483.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9513948944278613472.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F(("(gi1.gu1.haveA2>=1)")||(((X("(gu0.resB<=gu0.haveA)"))&&(F("(gi1.gu1.haveA2>=1)")))U("((gi1.gu2.haveAandB>=2)||(gi1.gu2.haveAa...170
Formula 0 simplified : XG(!"(gi1.gu1.haveA2>=1)" & ((X!"(gu0.resB<=gu0.haveA)" | G!"(gi1.gu1.haveA2>=1)") R !"((gi1.gu2.haveAandB>=2)||(gi1.gu2.haveAandB>=...161
Detected timeout of ITS tools.
Treatment of property TwoPhaseLocking-PT-nC10000vN-LTLCardinality-14 finished in 79293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U G(!p0)))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 2 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2025-06-07 01:50:58] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:50:58] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-07 01:50:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:50:58] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 01:50:58] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-07 01:50:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 14 constraints, problems are : Problem set: 0 solved, 4 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 117ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8 places, 5/6 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 139 ms :[p0, (AND (NOT p0) (NOT p1)), p0, true]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 88 ms.
Product exploration explored 100000 steps with 0 reset in 117 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 278 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, p0]
RANDOM walk for 20004 steps (0 resets) in 35 ms. (555 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 8 factoid took 293 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TwoPhaseLocking-PT-nC10000vN-LTLCardinality-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TwoPhaseLocking-PT-nC10000vN-LTLCardinality-15 finished in 1227 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(p1)&&F(p0)) U p2)))))'
Found a Shortening insensitive property : TwoPhaseLocking-PT-nC10000vN-LTLCardinality-14
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 8 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 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2025-06-07 01:51:00] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:51:00] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-07 01:51:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:51:00] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2025-06-07 01:51:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 166ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 166ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 223 ms. Remains : 8/8 places, 6/6 transitions.
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vN-LTLCardinality-14
Product exploration explored 100000 steps with 11531 reset in 73 ms.
Product exploration explored 100000 steps with 11500 reset in 81 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 93 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 201 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40012 steps (4 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 1785 steps (0 resets) in 8 ms. (198 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F p2)]
Knowledge based reduction with 7 factoid took 226 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 196 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2025-06-07 01:51:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 01:51:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-07 01:51:01] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-07 01:51:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 01:51:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-07 01:51:01] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-07 01:51:01] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-07 01:51:01] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 2 out of 8 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 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2025-06-07 01:51:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:51:01] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-07 01:51:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:51:01] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 01:51:01] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-07 01:51:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 216ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 216ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 284 ms. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 124 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 192 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40012 steps (4 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 1494 steps (0 resets) in 5 ms. (249 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F p2)]
Knowledge based reduction with 13 factoid took 343 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 217 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2025-06-07 01:51:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 01:51:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-07 01:51:03] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-07 01:51:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-07 01:51:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-07 01:51:03] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-07 01:51:03] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-07 01:51:03] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 11449 reset in 80 ms.
Product exploration explored 100000 steps with 11442 reset in 86 ms.
Built C files in :
/tmp/ltsmin3251960755136138658
[2025-06-07 01:51:03] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2025-06-07 01:51:03] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 01:51:03] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2025-06-07 01:51:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 01:51:03] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2025-06-07 01:51:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 01:51:03] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3251960755136138658
Running compilation step : cd /tmp/ltsmin3251960755136138658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin3251960755136138658;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3251960755136138658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10493317559274623684.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 3 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2025-06-07 01:51:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:51:18] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-07 01:51:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 01:51:18] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 01:51:18] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-07 01:51:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 125ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 191 ms. Remains : 8/8 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin6315876018021463837
[2025-06-07 01:51:18] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2025-06-07 01:51:18] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 01:51:18] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2025-06-07 01:51:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 01:51:18] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2025-06-07 01:51:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 01:51:18] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6315876018021463837
Running compilation step : cd /tmp/ltsmin6315876018021463837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 69 ms.
Running link step : cd /tmp/ltsmin6315876018021463837;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6315876018021463837;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1861241453696737523.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-07 01:51:34] [INFO ] Flatten gal took : 1 ms
[2025-06-07 01:51:34] [INFO ] Flatten gal took : 1 ms
[2025-06-07 01:51:34] [INFO ] Time to serialize gal into /tmp/LTL6977670090728684570.gal : 1 ms
[2025-06-07 01:51:34] [INFO ] Time to serialize properties into /tmp/LTL918533745058872050.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/LTL6977670090728684570.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17503264723879642640.hoa' '-atoms' '/tmp/LTL918533745058872050.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/LTL918533745058872050.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17503264723879642640.hoa
Detected timeout of ITS tools.
[2025-06-07 01:51:49] [INFO ] Flatten gal took : 1 ms
[2025-06-07 01:51:49] [INFO ] Flatten gal took : 0 ms
[2025-06-07 01:51:49] [INFO ] Time to serialize gal into /tmp/LTL74698137789168612.gal : 0 ms
[2025-06-07 01:51:49] [INFO ] Time to serialize properties into /tmp/LTL6462514115807357432.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/LTL74698137789168612.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6462514115807357432.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...273
Read 1 LTL properties
Checking formula 0 : !((X(F(("(haveA2>=1)")||(((X("(resB<=haveA)"))&&(F("(haveA2>=1)")))U("((haveAandB>=2)||(haveAandB>=3))"))))))
Formula 0 simplified : XG(!"(haveA2>=1)" & ((X!"(resB<=haveA)" | G!"(haveA2>=1)") R !"((haveAandB>=2)||(haveAandB>=3))"))
Detected timeout of ITS tools.
[2025-06-07 01:52:04] [INFO ] Flatten gal took : 1 ms
[2025-06-07 01:52:04] [INFO ] Applying decomposition
[2025-06-07 01:52:04] [INFO ] Flatten gal took : 0 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/graph18085334202749286401.txt' '-o' '/tmp/graph18085334202749286401.bin' '-w' '/tmp/graph18085334202749286401.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18085334202749286401.bin' '-l' '-1' '-v' '-w' '/tmp/graph18085334202749286401.weights' '-q' '0' '-e' '0.001'
[2025-06-07 01:52:04] [INFO ] Decomposing Gal with order
[2025-06-07 01:52:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 01:52:04] [INFO ] Flatten gal took : 2 ms
[2025-06-07 01:52:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-07 01:52:04] [INFO ] Time to serialize gal into /tmp/LTL14346242758660068902.gal : 0 ms
[2025-06-07 01:52:04] [INFO ] Time to serialize properties into /tmp/LTL6524640142822081759.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/LTL14346242758660068902.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6524640142822081759.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(("(gi1.gu1.haveA2>=1)")||(((X("(gu0.resB<=gu0.haveA)"))&&(F("(gi1.gu1.haveA2>=1)")))U("((gi1.gu2.haveAandB>=2)||(gi1.gu2.haveAa...170
Formula 0 simplified : XG(!"(gi1.gu1.haveA2>=1)" & ((X!"(gu0.resB<=gu0.haveA)" | G!"(gi1.gu1.haveA2>=1)") R !"((gi1.gu2.haveAandB>=2)||(gi1.gu2.haveAandB>=...161
Detected timeout of ITS tools.
Treatment of property TwoPhaseLocking-PT-nC10000vN-LTLCardinality-14 finished in 79353 ms.
[2025-06-07 01:52:19] [INFO ] Flatten gal took : 2 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17006578346603323573
[2025-06-07 01:52:19] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2025-06-07 01:52:19] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 01:52:19] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2025-06-07 01:52:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 01:52:19] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2025-06-07 01:52:19] [INFO ] Applying decomposition
[2025-06-07 01:52:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-07 01:52:19] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17006578346603323573
[2025-06-07 01:52:19] [INFO ] Flatten gal took : 1 ms
Running compilation step : cd /tmp/ltsmin17006578346603323573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph15153812134757434259.txt' '-o' '/tmp/graph15153812134757434259.bin' '-w' '/tmp/graph15153812134757434259.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15153812134757434259.bin' '-l' '-1' '-v' '-w' '/tmp/graph15153812134757434259.weights' '-q' '0' '-e' '0.001'
[2025-06-07 01:52:19] [INFO ] Decomposing Gal with order
[2025-06-07 01:52:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 01:52:19] [INFO ] Flatten gal took : 1 ms
[2025-06-07 01:52:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-07 01:52:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality15399207831359200696.gal : 0 ms
[2025-06-07 01:52:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality11457559870028768321.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/LTLCardinality15399207831359200696.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11457559870028768321.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((X(F(("(gi1.gu1.haveA2>=1)")||(((X("(gu0.resB<=gu0.haveA)"))&&(F("(gi1.gu1.haveA2>=1)")))U("((gi1.gu2.haveAandB>=2)||(gi1.gu2.haveAa...170
Formula 0 simplified : XG(!"(gi1.gu1.haveA2>=1)" & ((X!"(gu0.resB<=gu0.haveA)" | G!"(gi1.gu1.haveA2>=1)") R !"((gi1.gu2.haveAandB>=2)||(gi1.gu2.haveAandB>=...161
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin17006578346603323573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17006578346603323573;'/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(<>(((LTLAPp0==true)||((X((LTLAPp1==true))&&<>((LTLAPp0==true))) U (LTLAPp2==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: LTL layer: formula: X(<>(((LTLAPp0==true)||((X((LTLAPp1==true))&&<>((LTLAPp0==true))) U (LTLAPp2==true)))))
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: "X(<>(((LTLAPp0==true)||((X((LTLAPp1==true))&&<>((LTLAPp0==true))) U (LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.065: DFS-FIFO for weak LTL, using special progress label 10
pins2lts-mc-linux64( 0/ 8), 0.065: There are 11 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.065: State length is 9, there are 8 groups
pins2lts-mc-linux64( 0/ 8), 0.065: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.065: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.065: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.065: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.086: ~85 levels ~960 states ~2688 transitions
pins2lts-mc-linux64( 2/ 8), 0.103: ~169 levels ~1920 states ~5488 transitions
pins2lts-mc-linux64( 0/ 8), 0.144: ~348 levels ~3840 states ~11064 transitions
pins2lts-mc-linux64( 2/ 8), 0.227: ~668 levels ~7680 states ~21784 transitions
pins2lts-mc-linux64( 0/ 8), 0.360: ~1329 levels ~15360 states ~43384 transitions
pins2lts-mc-linux64( 0/ 8), 0.615: ~2685 levels ~30720 states ~87296 transitions
pins2lts-mc-linux64( 3/ 8), 0.958: ~5434 levels ~61440 states ~177648 transitions
pins2lts-mc-linux64( 2/ 8), 1.373: ~10773 levels ~122880 states ~352240 transitions
pins2lts-mc-linux64( 3/ 8), 1.712: ~20005 levels ~245760 states ~633832 transitions
pins2lts-mc-linux64( 3/ 8), 1.965: ~20005 levels ~491520 states ~1064032 transitions
pins2lts-mc-linux64( 3/ 8), 2.320: ~20005 levels ~983040 states ~1935656 transitions
pins2lts-mc-linux64( 3/ 8), 2.910: ~20005 levels ~1966080 states ~3685280 transitions
pins2lts-mc-linux64( 3/ 8), 4.165: ~20005 levels ~3932160 states ~7202496 transitions
pins2lts-mc-linux64( 7/ 8), 6.662: ~20005 levels ~7864320 states ~14196496 transitions
pins2lts-mc-linux64( 7/ 8), 11.946: ~20005 levels ~15728640 states ~28273304 transitions
pins2lts-mc-linux64( 7/ 8), 23.167: ~20005 levels ~31457280 states ~56457584 transitions
pins2lts-mc-linux64( 7/ 8), 48.290: ~20005 levels ~62914560 states ~118242488 transitions
pins2lts-mc-linux64( 5/ 8), 72.654: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 72.697:
pins2lts-mc-linux64( 0/ 8), 72.697: mean standard work distribution: 8.9% (states) 3.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 72.698:
pins2lts-mc-linux64( 0/ 8), 72.698: Explored 69754211 states 161130039 transitions, fanout: 2.310
pins2lts-mc-linux64( 0/ 8), 72.698: Total exploration time 72.620 sec (72.590 sec minimum, 72.606 sec on average)
pins2lts-mc-linux64( 0/ 8), 72.698: States per second: 960537, Transitions per second: 2218810
pins2lts-mc-linux64( 0/ 8), 72.698:
pins2lts-mc-linux64( 0/ 8), 72.698: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 72.698: Redundant explorations: 28.6528
pins2lts-mc-linux64( 0/ 8), 72.698:
pins2lts-mc-linux64( 0/ 8), 72.698: Queue width: 8B, total height: 160040, memory: 1.22MB
pins2lts-mc-linux64( 0/ 8), 72.698: Tree memory: 669.7MB, 13.0 B/state, compr.: 34.1%
pins2lts-mc-linux64( 0/ 8), 72.698: Tree fill ratio (roots/leafs): 40.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 72.698: Stored 6 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 72.698: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 72.698: Est. total memory use: 670.9MB (~1025.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17006578346603323573;'/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(<>(((LTLAPp0==true)||((X((LTLAPp1==true))&&<>((LTLAPp0==true))) U (LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17006578346603323573;'/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(<>(((LTLAPp0==true)||((X((LTLAPp1==true))&&<>((LTLAPp0==true))) U (LTLAPp2==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-07 02:13:24] [INFO ] Flatten gal took : 3 ms
[2025-06-07 02:13:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality10161447095359022524.gal : 1 ms
[2025-06-07 02:13:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality3731138451609879955.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/LTLCardinality10161447095359022524.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3731138451609879955.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...298
Read 1 LTL properties
Checking formula 0 : !((X(F(("(haveA2>=1)")||(((X("(resB<=haveA)"))&&(F("(haveA2>=1)")))U("((haveAandB>=2)||(haveAandB>=3))"))))))
Formula 0 simplified : XG(!"(haveA2>=1)" & ((X!"(resB<=haveA)" | G!"(haveA2>=1)") R !"((haveAandB>=2)||(haveAandB>=3))"))
Detected timeout of ITS tools.
[2025-06-07 02:34:29] [INFO ] Flatten gal took : 1 ms
[2025-06-07 02:34:29] [INFO ] Input system was already deterministic with 6 transitions.
[2025-06-07 02:34:29] [INFO ] Transformed 8 places.
[2025-06-07 02:34:29] [INFO ] Transformed 6 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-07 02:34:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality18423297951211377488.gal : 0 ms
[2025-06-07 02:34:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality10149285310517252201.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/LTLCardinality18423297951211377488.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10149285310517252201.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(("(haveA2>=1)")||(((X("(resB<=haveA)"))&&(F("(haveA2>=1)")))U("((haveAandB>=2)||(haveAandB>=3))"))))))
Formula 0 simplified : XG(!"(haveA2>=1)" & ((X!"(resB<=haveA)" | G!"(haveA2>=1)") R !"((haveAandB>=2)||(haveAandB>=3))"))

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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