Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102500444.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 FlexibleBarrier-PT-08b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102500444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 241K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748928104763

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 05:21:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 05:21:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 05:21:48] [INFO ] Load time of PNML (sax parser for PT used): 257 ms
[2025-06-03 05:21:48] [INFO ] Transformed 920 places.
[2025-06-03 05:21:48] [INFO ] Transformed 1057 transitions.
[2025-06-03 05:21:48] [INFO ] Found NUPN structural information;
[2025-06-03 05:21:48] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 503 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Discarding 330 places :
Symmetric choice reduction at 0 with 330 rule applications. Total rules 330 place count 590 transition count 727
Iterating global reduction 0 with 330 rules applied. Total rules applied 660 place count 590 transition count 727
Discarding 146 places :
Symmetric choice reduction at 0 with 146 rule applications. Total rules 806 place count 444 transition count 581
Iterating global reduction 0 with 146 rules applied. Total rules applied 952 place count 444 transition count 581
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 1034 place count 362 transition count 499
Iterating global reduction 0 with 82 rules applied. Total rules applied 1116 place count 362 transition count 499
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 1151 place count 362 transition count 464
Applied a total of 1151 rules in 228 ms. Remains 362 /920 variables (removed 558) and now considering 464/1057 (removed 593) transitions.
// Phase 1: matrix 464 rows 362 cols
[2025-06-03 05:21:48] [INFO ] Computed 10 invariants in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:21:49] [INFO ] Implicit Places using invariants in 690 ms returned []
[2025-06-03 05:21:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:21:50] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1657 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2025-06-03 05:21:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/362 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:22:08] [INFO ] Deduced a trap composed of 91 places in 334 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:22:11] [INFO ] Deduced a trap composed of 92 places in 244 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:22:15] [INFO ] Deduced a trap composed of 89 places in 353 ms of which 30 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/826 variables, and 13 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/362 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/362 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 4 (OVERLAPS) 464/826 variables, 362/375 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/826 variables, 463/838 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:22:42] [INFO ] Deduced a trap composed of 77 places in 379 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:22:43] [INFO ] Deduced a trap composed of 218 places in 256 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:22:43] [INFO ] Deduced a trap composed of 217 places in 303 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:22:47] [INFO ] Deduced a trap composed of 81 places in 304 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:22:47] [INFO ] Deduced a trap composed of 85 places in 235 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:22:48] [INFO ] Deduced a trap composed of 82 places in 191 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:22:49] [INFO ] Deduced a trap composed of 99 places in 263 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:22:50] [INFO ] Deduced a trap composed of 85 places in 293 ms of which 38 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 826/826 variables, and 846 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60516ms problems are : Problem set: 0 solved, 463 unsolved
Search for dead transitions found 0 dead transitions in 60546ms
Starting structural reductions in LTL mode, iteration 1 : 362/920 places, 464/1057 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62466 ms. Remains : 362/920 places, 464/1057 transitions.
Support contains 40 out of 362 places after structural reductions.
[2025-06-03 05:22:51] [INFO ] Flatten gal took : 88 ms
[2025-06-03 05:22:51] [INFO ] Flatten gal took : 42 ms
[2025-06-03 05:22:51] [INFO ] Input system was already deterministic with 464 transitions.
Support contains 39 out of 362 places (down from 40) after GAL structural reductions.
RANDOM walk for 40000 steps (620 resets) in 3097 ms. (12 steps per ms) remains 11/29 properties
BEST_FIRST walk for 40004 steps (74 resets) in 255 ms. (156 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (79 resets) in 191 ms. (208 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (81 resets) in 170 ms. (233 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (79 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (82 resets) in 88 ms. (449 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (81 resets) in 134 ms. (296 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (78 resets) in 69 ms. (571 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (77 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
[2025-06-03 05:22:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 208/217 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:22:53] [INFO ] Deduced a trap composed of 90 places in 196 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 145/362 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:22:53] [INFO ] Deduced a trap composed of 89 places in 268 ms of which 44 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 464/826 variables, 362/374 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/826 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/826 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 826/826 variables, and 374 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2316 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 208/217 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 145/362 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:22:55] [INFO ] Deduced a trap composed of 85 places in 149 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 464/826 variables, 362/375 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/826 variables, 6/381 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/826 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/826 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 826/826 variables, and 381 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1721 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4050ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 4 properties in 1061 ms.
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 464/464 transitions.
Graph (trivial) has 331 edges and 362 vertex of which 49 / 362 are part of one of the 8 SCC in 3 ms
Free SCC test removed 41 places
Drop transitions (Empty/Sink Transition effects.) removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 321 transition count 375
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 282 transition count 375
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 79 place count 282 transition count 357
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 115 place count 264 transition count 357
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 144 place count 235 transition count 328
Iterating global reduction 2 with 29 rules applied. Total rules applied 173 place count 235 transition count 328
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 177 place count 235 transition count 324
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 183 place count 229 transition count 318
Iterating global reduction 3 with 6 rules applied. Total rules applied 189 place count 229 transition count 318
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 194 place count 229 transition count 313
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 302 place count 175 transition count 259
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 318 place count 175 transition count 243
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 329 place count 164 transition count 232
Iterating global reduction 5 with 11 rules applied. Total rules applied 340 place count 164 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 343 place count 164 transition count 229
Free-agglomeration rule applied 116 times.
Iterating global reduction 6 with 116 rules applied. Total rules applied 459 place count 164 transition count 113
Reduce places removed 116 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 128 edges and 48 vertex of which 28 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 165 rules applied. Total rules applied 624 place count 28 transition count 65
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 652 place count 28 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 653 place count 27 transition count 36
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 20 edges and 26 vertex of which 8 / 26 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 655 place count 22 transition count 36
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 663 place count 22 transition count 28
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 663 place count 22 transition count 24
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 671 place count 18 transition count 24
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 675 place count 18 transition count 20
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 683 place count 14 transition count 16
Free-agglomeration rule applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 687 place count 14 transition count 12
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 698 place count 7 transition count 8
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 699 place count 7 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 700 place count 6 transition count 7
Applied a total of 700 rules in 128 ms. Remains 6 /362 variables (removed 356) and now considering 7/464 (removed 457) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 6/362 places, 7/464 transitions.
RANDOM walk for 24 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/2 properties
Computed a total of 10 stabilizing places and 10 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(F(p0))&&(F(G(p1)) U p2))))))'
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 464/464 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 346 transition count 448
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 346 transition count 448
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 346 transition count 445
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 46 place count 335 transition count 434
Iterating global reduction 1 with 11 rules applied. Total rules applied 57 place count 335 transition count 434
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 65 place count 335 transition count 426
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 332 transition count 423
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 332 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 332 transition count 422
Applied a total of 72 rules in 80 ms. Remains 332 /362 variables (removed 30) and now considering 422/464 (removed 42) transitions.
// Phase 1: matrix 422 rows 332 cols
[2025-06-03 05:22:58] [INFO ] Computed 10 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:22:59] [INFO ] Implicit Places using invariants in 398 ms returned []
[2025-06-03 05:22:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:22:59] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 1037 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2025-06-03 05:22:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 422/754 variables, 332/342 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 754/754 variables, and 342 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 332/332 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 422/754 variables, 332/342 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/754 variables, 421/763 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:23:50] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:23:52] [INFO ] Deduced a trap composed of 73 places in 318 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:23:53] [INFO ] Deduced a trap composed of 76 places in 301 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:23:54] [INFO ] Deduced a trap composed of 77 places in 300 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:23:55] [INFO ] Deduced a trap composed of 82 places in 313 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:23:55] [INFO ] Deduced a trap composed of 81 places in 262 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:23:56] [INFO ] Deduced a trap composed of 78 places in 288 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:23:57] [INFO ] Deduced a trap composed of 80 places in 228 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:23:58] [INFO ] Deduced a trap composed of 81 places in 190 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:24:00] [INFO ] Deduced a trap composed of 81 places in 199 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 754/754 variables, and 773 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 332/332 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60239ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 60244ms
Starting structural reductions in LTL mode, iteration 1 : 332/362 places, 422/464 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61365 ms. Remains : 332/362 places, 422/464 transitions.
Stuttering acceptance computed with spot in 698 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-00
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 4 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-00 finished in 62191 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) U (p1 U (G((p1||X(G(p2))))||(!p2&&(p1||X(G(p2)))))))))'
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 464/464 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 347 transition count 449
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 347 transition count 449
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 347 transition count 446
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 43 place count 337 transition count 436
Iterating global reduction 1 with 10 rules applied. Total rules applied 53 place count 337 transition count 436
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 61 place count 337 transition count 428
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 335 transition count 426
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 335 transition count 426
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 335 transition count 425
Applied a total of 66 rules in 63 ms. Remains 335 /362 variables (removed 27) and now considering 425/464 (removed 39) transitions.
// Phase 1: matrix 425 rows 335 cols
[2025-06-03 05:24:00] [INFO ] Computed 10 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:24:01] [INFO ] Implicit Places using invariants in 274 ms returned []
[2025-06-03 05:24:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:24:01] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2025-06-03 05:24: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/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 425/760 variables, 335/345 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 760/760 variables, and 345 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (OVERLAPS) 425/760 variables, 335/345 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/760 variables, 424/769 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:24:53] [INFO ] Deduced a trap composed of 30 places in 355 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:24:54] [INFO ] Deduced a trap composed of 74 places in 314 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:24:55] [INFO ] Deduced a trap composed of 77 places in 321 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:24:57] [INFO ] Deduced a trap composed of 77 places in 295 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:24:58] [INFO ] Deduced a trap composed of 78 places in 272 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:24:59] [INFO ] Deduced a trap composed of 79 places in 260 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:25:00] [INFO ] Deduced a trap composed of 80 places in 297 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:25:01] [INFO ] Deduced a trap composed of 81 places in 288 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:25:02] [INFO ] Deduced a trap composed of 81 places in 244 ms of which 18 ms to minimize.
SMT process timed out in 60358ms, After SMT, problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 60361ms
Starting structural reductions in LTL mode, iteration 1 : 335/362 places, 425/464 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61214 ms. Remains : 335/362 places, 425/464 transitions.
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 467 ms.
Product exploration explored 100000 steps with 50000 reset in 316 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X p1), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 25 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-08b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-01 finished in 62390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||X(p1)))||G(p2)))'
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 464/464 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 344 transition count 446
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 344 transition count 446
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 344 transition count 442
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 52 place count 332 transition count 430
Iterating global reduction 1 with 12 rules applied. Total rules applied 64 place count 332 transition count 430
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 73 place count 332 transition count 421
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 76 place count 329 transition count 418
Iterating global reduction 2 with 3 rules applied. Total rules applied 79 place count 329 transition count 418
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 329 transition count 417
Applied a total of 80 rules in 32 ms. Remains 329 /362 variables (removed 33) and now considering 417/464 (removed 47) transitions.
// Phase 1: matrix 417 rows 329 cols
[2025-06-03 05:25:03] [INFO ] Computed 10 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:25:03] [INFO ] Implicit Places using invariants in 244 ms returned []
[2025-06-03 05:25:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:25:03] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2025-06-03 05:25: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/328 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 1/329 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (OVERLAPS) 417/746 variables, 329/339 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 746/746 variables, and 339 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 1/329 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (OVERLAPS) 417/746 variables, 329/339 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/746 variables, 416/755 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:25:53] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:25:54] [INFO ] Deduced a trap composed of 30 places in 339 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:25:55] [INFO ] Deduced a trap composed of 73 places in 317 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:25:56] [INFO ] Deduced a trap composed of 76 places in 296 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:25:57] [INFO ] Deduced a trap composed of 77 places in 273 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:25:58] [INFO ] Deduced a trap composed of 79 places in 242 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:25:59] [INFO ] Deduced a trap composed of 32 places in 311 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:25:59] [INFO ] Deduced a trap composed of 78 places in 276 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:26:00] [INFO ] Deduced a trap composed of 80 places in 244 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:26:01] [INFO ] Deduced a trap composed of 81 places in 225 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:26:01] [INFO ] Deduced a trap composed of 34 places in 288 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:26:02] [INFO ] Deduced a trap composed of 82 places in 266 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:26:02] [INFO ] Deduced a trap composed of 81 places in 223 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 746/746 variables, and 768 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Starting structural reductions in LTL mode, iteration 1 : 329/362 places, 417/464 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60766 ms. Remains : 329/362 places, 417/464 transitions.
Stuttering acceptance computed with spot in 542 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1780 steps with 26 reset in 11 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-04 finished in 61346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 464/464 transitions.
Graph (trivial) has 335 edges and 362 vertex of which 49 / 362 are part of one of the 8 SCC in 2 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 320 transition count 379
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 278 transition count 379
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 85 place count 278 transition count 360
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 123 place count 259 transition count 360
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 154 place count 228 transition count 329
Iterating global reduction 2 with 31 rules applied. Total rules applied 185 place count 228 transition count 329
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 189 place count 228 transition count 325
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 189 place count 228 transition count 324
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 191 place count 227 transition count 324
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 198 place count 220 transition count 317
Iterating global reduction 3 with 7 rules applied. Total rules applied 205 place count 220 transition count 317
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 212 place count 220 transition count 310
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 312 place count 170 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 314 place count 168 transition count 258
Iterating global reduction 4 with 2 rules applied. Total rules applied 316 place count 168 transition count 258
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 318 place count 168 transition count 256
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 326 place count 168 transition count 248
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 328 place count 166 transition count 246
Applied a total of 328 rules in 209 ms. Remains 166 /362 variables (removed 196) and now considering 246/464 (removed 218) transitions.
[2025-06-03 05:26:04] [INFO ] Flow matrix only has 231 transitions (discarded 15 similar events)
// Phase 1: matrix 231 rows 166 cols
[2025-06-03 05:26:04] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:26:04] [INFO ] Implicit Places using invariants in 254 ms returned []
[2025-06-03 05:26:05] [INFO ] Flow matrix only has 231 transitions (discarded 15 similar events)
[2025-06-03 05:26:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:26:05] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 05:26:05] [INFO ] Redundant transitions in 23 ms returned []
Running 123 sub problems to find dead transitions.
[2025-06-03 05:26:05] [INFO ] Flow matrix only has 231 transitions (discarded 15 similar events)
[2025-06-03 05:26:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 8/166 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 230/396 variables, 166/176 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/397 variables, and 176 constraints, problems are : Problem set: 0 solved, 123 unsolved in 11584 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 8/166 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 230/396 variables, 166/176 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 123/299 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/396 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/397 variables, and 299 constraints, problems are : Problem set: 0 solved, 123 unsolved in 11613 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23259ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 23260ms
Starting structural reductions in SI_LTL mode, iteration 1 : 166/362 places, 246/464 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24197 ms. Remains : 166/362 places, 246/464 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-05 finished in 24278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&X((!p0 U (p1||G(!p0))))) U (G((!p0&&X((!p0 U (p1||G(!p0))))))||(X((!p0 U (p1||G(!p0))))&&p2))))'
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 464/464 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 347 transition count 449
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 347 transition count 449
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 347 transition count 445
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 43 place count 338 transition count 436
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 338 transition count 436
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 60 place count 338 transition count 428
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 337 transition count 427
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 337 transition count 427
Applied a total of 62 rules in 65 ms. Remains 337 /362 variables (removed 25) and now considering 427/464 (removed 37) transitions.
// Phase 1: matrix 427 rows 337 cols
[2025-06-03 05:26:28] [INFO ] Computed 10 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:26:29] [INFO ] Implicit Places using invariants in 344 ms returned []
[2025-06-03 05:26:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:26:29] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2025-06-03 05:26: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/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (OVERLAPS) 427/764 variables, 337/347 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 764/764 variables, and 347 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (OVERLAPS) 427/764 variables, 337/347 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/764 variables, 426/773 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:27:20] [INFO ] Deduced a trap composed of 75 places in 329 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:27:21] [INFO ] Deduced a trap composed of 79 places in 312 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:27:21] [INFO ] Deduced a trap composed of 27 places in 318 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:27:22] [INFO ] Deduced a trap composed of 74 places in 309 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:27:23] [INFO ] Deduced a trap composed of 76 places in 304 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:27:24] [INFO ] Deduced a trap composed of 77 places in 162 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:27:24] [INFO ] Deduced a trap composed of 78 places in 282 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:27:25] [INFO ] Deduced a trap composed of 79 places in 261 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:27:26] [INFO ] Deduced a trap composed of 81 places in 231 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:27:27] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:27:27] [INFO ] Deduced a trap composed of 81 places in 229 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:27:28] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 10 ms to minimize.
(s205 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 764/764 variables, and 785 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Starting structural reductions in LTL mode, iteration 1 : 337/362 places, 427/464 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61006 ms. Remains : 337/362 places, 427/464 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), true, (AND p0 (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-06
Product exploration explored 100000 steps with 1519 reset in 384 ms.
Product exploration explored 100000 steps with 1525 reset in 486 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (OR p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 135 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (610 resets) in 412 ms. (96 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (80 resets) in 176 ms. (226 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (82 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (79 resets) in 379 ms. (105 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (77 resets) in 253 ms. (157 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (83 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (78 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 380683 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 6
Probabilistic random walk after 380683 steps, saw 95066 distinct states, run finished after 3012 ms. (steps per millisecond=126 ) properties seen :0
[2025-06-03 05:27:34] [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, 6 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 98/101 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 236/337 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 427/764 variables, 337/347 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 0/347 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/764 variables, 0/347 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 347 constraints, problems are : Problem set: 1 solved, 5 unsolved in 789 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 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: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 236/337 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:27:35] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:27:35] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 427/764 variables, 337/349 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 5/354 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/764 variables, 0/354 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/764 variables, 0/354 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 354 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1207 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2008ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 277 steps, including 3 resets, run visited all 2 properties in 5 ms. (steps per millisecond=55 )
Parikh walk visited 5 properties in 124 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (OR p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 18 factoid took 412 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 119 ms :[true, p0, p0]
Support contains 3 out of 337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 337/337 places, 427/427 transitions.
Graph (trivial) has 306 edges and 337 vertex of which 49 / 337 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 295 transition count 348
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 259 transition count 348
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 73 place count 259 transition count 330
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 109 place count 241 transition count 330
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 124 place count 226 transition count 315
Iterating global reduction 2 with 15 rules applied. Total rules applied 139 place count 226 transition count 315
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 140 place count 225 transition count 314
Iterating global reduction 2 with 1 rules applied. Total rules applied 141 place count 225 transition count 314
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 245 place count 173 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 253 place count 173 transition count 254
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 255 place count 171 transition count 252
Applied a total of 255 rules in 102 ms. Remains 171 /337 variables (removed 166) and now considering 252/427 (removed 175) transitions.
[2025-06-03 05:27:37] [INFO ] Flow matrix only has 237 transitions (discarded 15 similar events)
// Phase 1: matrix 237 rows 171 cols
[2025-06-03 05:27:37] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:27:37] [INFO ] Implicit Places using invariants in 238 ms returned []
[2025-06-03 05:27:37] [INFO ] Flow matrix only has 237 transitions (discarded 15 similar events)
[2025-06-03 05:27:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:27:38] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 05:27:38] [INFO ] Redundant transitions in 3 ms returned []
Running 128 sub problems to find dead transitions.
[2025-06-03 05:27:38] [INFO ] Flow matrix only has 237 transitions (discarded 15 similar events)
[2025-06-03 05:27:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 8/171 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:27:40] [INFO ] Deduced a trap composed of 62 places in 147 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 236/407 variables, 171/182 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/407 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/408 variables, and 182 constraints, problems are : Problem set: 0 solved, 128 unsolved in 13179 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 8/171 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 236/407 variables, 171/182 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 128/310 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/407 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/408 variables, and 310 constraints, problems are : Problem set: 0 solved, 128 unsolved in 11977 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25192ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 25192ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/337 places, 252/427 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25907 ms. Remains : 171/337 places, 252/427 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 115 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 91 ms :[true, p0, p0]
RANDOM walk for 40000 steps (2843 resets) in 1050 ms. (38 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (76 resets) in 33 ms. (1176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (77 resets) in 29 ms. (1333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (76 resets) in 29 ms. (1333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (78 resets) in 25 ms. (1538 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 626842 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :0 out of 4
Probabilistic random walk after 626842 steps, saw 150313 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
[2025-06-03 05:28:06] [INFO ] Flow matrix only has 237 transitions (discarded 15 similar events)
[2025-06-03 05:28:06] [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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 121/190 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 147/337 variables, 60/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 42/379 variables, 7/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 14/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 28/407 variables, 28/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/407 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/408 variables, and 181 constraints, problems are : Problem set: 0 solved, 4 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 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 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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 121/190 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 147/337 variables, 60/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 42/379 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 14/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 28/407 variables, 28/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/407 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/408 variables, and 185 constraints, problems are : Problem set: 0 solved, 4 unsolved in 732 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1364ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 87 steps, including 9 resets, run visited all 1 properties in 1 ms. (steps per millisecond=87 )
Parikh walk visited 4 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 301 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 :[true, p0, p0]
Stuttering acceptance computed with spot in 102 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 116 ms :[true, p0, p0]
Product exploration explored 100000 steps with 6857 reset in 1003 ms.
Product exploration explored 100000 steps with 6800 reset in 363 ms.
Built C files in :
/tmp/ltsmin14695255108196911973
[2025-06-03 05:28:10] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2025-06-03 05:28:10] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 05:28:10] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2025-06-03 05:28:10] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 05:28:10] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2025-06-03 05:28:10] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 05:28:10] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14695255108196911973
Running compilation step : cd /tmp/ltsmin14695255108196911973;'/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 1411 ms.
Running link step : cd /tmp/ltsmin14695255108196911973;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin14695255108196911973;'/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/stateBased15089199948221254173.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 252/252 transitions.
Applied a total of 0 rules in 15 ms. Remains 171 /171 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2025-06-03 05:28:25] [INFO ] Flow matrix only has 237 transitions (discarded 15 similar events)
[2025-06-03 05:28:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:28:25] [INFO ] Implicit Places using invariants in 278 ms returned []
[2025-06-03 05:28:25] [INFO ] Flow matrix only has 237 transitions (discarded 15 similar events)
[2025-06-03 05:28:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:28:26] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 05:28:26] [INFO ] Redundant transitions in 5 ms returned []
Running 128 sub problems to find dead transitions.
[2025-06-03 05:28:26] [INFO ] Flow matrix only has 237 transitions (discarded 15 similar events)
[2025-06-03 05:28:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 8/171 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:28:28] [INFO ] Deduced a trap composed of 62 places in 140 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 236/407 variables, 171/182 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/407 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/408 variables, and 182 constraints, problems are : Problem set: 0 solved, 128 unsolved in 12852 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 8/171 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 236/407 variables, 171/182 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 128/310 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/407 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/408 variables, and 310 constraints, problems are : Problem set: 0 solved, 128 unsolved in 10986 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23881ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 23882ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24568 ms. Remains : 171/171 places, 252/252 transitions.
Built C files in :
/tmp/ltsmin18148618388552150563
[2025-06-03 05:28:50] [INFO ] Computing symmetric may disable matrix : 252 transitions.
[2025-06-03 05:28:50] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 05:28:50] [INFO ] Computing symmetric may enable matrix : 252 transitions.
[2025-06-03 05:28:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 05:28:50] [INFO ] Computing Do-Not-Accords matrix : 252 transitions.
[2025-06-03 05:28:50] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 05:28:50] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18148618388552150563
Running compilation step : cd /tmp/ltsmin18148618388552150563;'/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 902 ms.
Running link step : cd /tmp/ltsmin18148618388552150563;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin18148618388552150563;'/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/stateBased15343224873387243566.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 05:29:05] [INFO ] Flatten gal took : 17 ms
[2025-06-03 05:29:05] [INFO ] Flatten gal took : 16 ms
[2025-06-03 05:29:05] [INFO ] Time to serialize gal into /tmp/LTL9092322401660333572.gal : 5 ms
[2025-06-03 05:29:05] [INFO ] Time to serialize properties into /tmp/LTL9396123671560072037.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9092322401660333572.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15048235233999854846.hoa' '-atoms' '/tmp/LTL9396123671560072037.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/LTL9396123671560072037.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15048235233999854846.hoa
Detected timeout of ITS tools.
[2025-06-03 05:29:20] [INFO ] Flatten gal took : 17 ms
[2025-06-03 05:29:20] [INFO ] Flatten gal took : 17 ms
[2025-06-03 05:29:20] [INFO ] Time to serialize gal into /tmp/LTL9984656486813160629.gal : 4 ms
[2025-06-03 05:29:20] [INFO ] Time to serialize properties into /tmp/LTL12369274279868331966.ltl : 4 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/LTL9984656486813160629.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12369274279868331966.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 : !((((!("((p14==1)&&(p693==1))"))&&(X((!("((p14==1)&&(p693==1))"))U(("(p87==1)")||(G(!("((p14==1)&&(p693==1))")))))))U((G((!("((p14==1)...401
Formula 0 simplified : ("((p14==1)&&(p693==1))" | X("((p14==1)&&(p693==1))" M !"(p87==1)")) M (!"((!((p87==1)&&(p693==1)))&&(!((p14==1)&&(p693==1))))" | X(...194
Detected timeout of ITS tools.
[2025-06-03 05:29:35] [INFO ] Flatten gal took : 15 ms
[2025-06-03 05:29:35] [INFO ] Applying decomposition
[2025-06-03 05:29:35] [INFO ] Flatten gal took : 15 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/graph9749903383669947851.txt' '-o' '/tmp/graph9749903383669947851.bin' '-w' '/tmp/graph9749903383669947851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9749903383669947851.bin' '-l' '-1' '-v' '-w' '/tmp/graph9749903383669947851.weights' '-q' '0' '-e' '0.001'
[2025-06-03 05:29:35] [INFO ] Decomposing Gal with order
[2025-06-03 05:29:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 05:29:35] [INFO ] Removed a total of 114 redundant transitions.
[2025-06-03 05:29:35] [INFO ] Flatten gal took : 85 ms
[2025-06-03 05:29:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 14 ms.
[2025-06-03 05:29:35] [INFO ] Time to serialize gal into /tmp/LTL9309090381543735509.gal : 6 ms
[2025-06-03 05:29:35] [INFO ] Time to serialize properties into /tmp/LTL15440663744254979247.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/LTL9309090381543735509.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15440663744254979247.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((!("((i0.u0.p14==1)&&(i7.u25.p693==1))"))&&(X((!("((i0.u0.p14==1)&&(i7.u25.p693==1))"))U(("(i0.u3.p87==1)")||(G(!("((i0.u0.p14==1)...549
Formula 0 simplified : ("((i0.u0.p14==1)&&(i7.u25.p693==1))" | X("((i0.u0.p14==1)&&(i7.u25.p693==1))" M !"(i0.u3.p87==1)")) M (!"((!((i0.u3.p87==1)&&(i7.u2...271
Reverse transition relation is NOT exact ! Due to transitions t5_t372_t282_t269, t5_t374_t249_t235, i7.t57, Intersection with reachable at each step enabl...207
Computing Next relation with stutter on 2.45541e+10 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
317 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.22335,105988,1,0,80904,161515,3248,242588,1726,560559,31608
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-06 finished in 190745 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 X((p1||X((p1&&G(p2)))))))'
Support contains 4 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 464/464 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 345 transition count 447
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 345 transition count 447
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 345 transition count 443
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 49 place count 334 transition count 432
Iterating global reduction 1 with 11 rules applied. Total rules applied 60 place count 334 transition count 432
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 68 place count 334 transition count 424
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 71 place count 331 transition count 421
Iterating global reduction 2 with 3 rules applied. Total rules applied 74 place count 331 transition count 421
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 331 transition count 420
Applied a total of 75 rules in 30 ms. Remains 331 /362 variables (removed 31) and now considering 420/464 (removed 44) transitions.
// Phase 1: matrix 420 rows 331 cols
[2025-06-03 05:29:39] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:29:39] [INFO ] Implicit Places using invariants in 248 ms returned []
[2025-06-03 05:29:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:29:40] [INFO ] Implicit Places using invariants and state equation in 723 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2025-06-03 05:29:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/331 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 420/751 variables, 331/341 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 751/751 variables, and 341 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 331/331 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/331 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 420/751 variables, 331/341 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/751 variables, 419/760 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:30:30] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:30:31] [INFO ] Deduced a trap composed of 30 places in 302 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:30:31] [INFO ] Deduced a trap composed of 75 places in 278 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:30:32] [INFO ] Deduced a trap composed of 76 places in 306 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:30:33] [INFO ] Deduced a trap composed of 77 places in 172 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:30:34] [INFO ] Deduced a trap composed of 78 places in 286 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:30:35] [INFO ] Deduced a trap composed of 79 places in 250 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:30:36] [INFO ] Deduced a trap composed of 80 places in 244 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:30:37] [INFO ] Deduced a trap composed of 81 places in 209 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:30:38] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:30:38] [INFO ] Deduced a trap composed of 81 places in 206 ms of which 14 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 751/751 variables, and 771 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 331/331 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 331/362 places, 420/464 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61154 ms. Remains : 331/362 places, 420/464 transitions.
Stuttering acceptance computed with spot in 347 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-07
Stuttering criterion allowed to conclude after 86934 steps with 2648 reset in 216 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-07 finished in 61743 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)&&F((G(F((X(!p1)&&(!p1 U (p2||G(!p1))))))||((p3 U (p4||G(p3)))&&F((X(!p1)&&(!p1 U (p2||G(!p1))))))))))'
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 464/464 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 345 transition count 447
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 345 transition count 447
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 345 transition count 443
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 49 place count 334 transition count 432
Iterating global reduction 1 with 11 rules applied. Total rules applied 60 place count 334 transition count 432
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 68 place count 334 transition count 424
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 71 place count 331 transition count 421
Iterating global reduction 2 with 3 rules applied. Total rules applied 74 place count 331 transition count 421
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 331 transition count 420
Applied a total of 75 rules in 32 ms. Remains 331 /362 variables (removed 31) and now considering 420/464 (removed 44) transitions.
// Phase 1: matrix 420 rows 331 cols
[2025-06-03 05:30:41] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:30:41] [INFO ] Implicit Places using invariants in 294 ms returned []
[2025-06-03 05:30:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:30:42] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2025-06-03 05:30:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/331 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:30:56] [INFO ] Deduced a trap composed of 81 places in 342 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:30:58] [INFO ] Deduced a trap composed of 83 places in 194 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 419 unsolved
SMT process timed out in 30113ms, After SMT, problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 30118ms
Starting structural reductions in LTL mode, iteration 1 : 331/362 places, 420/464 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31063 ms. Remains : 331/362 places, 420/464 transitions.
Stuttering acceptance computed with spot in 486 ms :[(OR (NOT p0) p1), (NOT p0), p1, p1, (AND (NOT p2) p1), (AND p1 (NOT p3) (NOT p4)), p1]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 294 ms.
Product exploration explored 100000 steps with 50000 reset in 315 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p4 p3 p2 (NOT p1)), (X p2), (X (NOT (OR (AND (NOT p2) (NOT p1) p4) (AND (NOT p2) (NOT p1) p3)))), (X p3), (X p4), (X (OR p2 (NOT p1))), (X (NOT (AND (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p4) p3))), (X p0), (X (NOT (AND p2 p1))), (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND (NOT p1) (NOT p4) (NOT p3))))), (X (NOT p1)), (X (X p2)), (X (X (NOT (OR (AND (NOT p2) (NOT p1) p4) (AND (NOT p2) (NOT p1) p3))))), (X (X p3)), (X (X p4)), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p4) p3)))), (X (X p0)), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND p2 (NOT p4) (NOT p3)) (AND (NOT p1) (NOT p4) (NOT p3)))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 29 factoid took 28 ms. Reduced automaton from 7 states, 23 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-08b-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-08 finished in 32279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 464/464 transitions.
Graph (trivial) has 274 edges and 362 vertex of which 43 / 362 are part of one of the 7 SCC in 1 ms
Free SCC test removed 36 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 325 transition count 386
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 285 transition count 386
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 81 place count 285 transition count 364
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 125 place count 263 transition count 364
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 155 place count 233 transition count 334
Iterating global reduction 2 with 30 rules applied. Total rules applied 185 place count 233 transition count 334
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 189 place count 233 transition count 330
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 196 place count 226 transition count 323
Iterating global reduction 3 with 7 rules applied. Total rules applied 203 place count 226 transition count 323
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 210 place count 226 transition count 316
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 316 place count 173 transition count 263
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 319 place count 170 transition count 260
Iterating global reduction 4 with 3 rules applied. Total rules applied 322 place count 170 transition count 260
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 325 place count 170 transition count 257
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 329 place count 168 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 330 place count 167 transition count 265
Applied a total of 330 rules in 93 ms. Remains 167 /362 variables (removed 195) and now considering 265/464 (removed 199) transitions.
[2025-06-03 05:31:13] [INFO ] Flow matrix only has 245 transitions (discarded 20 similar events)
// Phase 1: matrix 245 rows 167 cols
[2025-06-03 05:31:13] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:31:13] [INFO ] Implicit Places using invariants in 322 ms returned []
[2025-06-03 05:31:14] [INFO ] Flow matrix only has 245 transitions (discarded 20 similar events)
[2025-06-03 05:31:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:31:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-03 05:31:14] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 05:31:14] [INFO ] Redundant transitions in 8 ms returned []
Running 261 sub problems to find dead transitions.
[2025-06-03 05:31:14] [INFO ] Flow matrix only has 245 transitions (discarded 20 similar events)
[2025-06-03 05:31:14] [INFO ] Invariant cache hit.
[2025-06-03 05:31:14] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 2/167 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 244/411 variables, 167/177 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 1/412 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/412 variables, and 179 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 167/167 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 2/167 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 244/411 variables, 167/177 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 261/439 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 1/412 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/412 variables, and 440 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 167/167 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in SI_LTL mode, iteration 1 : 167/362 places, 265/464 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60989 ms. Remains : 167/362 places, 265/464 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-09
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-09 finished in 61067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1||X(((X(X(p0))||F(!p1)) U (p1&&(X(X(p0))||F(!p1)))))))))'
Support contains 2 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 464/464 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 345 transition count 447
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 345 transition count 447
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 345 transition count 443
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 49 place count 334 transition count 432
Iterating global reduction 1 with 11 rules applied. Total rules applied 60 place count 334 transition count 432
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 68 place count 334 transition count 424
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 71 place count 331 transition count 421
Iterating global reduction 2 with 3 rules applied. Total rules applied 74 place count 331 transition count 421
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 331 transition count 420
Applied a total of 75 rules in 37 ms. Remains 331 /362 variables (removed 31) and now considering 420/464 (removed 44) transitions.
// Phase 1: matrix 420 rows 331 cols
[2025-06-03 05:32:14] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:32:15] [INFO ] Implicit Places using invariants in 356 ms returned []
[2025-06-03 05:32:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:32:15] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 944 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2025-06-03 05:32:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/331 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 420/751 variables, 331/341 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 751/751 variables, and 341 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 331/331 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/331 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 420/751 variables, 331/341 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/751 variables, 419/760 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:33:05] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:33:06] [INFO ] Deduced a trap composed of 74 places in 252 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:33:07] [INFO ] Deduced a trap composed of 77 places in 290 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:33:08] [INFO ] Deduced a trap composed of 78 places in 199 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:33:09] [INFO ] Deduced a trap composed of 79 places in 160 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:33:10] [INFO ] Deduced a trap composed of 81 places in 161 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:33:11] [INFO ] Deduced a trap composed of 81 places in 186 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:33:12] [INFO ] Deduced a trap composed of 81 places in 224 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 751/751 variables, and 768 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 331/331 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 331/362 places, 420/464 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61110 ms. Remains : 331/362 places, 420/464 transitions.
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0)), p1]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-11
Stuttering criterion allowed to conclude after 65 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-11 finished in 61500 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))&&(G(p1)||G(p2))) U X(p3)))'
Support contains 5 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 464/464 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 348 transition count 450
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 348 transition count 450
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 348 transition count 446
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 41 place count 339 transition count 437
Iterating global reduction 1 with 9 rules applied. Total rules applied 50 place count 339 transition count 437
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 56 place count 339 transition count 431
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 336 transition count 428
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 336 transition count 428
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 336 transition count 427
Applied a total of 63 rules in 32 ms. Remains 336 /362 variables (removed 26) and now considering 427/464 (removed 37) transitions.
// Phase 1: matrix 427 rows 336 cols
[2025-06-03 05:33:16] [INFO ] Computed 10 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:33:16] [INFO ] Implicit Places using invariants in 338 ms returned []
[2025-06-03 05:33:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:33:17] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 971 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2025-06-03 05:33:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (OVERLAPS) 427/763 variables, 336/346 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 763/763 variables, and 346 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (OVERLAPS) 427/763 variables, 336/346 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 426/772 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:34:06] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:34:08] [INFO ] Deduced a trap composed of 73 places in 319 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:34:09] [INFO ] Deduced a trap composed of 76 places in 309 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:34:10] [INFO ] Deduced a trap composed of 77 places in 291 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:34:11] [INFO ] Deduced a trap composed of 79 places in 225 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:34:12] [INFO ] Deduced a trap composed of 79 places in 255 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:34:13] [INFO ] Deduced a trap composed of 80 places in 202 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:34:14] [INFO ] Deduced a trap composed of 84 places in 208 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:34:15] [INFO ] Deduced a trap composed of 81 places in 197 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/763 variables, and 781 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Starting structural reductions in LTL mode, iteration 1 : 336/362 places, 427/464 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61141 ms. Remains : 336/362 places, 427/464 transitions.
Stuttering acceptance computed with spot in 649 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) p0), true, (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-12 finished in 61826 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G(!p0)))'
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 464/464 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 345 transition count 447
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 345 transition count 447
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 345 transition count 444
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 49 place count 333 transition count 432
Iterating global reduction 1 with 12 rules applied. Total rules applied 61 place count 333 transition count 432
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 70 place count 333 transition count 423
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 330 transition count 420
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 330 transition count 420
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 330 transition count 419
Applied a total of 77 rules in 31 ms. Remains 330 /362 variables (removed 32) and now considering 419/464 (removed 45) transitions.
// Phase 1: matrix 419 rows 330 cols
[2025-06-03 05:34:18] [INFO ] Computed 10 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:34:18] [INFO ] Implicit Places using invariants in 330 ms returned []
[2025-06-03 05:34:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:34:18] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 929 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2025-06-03 05:34: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/329 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (OVERLAPS) 1/330 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (OVERLAPS) 419/749 variables, 330/340 constraints. Problems are: Problem set: 0 solved, 418 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 749/749 variables, and 340 constraints, problems are : Problem set: 0 solved, 418 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 330/330 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 418 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (OVERLAPS) 1/330 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (OVERLAPS) 419/749 variables, 330/340 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/749 variables, 418/758 constraints. Problems are: Problem set: 0 solved, 418 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:35:08] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:35:09] [INFO ] Deduced a trap composed of 73 places in 334 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:35:10] [INFO ] Deduced a trap composed of 76 places in 317 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:35:13] [INFO ] Deduced a trap composed of 79 places in 254 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:35:14] [INFO ] Deduced a trap composed of 82 places in 204 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 05:35:15] [INFO ] Deduced a trap composed of 81 places in 174 ms of which 13 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 749/749 variables, and 764 constraints, problems are : Problem set: 0 solved, 418 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 330/330 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 418 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in LTL mode, iteration 1 : 330/362 places, 419/464 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61085 ms. Remains : 330/362 places, 419/464 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), p0, false, false]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-13
Entered a terminal (fully accepting) state of product in 89887 steps with 1370 reset in 229 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-13 finished in 61556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 464/464 transitions.
Graph (trivial) has 333 edges and 362 vertex of which 49 / 362 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 320 transition count 379
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 278 transition count 379
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 85 place count 278 transition count 360
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 123 place count 259 transition count 360
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 154 place count 228 transition count 329
Iterating global reduction 2 with 31 rules applied. Total rules applied 185 place count 228 transition count 329
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 188 place count 228 transition count 326
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 188 place count 228 transition count 325
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 227 transition count 325
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 197 place count 220 transition count 318
Iterating global reduction 3 with 7 rules applied. Total rules applied 204 place count 220 transition count 318
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 211 place count 220 transition count 311
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 311 place count 170 transition count 261
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 314 place count 167 transition count 258
Iterating global reduction 4 with 3 rules applied. Total rules applied 317 place count 167 transition count 258
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 320 place count 167 transition count 255
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 328 place count 167 transition count 247
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 330 place count 165 transition count 245
Applied a total of 330 rules in 86 ms. Remains 165 /362 variables (removed 197) and now considering 245/464 (removed 219) transitions.
[2025-06-03 05:35:19] [INFO ] Flow matrix only has 230 transitions (discarded 15 similar events)
// Phase 1: matrix 230 rows 165 cols
[2025-06-03 05:35:19] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:35:19] [INFO ] Implicit Places using invariants in 278 ms returned []
[2025-06-03 05:35:19] [INFO ] Flow matrix only has 230 transitions (discarded 15 similar events)
[2025-06-03 05:35:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 05:35:20] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 05:35:20] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2025-06-03 05:35:20] [INFO ] Flow matrix only has 230 transitions (discarded 15 similar events)
[2025-06-03 05:35:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 8/165 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 229/394 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/395 variables, and 175 constraints, problems are : Problem set: 0 solved, 122 unsolved in 11161 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 8/165 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 229/394 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 122/297 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/394 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/395 variables, and 297 constraints, problems are : Problem set: 0 solved, 122 unsolved in 12792 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24001ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 24002ms
Starting structural reductions in SI_LTL mode, iteration 1 : 165/362 places, 245/464 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24771 ms. Remains : 165/362 places, 245/464 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-15 finished in 24826 ms.
All properties solved by simple procedures.
Total runtime 836795 ms.

BK_STOP 1748928944408

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-08b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086-smll-174860102500444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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