Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490700084.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 StigmergyCommit-PT-07a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490700084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 5.4M May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749082529750

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 00:15:32] [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-05 00:15:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 00:15:33] [INFO ] Load time of PNML (sax parser for PT used): 799 ms
[2025-06-05 00:15:33] [INFO ] Transformed 292 places.
[2025-06-05 00:15:33] [INFO ] Transformed 7108 transitions.
[2025-06-05 00:15:33] [INFO ] Found NUPN structural information;
[2025-06-05 00:15:33] [INFO ] Parsed PT model containing 292 places and 7108 transitions and 108222 arcs in 1057 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
FORMULA StigmergyCommit-PT-07a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 890/890 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 229 transition count 819
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 229 transition count 819
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 134 place count 229 transition count 811
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 166 place count 197 transition count 772
Iterating global reduction 1 with 32 rules applied. Total rules applied 198 place count 197 transition count 772
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 206 place count 197 transition count 764
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 214 place count 189 transition count 756
Iterating global reduction 2 with 8 rules applied. Total rules applied 222 place count 189 transition count 756
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 230 place count 181 transition count 748
Iterating global reduction 2 with 8 rules applied. Total rules applied 238 place count 181 transition count 748
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 246 place count 173 transition count 740
Iterating global reduction 2 with 8 rules applied. Total rules applied 254 place count 173 transition count 740
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 262 place count 165 transition count 732
Iterating global reduction 2 with 8 rules applied. Total rules applied 270 place count 165 transition count 732
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 278 place count 165 transition count 724
Applied a total of 278 rules in 214 ms. Remains 165 /292 variables (removed 127) and now considering 724/890 (removed 166) transitions.
[2025-06-05 00:15:33] [INFO ] Flow matrix only has 714 transitions (discarded 10 similar events)
// Phase 1: matrix 714 rows 165 cols
[2025-06-05 00:15:33] [INFO ] Computed 3 invariants in 40 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:15:34] [INFO ] Implicit Places using invariants in 784 ms returned []
[2025-06-05 00:15:34] [INFO ] Flow matrix only has 714 transitions (discarded 10 similar events)
[2025-06-05 00:15:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:15:35] [INFO ] State equation strengthened by 581 read => feed constraints.
[2025-06-05 00:15:43] [INFO ] Implicit Places using invariants and state equation in 8787 ms returned [164]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9644 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/292 places, 724/890 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 142 transition count 702
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 142 transition count 702
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 52 place count 142 transition count 694
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 60 place count 134 transition count 686
Iterating global reduction 1 with 8 rules applied. Total rules applied 68 place count 134 transition count 686
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 76 place count 126 transition count 678
Iterating global reduction 1 with 8 rules applied. Total rules applied 84 place count 126 transition count 678
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 92 place count 118 transition count 670
Iterating global reduction 1 with 8 rules applied. Total rules applied 100 place count 118 transition count 670
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 108 place count 110 transition count 662
Iterating global reduction 1 with 8 rules applied. Total rules applied 116 place count 110 transition count 662
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 123 place count 103 transition count 655
Iterating global reduction 1 with 7 rules applied. Total rules applied 130 place count 103 transition count 655
Applied a total of 130 rules in 45 ms. Remains 103 /164 variables (removed 61) and now considering 655/724 (removed 69) transitions.
[2025-06-05 00:15:43] [INFO ] Flow matrix only has 645 transitions (discarded 10 similar events)
// Phase 1: matrix 645 rows 103 cols
[2025-06-05 00:15:43] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:15:43] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-05 00:15:43] [INFO ] Flow matrix only has 645 transitions (discarded 10 similar events)
[2025-06-05 00:15:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:15:43] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:15:44] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/292 places, 655/890 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10581 ms. Remains : 103/292 places, 655/890 transitions.
Support contains 10 out of 103 places after structural reductions.
[2025-06-05 00:15:44] [INFO ] Flatten gal took : 151 ms
[2025-06-05 00:15:44] [INFO ] Flatten gal took : 107 ms
[2025-06-05 00:15:44] [INFO ] Input system was already deterministic with 655 transitions.
RANDOM walk for 40000 steps (19 resets) in 4089 ms. (9 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
[2025-06-05 00:15:46] [INFO ] Flow matrix only has 645 transitions (discarded 10 similar events)
[2025-06-05 00:15:46] [INFO ] Invariant cache hit.
[2025-06-05 00:15:46] [INFO ] State equation strengthened by 517 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 8/748 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/103 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA StigmergyCommit-PT-07a-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA StigmergyCommit-PT-07a-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 3 stabilizing places and 3 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' '!(F((!p0&&X(X(F(p0))))))'
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 655/655 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 101 transition count 652
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 652
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 100 transition count 651
Applied a total of 6 rules in 12 ms. Remains 100 /103 variables (removed 3) and now considering 651/655 (removed 4) transitions.
[2025-06-05 00:15:46] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2025-06-05 00:15:46] [INFO ] Computed 1 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:15:46] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-05 00:15:46] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:15:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:15:46] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:15:46] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2025-06-05 00:15:47] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:15:47] [INFO ] Invariant cache hit.
[2025-06-05 00:15:47] [INFO ] State equation strengthened by 517 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:57] [INFO ] Deduced a trap composed of 13 places in 390 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:57] [INFO ] Deduced a trap composed of 13 places in 402 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:57] [INFO ] Deduced a trap composed of 13 places in 378 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:58] [INFO ] Deduced a trap composed of 13 places in 282 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:58] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:58] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:59] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:59] [INFO ] Deduced a trap composed of 13 places in 377 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:59] [INFO ] Deduced a trap composed of 13 places in 325 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:00] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:00] [INFO ] Deduced a trap composed of 13 places in 335 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:00] [INFO ] Deduced a trap composed of 13 places in 316 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:01] [INFO ] Deduced a trap composed of 13 places in 317 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:01] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:01] [INFO ] Deduced a trap composed of 13 places in 279 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:01] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:02] [INFO ] Deduced a trap composed of 13 places in 374 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:02] [INFO ] Deduced a trap composed of 13 places in 332 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:03] [INFO ] Deduced a trap composed of 13 places in 403 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:03] [INFO ] Deduced a trap composed of 13 places in 347 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:04] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:04] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:04] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:04] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:05] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:05] [INFO ] Deduced a trap composed of 13 places in 267 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:05] [INFO ] Deduced a trap composed of 13 places in 274 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:06] [INFO ] Deduced a trap composed of 13 places in 329 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:06] [INFO ] Deduced a trap composed of 15 places in 306 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:06] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:07] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:07] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:07] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:08] [INFO ] Deduced a trap composed of 13 places in 285 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:08] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:08] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:08] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:08] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:11] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:11] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:14] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:14] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:14] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:14] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:14] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:14] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:14] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:14] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:15] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:15] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:15] [INFO ] Deduced a trap composed of 13 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-05 00:16:15] [INFO ] Deduced a trap composed of 15 places in 278 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:17] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:17] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:17] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:18] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:18] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:18] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 6 ms to minimize.
SMT process timed out in 31698ms, After SMT, problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 31722ms
Starting structural reductions in LTL mode, iteration 1 : 100/103 places, 651/655 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32097 ms. Remains : 100/103 places, 651/655 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-00
Product exploration explored 100000 steps with 1923 reset in 721 ms.
Product exploration explored 100000 steps with 1923 reset in 504 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 204 steps (0 resets) in 7 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-05 00:16:20] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:16:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:16:21] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-05 00:16:21] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2025-06-05 00:16:21] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:16:21] [INFO ] [Real]Added 517 Read/Feed constraints in 87 ms returned sat
[2025-06-05 00:16:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:16:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-06-05 00:16:22] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2025-06-05 00:16:22] [INFO ] [Nat]Added 517 Read/Feed constraints in 125 ms returned sat
[2025-06-05 00:16:22] [INFO ] Computed and/alt/rep : 106/130/106 causal constraints (skipped 535 transitions) in 188 ms.
[2025-06-05 00:16:24] [INFO ] Added : 82 causal constraints over 17 iterations in 1769 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 651/651 (removed 0) transitions.
[2025-06-05 00:16:24] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:16:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:16:24] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-05 00:16:24] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:16:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:16:24] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:16:24] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2025-06-05 00:16:24] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:16:24] [INFO ] Invariant cache hit.
[2025-06-05 00:16:24] [INFO ] State equation strengthened by 517 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:32] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:32] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:32] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:33] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:33] [INFO ] Deduced a trap composed of 15 places in 285 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:33] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:33] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:34] [INFO ] Deduced a trap composed of 13 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-05 00:16:34] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:34] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:34] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:35] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:35] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:35] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:35] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:36] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:36] [INFO ] Deduced a trap composed of 13 places in 329 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:36] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:37] [INFO ] Deduced a trap composed of 13 places in 379 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:37] [INFO ] Deduced a trap composed of 13 places in 300 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:38] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:38] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:38] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:38] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:38] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:38] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:39] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:39] [INFO ] Deduced a trap composed of 13 places in 276 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:39] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:40] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:40] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:40] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:40] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:40] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:41] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:41] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:41] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:41] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:43] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:43] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:47] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:47] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:48] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:48] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:48] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:48] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:48] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:49] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:49] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:49] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:49] [INFO ] Deduced a trap composed of 13 places in 333 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:50] [INFO ] Deduced a trap composed of 15 places in 317 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:53] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:53] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:53] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:53] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:53] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:54] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:54] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:55] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:55] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:55] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:55] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:55] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 5 ms to minimize.
SMT process timed out in 30993ms, After SMT, problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 30997ms
Finished structural reductions in LTL mode , in 1 iterations and 31428 ms. Remains : 100/100 places, 651/651 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 204 steps (0 resets) in 8 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-05 00:16:56] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:16:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:16:56] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-06-05 00:16:57] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2025-06-05 00:16:57] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:16:57] [INFO ] [Real]Added 517 Read/Feed constraints in 107 ms returned sat
[2025-06-05 00:16:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:16:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-06-05 00:16:58] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2025-06-05 00:16:58] [INFO ] [Nat]Added 517 Read/Feed constraints in 129 ms returned sat
[2025-06-05 00:16:58] [INFO ] Computed and/alt/rep : 106/130/106 causal constraints (skipped 535 transitions) in 86 ms.
[2025-06-05 00:16:59] [INFO ] Added : 82 causal constraints over 17 iterations in 1539 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1923 reset in 548 ms.
Product exploration explored 100000 steps with 1923 reset in 681 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 100 transition count 651
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 25 place count 100 transition count 659
Deduced a syphon composed of 33 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 33 place count 100 transition count 659
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 49 place count 84 transition count 643
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 65 place count 84 transition count 643
Performed 33 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 98 place count 84 transition count 651
Ensure Unique test removed 271 transitions
Reduce isomorphic transitions removed 271 transitions.
Iterating post reduction 1 with 271 rules applied. Total rules applied 369 place count 84 transition count 380
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 387 place count 66 transition count 362
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 405 place count 66 transition count 362
Deduced a syphon composed of 32 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 421 place count 66 transition count 346
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 429 place count 66 transition count 346
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 445 place count 50 transition count 330
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 461 place count 50 transition count 330
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 461 rules in 379 ms. Remains 50 /100 variables (removed 50) and now considering 330/651 (removed 321) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:17:02] [INFO ] Redundant transitions in 160 ms returned []
Running 329 sub problems to find dead transitions.
[2025-06-05 00:17:02] [INFO ] Flow matrix only has 321 transitions (discarded 9 similar events)
// Phase 1: matrix 321 rows 50 cols
[2025-06-05 00:17:02] [INFO ] Computed 1 invariants in 5 ms
[2025-06-05 00:17:02] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:05] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:05] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:05] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:05] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:05] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:05] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:05] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:05] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:05] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:06] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:06] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:06] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:06] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:06] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:06] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:07] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:07] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:07] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:07] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:07] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:07] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:08] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:08] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:08] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:08] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:08] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:08] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:08] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:08] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:08] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:09] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:09] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:09] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:09] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:09] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:09] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:09] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:09] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:09] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:10] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
At refinement iteration 5 (OVERLAPS) 320/370 variables, 50/91 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 270/361 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/361 constraints. Problems are: Problem set: 32 solved, 297 unsolved
SMT process timed out in 30533ms, After SMT, problems are : Problem set: 32 solved, 297 unsolved
Search for dead transitions found 32 dead transitions in 30536ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 50/100 places, 298/651 transitions.
Graph (complete) has 233 edges and 50 vertex of which 26 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 37 ms. Remains 26 /50 variables (removed 24) and now considering 298/298 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/100 places, 298/651 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31137 ms. Remains : 26/100 places, 298/651 transitions.
Built C files in :
/tmp/ltsmin5923963730990507315
[2025-06-05 00:17:32] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5923963730990507315
Running compilation step : cd /tmp/ltsmin5923963730990507315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5923963730990507315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5923963730990507315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 651/651 (removed 0) transitions.
[2025-06-05 00:17:35] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2025-06-05 00:17:35] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:17:35] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-05 00:17:35] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:17:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:17:36] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:17:36] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2025-06-05 00:17:36] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:17:36] [INFO ] Invariant cache hit.
[2025-06-05 00:17:36] [INFO ] State equation strengthened by 517 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:45] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:45] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:45] [INFO ] Deduced a trap composed of 13 places in 293 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:46] [INFO ] Deduced a trap composed of 13 places in 329 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:46] [INFO ] Deduced a trap composed of 15 places in 330 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:46] [INFO ] Deduced a trap composed of 13 places in 316 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:47] [INFO ] Deduced a trap composed of 13 places in 321 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:47] [INFO ] Deduced a trap composed of 13 places in 397 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:48] [INFO ] Deduced a trap composed of 13 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-05 00:17:48] [INFO ] Deduced a trap composed of 13 places in 284 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:48] [INFO ] Deduced a trap composed of 13 places in 334 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:48] [INFO ] Deduced a trap composed of 13 places in 336 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:49] [INFO ] Deduced a trap composed of 13 places in 330 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:49] [INFO ] Deduced a trap composed of 13 places in 321 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:50] [INFO ] Deduced a trap composed of 13 places in 343 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:50] [INFO ] Deduced a trap composed of 13 places in 281 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:50] [INFO ] Deduced a trap composed of 13 places in 428 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:51] [INFO ] Deduced a trap composed of 13 places in 367 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:51] [INFO ] Deduced a trap composed of 13 places in 413 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:52] [INFO ] Deduced a trap composed of 13 places in 373 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:52] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:52] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:53] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:53] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:53] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:53] [INFO ] Deduced a trap composed of 13 places in 290 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:54] [INFO ] Deduced a trap composed of 13 places in 275 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:54] [INFO ] Deduced a trap composed of 13 places in 347 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:54] [INFO ] Deduced a trap composed of 15 places in 332 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:55] [INFO ] Deduced a trap composed of 15 places in 289 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:55] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:55] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:55] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:56] [INFO ] Deduced a trap composed of 13 places in 286 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:56] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:56] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:57] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:57] [INFO ] Deduced a trap composed of 13 places in 275 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:00] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:00] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:04] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:05] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:05] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:05] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:05] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:05] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:06] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:06] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:06] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:06] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:06] [INFO ] Deduced a trap composed of 13 places in 334 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:07] [INFO ] Deduced a trap composed of 15 places in 323 ms of which 22 ms to minimize.
SMT process timed out in 31007ms, After SMT, problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 31012ms
Finished structural reductions in LTL mode , in 1 iterations and 31376 ms. Remains : 100/100 places, 651/651 transitions.
Built C files in :
/tmp/ltsmin158769090227171415
[2025-06-05 00:18:07] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin158769090227171415
Running compilation step : cd /tmp/ltsmin158769090227171415;'/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 2650 ms.
Running link step : cd /tmp/ltsmin158769090227171415;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin158769090227171415;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9147984657581618646.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 00:18:22] [INFO ] Flatten gal took : 64 ms
[2025-06-05 00:18:22] [INFO ] Flatten gal took : 57 ms
[2025-06-05 00:18:22] [INFO ] Time to serialize gal into /tmp/LTL16723406346658622460.gal : 28 ms
[2025-06-05 00:18:22] [INFO ] Time to serialize properties into /tmp/LTL5506249439604982037.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/LTL16723406346658622460.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18139097266522527415.hoa' '-atoms' '/tmp/LTL5506249439604982037.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5506249439604982037.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18139097266522527415.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...456
Detected timeout of ITS tools.
[2025-06-05 00:18:37] [INFO ] Flatten gal took : 73 ms
[2025-06-05 00:18:37] [INFO ] Flatten gal took : 72 ms
[2025-06-05 00:18:38] [INFO ] Time to serialize gal into /tmp/LTL12997297586815405404.gal : 20 ms
[2025-06-05 00:18:38] [INFO ] Time to serialize properties into /tmp/LTL1130003008645839852.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/LTL12997297586815405404.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1130003008645839852.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((X(X(F("((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))"))))&&("((((p30!=1)||(...244
Formula 0 simplified : G(!"((((p30!=1)||(p66!=1))||((p102!=1)||(p138!=1)))||(((p174!=1)||(p210!=1))||((p246!=1)||(p282!=1))))" | XXG!"((((p30==1)&&(p66==1)...234
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...456
Detected timeout of ITS tools.
[2025-06-05 00:18:53] [INFO ] Flatten gal took : 63 ms
[2025-06-05 00:18:53] [INFO ] Applying decomposition
[2025-06-05 00:18:53] [INFO ] Flatten gal took : 62 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/graph10218016461237535381.txt' '-o' '/tmp/graph10218016461237535381.bin' '-w' '/tmp/graph10218016461237535381.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10218016461237535381.bin' '-l' '-1' '-v' '-w' '/tmp/graph10218016461237535381.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:18:53] [INFO ] Decomposing Gal with order
[2025-06-05 00:18:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:18:54] [INFO ] Removed a total of 4140 redundant transitions.
[2025-06-05 00:18:54] [INFO ] Flatten gal took : 397 ms
[2025-06-05 00:18:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 73 ms.
[2025-06-05 00:18:54] [INFO ] Time to serialize gal into /tmp/LTL11135304614270360181.gal : 15 ms
[2025-06-05 00:18:54] [INFO ] Time to serialize properties into /tmp/LTL6176906538095649675.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11135304614270360181.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6176906538095649675.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((X(X(F("((((i7.u5.p30==1)&&(i7.u11.p66==1))&&((i7.u16.p102==1)&&(i7.u21.p138==1)))&&(((i7.u7.p174==1)&&(i7.u24.p210==1))&&((i7.u1...350
Formula 0 simplified : G(!"((((i7.u5.p30!=1)||(i7.u11.p66!=1))||((i7.u16.p102!=1)||(i7.u21.p138!=1)))||(((i7.u7.p174!=1)||(i7.u24.p210!=1))||((i7.u19.p246!...340
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t11, t18, t21, t23, t26, t33, t41, t639, t641, t643, t645, t647, t649, t651, t653, i2...647
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
333 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.40166,85060,1,0,75285,275,10717,207593,244,838,811133
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyCommit-PT-07a-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property StigmergyCommit-PT-07a-LTLFireability-00 finished in 191342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&X(p0))||(!p1&&X(F(!p1))))))'
Support contains 9 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 655/655 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 654
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 654
Applied a total of 2 rules in 6 ms. Remains 102 /103 variables (removed 1) and now considering 654/655 (removed 1) transitions.
[2025-06-05 00:18:57] [INFO ] Flow matrix only has 645 transitions (discarded 9 similar events)
// Phase 1: matrix 645 rows 102 cols
[2025-06-05 00:18:57] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:18:57] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-05 00:18:57] [INFO ] Flow matrix only has 645 transitions (discarded 9 similar events)
[2025-06-05 00:18:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:18:58] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:18:58] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 653 sub problems to find dead transitions.
[2025-06-05 00:18:58] [INFO ] Flow matrix only has 645 transitions (discarded 9 similar events)
[2025-06-05 00:18:58] [INFO ] Invariant cache hit.
[2025-06-05 00:18:58] [INFO ] State equation strengthened by 517 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 653 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:07] [INFO ] Deduced a trap composed of 13 places in 276 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:07] [INFO ] Deduced a trap composed of 13 places in 272 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:08] [INFO ] Deduced a trap composed of 13 places in 282 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:08] [INFO ] Deduced a trap composed of 13 places in 281 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:08] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:08] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:09] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:09] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:09] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:09] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:09] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:10] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:10] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:10] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:10] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:10] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:10] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:11] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:11] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:11] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 653 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:11] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:12] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:12] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:12] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:12] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:12] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:13] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:13] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:13] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:13] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:14] [INFO ] Deduced a trap composed of 16 places in 259 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:14] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:14] [INFO ] Deduced a trap composed of 16 places in 357 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:14] [INFO ] Deduced a trap composed of 16 places in 353 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:15] [INFO ] Deduced a trap composed of 16 places in 258 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:15] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:15] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:15] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:15] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:15] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 653 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:18] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:18] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:18] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:18] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:18] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:19] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:19] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:19] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:19] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:19] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:20] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:20] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:20] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:23] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:23] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:23] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:23] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:23] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 653 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:24] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:24] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:24] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:24] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:24] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:25] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:25] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:25] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:25] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:25] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:25] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:26] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:26] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:26] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:26] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:26] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:26] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:26] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 102/747 variables, and 77 constraints, problems are : Problem set: 0 solved, 653 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/102 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 653/134 constraints, Known Traps: 76/76 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 653 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 653 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 76/77 constraints. Problems are: Problem set: 0 solved, 653 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:37] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:37] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:37] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:37] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:37] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:37] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:37] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:38] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:38] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:38] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:38] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:38] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:38] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:38] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:39] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:39] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:39] [INFO ] Deduced a trap composed of 16 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-05 00:19:40] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:40] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:44] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 653 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:47] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:47] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:48] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:19:55] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 653 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 102/747 variables, and 101 constraints, problems are : Problem set: 0 solved, 653 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/102 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 519/134 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61531ms problems are : Problem set: 0 solved, 653 unsolved
Search for dead transitions found 0 dead transitions in 61536ms
Starting structural reductions in LTL mode, iteration 1 : 102/103 places, 654/655 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61949 ms. Remains : 102/103 places, 654/655 transitions.
Stuttering acceptance computed with spot in 207 ms :[p1, (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), true]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 216 ms.
Product exploration explored 100000 steps with 33333 reset in 240 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 16 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-07a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-07a-LTLFireability-01 finished in 62669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p0))))'
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 655/655 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 101 transition count 652
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 652
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 100 transition count 651
Applied a total of 6 rules in 14 ms. Remains 100 /103 variables (removed 3) and now considering 651/655 (removed 4) transitions.
[2025-06-05 00:20:00] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2025-06-05 00:20:00] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:20:00] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-05 00:20:00] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:20:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:20:00] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:20:01] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2025-06-05 00:20:01] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:20:01] [INFO ] Invariant cache hit.
[2025-06-05 00:20:01] [INFO ] State equation strengthened by 517 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:10] [INFO ] Deduced a trap composed of 13 places in 332 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:10] [INFO ] Deduced a trap composed of 13 places in 343 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:10] [INFO ] Deduced a trap composed of 13 places in 326 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:11] [INFO ] Deduced a trap composed of 13 places in 310 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:11] [INFO ] Deduced a trap composed of 15 places in 324 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:11] [INFO ] Deduced a trap composed of 13 places in 335 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:12] [INFO ] Deduced a trap composed of 13 places in 339 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:12] [INFO ] Deduced a trap composed of 13 places in 413 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:12] [INFO ] Deduced a trap composed of 13 places in 315 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:13] [INFO ] Deduced a trap composed of 13 places in 251 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:13] [INFO ] Deduced a trap composed of 13 places in 341 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:13] [INFO ] Deduced a trap composed of 13 places in 345 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:14] [INFO ] Deduced a trap composed of 13 places in 304 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:14] [INFO ] Deduced a trap composed of 13 places in 314 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:14] [INFO ] Deduced a trap composed of 13 places in 341 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:15] [INFO ] Deduced a trap composed of 13 places in 267 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:15] [INFO ] Deduced a trap composed of 13 places in 438 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:16] [INFO ] Deduced a trap composed of 13 places in 348 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:16] [INFO ] Deduced a trap composed of 13 places in 446 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:16] [INFO ] Deduced a trap composed of 13 places in 326 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:17] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:17] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:18] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:18] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:18] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:18] [INFO ] Deduced a trap composed of 13 places in 280 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:19] [INFO ] Deduced a trap composed of 13 places in 288 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:19] [INFO ] Deduced a trap composed of 13 places in 344 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:20] [INFO ] Deduced a trap composed of 15 places in 335 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:20] [INFO ] Deduced a trap composed of 15 places in 290 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:20] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:20] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:21] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:21] [INFO ] Deduced a trap composed of 13 places in 295 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:21] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:22] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:22] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:22] [INFO ] Deduced a trap composed of 13 places in 281 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:25] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:25] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:29] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:29] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:30] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:30] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:30] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:30] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:30] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:31] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:31] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:31] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:31] [INFO ] Deduced a trap composed of 13 places in 361 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:32] [INFO ] Deduced a trap composed of 15 places in 349 ms of which 21 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/742 variables, and 53 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/100 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 650/131 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:37] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:37] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:37] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:38] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:38] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:38] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:38] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:38] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:38] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:38] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:38] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:39] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:39] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:39] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:39] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:39] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:39] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:39] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:40] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:40] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:43] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:43] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:43] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:43] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:43] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:44] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:44] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:56] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:56] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:20:57] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 100/742 variables, and 83 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/100 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 519/131 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61331ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 61334ms
Starting structural reductions in LTL mode, iteration 1 : 100/103 places, 651/655 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61762 ms. Remains : 100/103 places, 651/655 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-02 finished in 61950 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))&&F(p1)))'
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 655/655 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 101 transition count 652
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 652
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 100 transition count 651
Applied a total of 6 rules in 11 ms. Remains 100 /103 variables (removed 3) and now considering 651/655 (removed 4) transitions.
[2025-06-05 00:21:02] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:21:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:21:02] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-05 00:21:02] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:21:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:21:02] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:21:03] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2025-06-05 00:21:03] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:21:03] [INFO ] Invariant cache hit.
[2025-06-05 00:21:03] [INFO ] State equation strengthened by 517 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:13] [INFO ] Deduced a trap composed of 13 places in 310 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:13] [INFO ] Deduced a trap composed of 13 places in 315 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:14] [INFO ] Deduced a trap composed of 13 places in 346 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:14] [INFO ] Deduced a trap composed of 13 places in 302 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:14] [INFO ] Deduced a trap composed of 15 places in 300 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:15] [INFO ] Deduced a trap composed of 13 places in 291 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:15] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:15] [INFO ] Deduced a trap composed of 13 places in 331 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:15] [INFO ] Deduced a trap composed of 13 places in 248 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:16] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:16] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:16] [INFO ] Deduced a trap composed of 13 places in 266 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:17] [INFO ] Deduced a trap composed of 13 places in 318 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:17] [INFO ] Deduced a trap composed of 13 places in 277 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:17] [INFO ] Deduced a trap composed of 13 places in 288 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:17] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:18] [INFO ] Deduced a trap composed of 13 places in 350 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:18] [INFO ] Deduced a trap composed of 13 places in 294 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:19] [INFO ] Deduced a trap composed of 13 places in 280 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:19] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:19] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:20] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:20] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:20] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:20] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:20] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:21] [INFO ] Deduced a trap composed of 13 places in 277 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:21] [INFO ] Deduced a trap composed of 13 places in 328 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:21] [INFO ] Deduced a trap composed of 15 places in 330 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:22] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:22] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:22] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:22] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:23] [INFO ] Deduced a trap composed of 13 places in 279 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:23] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:23] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:23] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:24] [INFO ] Deduced a trap composed of 13 places in 282 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:27] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:27] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:31] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:32] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:32] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:32] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:32] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:32] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:33] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:33] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:33] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:33] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:34] [INFO ] Deduced a trap composed of 13 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-05 00:21:34] [INFO ] Deduced a trap composed of 15 places in 321 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/742 variables, and 53 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/100 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 650/131 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:39] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:39] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:39] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:39] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:39] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:39] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:39] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:39] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:40] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:40] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:40] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:40] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:40] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:40] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:40] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:40] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:41] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:41] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:41] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:41] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:43] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:44] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:44] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:44] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:44] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:44] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:45] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:56] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:56] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:21:57] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 100/742 variables, and 83 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/100 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 519/131 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61691ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 61695ms
Starting structural reductions in LTL mode, iteration 1 : 100/103 places, 651/655 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62180 ms. Remains : 100/103 places, 651/655 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-04
Product exploration explored 100000 steps with 1923 reset in 468 ms.
Product exploration explored 100000 steps with 1923 reset in 610 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 204 steps (0 resets) in 7 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
[2025-06-05 00:22:06] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:22:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:22:07] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-06-05 00:22:07] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2025-06-05 00:22:07] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:22:07] [INFO ] [Real]Added 517 Read/Feed constraints in 110 ms returned sat
[2025-06-05 00:22:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:22:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-06-05 00:22:08] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2025-06-05 00:22:08] [INFO ] [Nat]Added 517 Read/Feed constraints in 128 ms returned sat
[2025-06-05 00:22:08] [INFO ] Computed and/alt/rep : 106/130/106 causal constraints (skipped 535 transitions) in 91 ms.
[2025-06-05 00:22:10] [INFO ] Added : 82 causal constraints over 17 iterations in 1823 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 99 transition count 625
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 74 transition count 625
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 74 transition count 617
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 116 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 371 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 385 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 392 place count 34 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 400 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 416 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 25 transition count 297
Applied a total of 417 rules in 204 ms. Remains 25 /100 variables (removed 75) and now considering 297/651 (removed 354) transitions.
[2025-06-05 00:22:10] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2025-06-05 00:22:10] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:22:10] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-05 00:22:10] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2025-06-05 00:22:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:22:10] [INFO ] State equation strengthened by 271 read => feed constraints.
[2025-06-05 00:22:10] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:22:10] [INFO ] Redundant transitions in 13 ms returned []
Running 289 sub problems to find dead transitions.
[2025-06-05 00:22:10] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2025-06-05 00:22:10] [INFO ] Invariant cache hit.
[2025-06-05 00:22:10] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:13] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:13] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:13] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:13] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:13] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:13] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:14] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:14] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:14] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:14] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:14] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:14] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:14] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:14] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:14] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:15] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:15] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:15] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:15] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:15] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:15] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:15] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:15] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:15] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:15] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:16] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:16] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:16] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:16] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:16] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:16] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:16] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:16] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:16] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:17] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:17] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:18] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:18] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:18] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:18] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:18] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 287/312 variables, 25/67 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 270/337 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 1/313 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 313/313 variables, and 338 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/17 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:43] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:43] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:43] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:43] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:43] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:43] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:43] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:43] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:43] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:44] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:44] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:45] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:45] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:22:45] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 287/312 variables, 25/81 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 270/351 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 17/368 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (OVERLAPS) 1/313 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 369 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/17 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60824ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 60826ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/100 places, 297/651 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61301 ms. Remains : 25/100 places, 297/651 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2025-06-05 00:23:12] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2025-06-05 00:23:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:23:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 00:23:12] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2025-06-05 00:23:12] [INFO ] State equation strengthened by 271 read => feed constraints.
[2025-06-05 00:23:12] [INFO ] [Real]Added 271 Read/Feed constraints in 47 ms returned sat
[2025-06-05 00:23:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:23:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 00:23:12] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-06-05 00:23:12] [INFO ] [Nat]Added 271 Read/Feed constraints in 51 ms returned sat
[2025-06-05 00:23:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 21 ms.
[2025-06-05 00:23:12] [INFO ] Added : 0 causal constraints over 0 iterations in 64 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 1207 ms.
Product exploration explored 100000 steps with 11111 reset in 1141 ms.
Built C files in :
/tmp/ltsmin16992118231673145550
[2025-06-05 00:23:15] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2025-06-05 00:23:15] [INFO ] Computation of Complete disable matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:23:15] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2025-06-05 00:23:15] [INFO ] Computation of Complete enable matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:23:15] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2025-06-05 00:23:15] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:23:15] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16992118231673145550
Running compilation step : cd /tmp/ltsmin16992118231673145550;'/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 2112 ms.
Running link step : cd /tmp/ltsmin16992118231673145550;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin16992118231673145550;'/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/stateBased16467898178112861801.hoa' '--buchi-type=spotba'
LTSmin run took 739 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-07a-LTLFireability-04 finished in 135846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 655/655 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 102 transition count 628
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 76 transition count 628
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 52 place count 76 transition count 619
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 70 place count 67 transition count 619
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 65 transition count 616
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 65 transition count 616
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 65 transition count 615
Performed 24 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 123 place count 41 transition count 582
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Iterating post reduction 3 with 254 rules applied. Total rules applied 377 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 391 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 398 place count 34 transition count 314
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 406 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 422 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 423 place count 25 transition count 297
Applied a total of 423 rules in 119 ms. Remains 25 /103 variables (removed 78) and now considering 297/655 (removed 358) transitions.
[2025-06-05 00:23:18] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2025-06-05 00:23:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:23:18] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-05 00:23:18] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2025-06-05 00:23:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:23:18] [INFO ] State equation strengthened by 271 read => feed constraints.
[2025-06-05 00:23:18] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:23:18] [INFO ] Redundant transitions in 7 ms returned []
Running 289 sub problems to find dead transitions.
[2025-06-05 00:23:18] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2025-06-05 00:23:18] [INFO ] Invariant cache hit.
[2025-06-05 00:23:18] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:21] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:21] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:21] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:21] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:21] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:21] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:21] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:21] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:21] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:22] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:22] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:22] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:22] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:22] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:22] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:23] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:23] [INFO ] Deduced a trap composed of 4 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-05 00:23:23] [INFO ] Deduced a trap composed of 4 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-05 00:23:23] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:23] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:24] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:24] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:24] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:24] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:24] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:24] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:24] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:24] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:24] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:25] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:25] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:25] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:25] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:25] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:26] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:26] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:26] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:27] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:27] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:27] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:27] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 287/312 variables, 25/67 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 270/337 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 1/313 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 289 unsolved
(t134 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 (/ 7.0 4.0))
(t2 (/ 7.0 4.0))
(t3 1.0)
(t4 1.0)
(t5 1.0)
(t6 1.0)
(t7 1.0)
(t8 0.0)
(t9 1.0)
(t10 1.0)
(t11 1.0)
(t12 1.0)
(t13 1.0)
(t14 1.0)
(t15 1.0)
(t16 1.0)
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 (/ 3.0 4.0))
(t34 0.0)
(t35 0.0)
(t36 (/ 3.0 4.0))
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 0.0)
(t45 0.0)
(t46 0.0)
(t47 0.0)
(t48 (/ 3.0 4.0))
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 (/ 1.0 4.0))
(t54 0.0)
(t55 0.0)
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 0.0)
(t67 0.0)
(t68 0.0)
(t69 0.0)
(t70 0.0)
(t71 0.0)
(t72 0.0)
(t73 0.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 0.0)
(t111 0.0)
(t112 0.0)
(t113 0.0)
(t114 0.0)
(t115 0.0)
(t116 0.0)
(t117 0.0)
(t118 0.0)
(t119 0.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 0.0)
(t124 0.0)
(t125 0.0)
(t126 0.0)
(t127 0.0)
(t128 (/ 3.0 4.0))
(t129 0.0)
(t130 0.0)
(t131 0.0)
(t132 0.0)
(t133 0.0)
(t134 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 313/313 variables, and 338 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/17 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:50] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:50] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:50] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:50] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:50] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:50] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:50] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:51] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:51] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:51] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:51] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:52] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:52] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:23:52] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 287/312 variables, 25/81 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 270/351 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 17/368 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (OVERLAPS) 1/313 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 369 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/17 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60750ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 60751ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/103 places, 297/655 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61045 ms. Remains : 25/103 places, 297/655 transitions.
Stuttering acceptance computed with spot in 110 ms :[p0, p0]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-05
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-05 finished in 61172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(G(p0)) U p0)&&(G(F(p0)) U !p0))))'
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 655/655 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 101 transition count 652
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 652
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 100 transition count 651
Applied a total of 6 rules in 11 ms. Remains 100 /103 variables (removed 3) and now considering 651/655 (removed 4) transitions.
[2025-06-05 00:24:19] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2025-06-05 00:24:19] [INFO ] Computed 1 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:24:19] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-05 00:24:19] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:24:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:24:19] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:24:20] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2025-06-05 00:24:20] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:24:20] [INFO ] Invariant cache hit.
[2025-06-05 00:24:20] [INFO ] State equation strengthened by 517 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:29] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:29] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:30] [INFO ] Deduced a trap composed of 13 places in 287 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:30] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:30] [INFO ] Deduced a trap composed of 15 places in 270 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:30] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:31] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:31] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:31] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:31] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:32] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:32] [INFO ] Deduced a trap composed of 13 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-05 00:24:32] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:32] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:33] [INFO ] Deduced a trap composed of 13 places in 248 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:33] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:33] [INFO ] Deduced a trap composed of 13 places in 343 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:34] [INFO ] Deduced a trap composed of 13 places in 332 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:34] [INFO ] Deduced a trap composed of 13 places in 416 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:34] [INFO ] Deduced a trap composed of 13 places in 326 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:35] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:35] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:35] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:35] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:36] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:36] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:36] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:37] [INFO ] Deduced a trap composed of 13 places in 347 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:37] [INFO ] Deduced a trap composed of 15 places in 334 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:38] [INFO ] Deduced a trap composed of 15 places in 270 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:38] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:38] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:38] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:39] [INFO ] Deduced a trap composed of 13 places in 297 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:39] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:39] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:39] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:40] [INFO ] Deduced a trap composed of 13 places in 279 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:42] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:43] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:47] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:47] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:47] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:48] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:48] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:48] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:48] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:48] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:48] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:49] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:49] [INFO ] Deduced a trap composed of 13 places in 342 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:49] [INFO ] Deduced a trap composed of 15 places in 339 ms of which 21 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/742 variables, and 53 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/100 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 650/131 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:56] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:56] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:56] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:56] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:56] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:56] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:56] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:56] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:57] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:57] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:57] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:57] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:57] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:57] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:57] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:57] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:58] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:58] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:58] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:24:58] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:01] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:01] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:01] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:01] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:02] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:02] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:03] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:14] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:14] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:15] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 100/742 variables, and 83 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/100 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 519/131 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61264ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 61268ms
Starting structural reductions in LTL mode, iteration 1 : 100/103 places, 651/655 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61761 ms. Remains : 100/103 places, 651/655 transitions.
Stuttering acceptance computed with spot in 297 ms :[true, true, (NOT p0), (NOT p0), p0, (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-06
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-06 finished in 62089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 655/655 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 102 transition count 628
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 76 transition count 628
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 52 place count 76 transition count 619
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 70 place count 67 transition count 619
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 65 transition count 616
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 65 transition count 616
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 65 transition count 615
Performed 24 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 123 place count 41 transition count 582
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Iterating post reduction 3 with 254 rules applied. Total rules applied 377 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 391 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 398 place count 34 transition count 314
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 406 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 422 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 423 place count 25 transition count 297
Applied a total of 423 rules in 175 ms. Remains 25 /103 variables (removed 78) and now considering 297/655 (removed 358) transitions.
[2025-06-05 00:25:21] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2025-06-05 00:25:21] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:25:21] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-05 00:25:21] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2025-06-05 00:25:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:25:22] [INFO ] State equation strengthened by 271 read => feed constraints.
[2025-06-05 00:25:22] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:25:22] [INFO ] Redundant transitions in 10 ms returned []
Running 289 sub problems to find dead transitions.
[2025-06-05 00:25:22] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2025-06-05 00:25:22] [INFO ] Invariant cache hit.
[2025-06-05 00:25:22] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:24] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:24] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:24] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:24] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:24] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:24] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:24] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:25] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:25] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:25] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:25] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:25] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:25] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:26] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:26] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:26] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:26] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:26] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:26] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:27] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:27] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:27] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:27] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:27] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:27] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:27] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:27] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:27] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:28] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:28] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:28] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:28] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:28] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:28] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:29] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:30] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:30] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:30] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:30] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:30] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:30] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 287/312 variables, 25/67 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 270/337 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 1/313 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 313/313 variables, and 338 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/17 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:53] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:53] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:53] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:54] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:54] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:54] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:54] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:54] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:54] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:54] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:54] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:56] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:56] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:25:56] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 287/312 variables, 25/81 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 270/351 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 17/368 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (OVERLAPS) 1/313 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 369 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/17 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60559ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 60561ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/103 places, 297/655 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61016 ms. Remains : 25/103 places, 297/655 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-07
Stuttering criterion allowed to conclude after 3780 steps with 419 reset in 39 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-07 finished in 61155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((G(F(p0)) U !p0)&&X(p0)&&(p0 U p0)))))'
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 655/655 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 101 transition count 652
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 652
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 100 transition count 651
Applied a total of 6 rules in 7 ms. Remains 100 /103 variables (removed 3) and now considering 651/655 (removed 4) transitions.
[2025-06-05 00:26:22] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2025-06-05 00:26:22] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:26:22] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-05 00:26:22] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:26:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:26:23] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:26:23] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2025-06-05 00:26:23] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:26:23] [INFO ] Invariant cache hit.
[2025-06-05 00:26:23] [INFO ] State equation strengthened by 517 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:30] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:30] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:30] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:30] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:31] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:31] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:31] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:31] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:31] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:32] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:32] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:32] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:32] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:33] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:33] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:33] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:33] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:34] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:34] [INFO ] Deduced a trap composed of 13 places in 349 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:34] [INFO ] Deduced a trap composed of 13 places in 315 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:35] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:35] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:35] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:35] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:35] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:35] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:36] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:36] [INFO ] Deduced a trap composed of 13 places in 337 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:36] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:37] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:37] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:37] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:37] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:37] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:38] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:38] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:38] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:38] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:40] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:40] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:43] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:43] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:43] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:43] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:44] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:44] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:44] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:44] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:44] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:44] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:44] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:45] [INFO ] Deduced a trap composed of 15 places in 288 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:47] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:48] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:48] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:48] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:48] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:48] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:48] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:49] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:49] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:49] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:49] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:49] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:49] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:49] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:52] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:52] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:52] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:52] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:53] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:53] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:53] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/742 variables, and 74 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/100 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 650/131 constraints, Known Traps: 73/73 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 73/74 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:59] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:59] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:26:59] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:00] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:00] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:00] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:00] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:01] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:01] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:01] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:01] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:01] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:04] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:04] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:05] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:10] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:10] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:10] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:13] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 100/742 variables, and 93 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/100 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 519/131 constraints, Known Traps: 92/92 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61023ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 61026ms
Starting structural reductions in LTL mode, iteration 1 : 100/103 places, 651/655 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61361 ms. Remains : 100/103 places, 651/655 transitions.
Stuttering acceptance computed with spot in 275 ms :[true, true, (NOT p0), p0, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-08
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 3 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-08 finished in 61662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F((!p1&&X((!p1&&F(G(p1))))))))'
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 655/655 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 101 transition count 652
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 652
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 100 transition count 651
Applied a total of 6 rules in 10 ms. Remains 100 /103 variables (removed 3) and now considering 651/655 (removed 4) transitions.
[2025-06-05 00:27:24] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:27:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:27:24] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-05 00:27:24] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:27:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:27:24] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:27:24] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2025-06-05 00:27:24] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:27:24] [INFO ] Invariant cache hit.
[2025-06-05 00:27:24] [INFO ] State equation strengthened by 517 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:33] [INFO ] Deduced a trap composed of 13 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-05 00:27:33] [INFO ] Deduced a trap composed of 13 places in 272 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:34] [INFO ] Deduced a trap composed of 13 places in 278 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:34] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:34] [INFO ] Deduced a trap composed of 15 places in 303 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:35] [INFO ] Deduced a trap composed of 13 places in 299 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:35] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:35] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:35] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:36] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:36] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:36] [INFO ] Deduced a trap composed of 13 places in 300 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:36] [INFO ] Deduced a trap composed of 13 places in 266 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:37] [INFO ] Deduced a trap composed of 13 places in 317 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:37] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:37] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:38] [INFO ] Deduced a trap composed of 13 places in 408 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:38] [INFO ] Deduced a trap composed of 13 places in 320 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:38] [INFO ] Deduced a trap composed of 13 places in 290 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:39] [INFO ] Deduced a trap composed of 13 places in 308 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:39] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:39] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:40] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:40] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:40] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:40] [INFO ] Deduced a trap composed of 13 places in 283 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:41] [INFO ] Deduced a trap composed of 13 places in 292 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:41] [INFO ] Deduced a trap composed of 13 places in 333 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:41] [INFO ] Deduced a trap composed of 15 places in 335 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:42] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:42] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:42] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:43] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:43] [INFO ] Deduced a trap composed of 13 places in 277 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:43] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:43] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:44] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:44] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:47] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:47] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:51] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:52] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:52] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:52] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:52] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:52] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:53] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:53] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:53] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:53] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:53] [INFO ] Deduced a trap composed of 13 places in 343 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:27:54] [INFO ] Deduced a trap composed of 15 places in 321 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/742 variables, and 53 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/100 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 650/131 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:00] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:00] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:01] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:01] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:01] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:01] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:01] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:01] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:01] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:01] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:02] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:02] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:02] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:02] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:02] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:02] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:02] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:03] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:03] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:03] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:05] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:05] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:06] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:06] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:06] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:06] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:07] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:18] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:18] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:19] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 100/742 variables, and 83 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/100 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 519/131 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61362ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 61366ms
Starting structural reductions in LTL mode, iteration 1 : 100/103 places, 651/655 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61831 ms. Remains : 100/103 places, 651/655 transitions.
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p0), true, true, true, (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-10
Stuttering criterion allowed to conclude after 61 steps with 0 reset in 3 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-10 finished in 62059 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 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 655/655 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 102 transition count 628
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 76 transition count 628
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 52 place count 76 transition count 619
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 70 place count 67 transition count 619
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 65 transition count 616
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 65 transition count 616
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 65 transition count 615
Performed 24 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 123 place count 41 transition count 582
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Iterating post reduction 3 with 254 rules applied. Total rules applied 377 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 391 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 398 place count 34 transition count 314
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 406 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 422 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 423 place count 25 transition count 297
Applied a total of 423 rules in 165 ms. Remains 25 /103 variables (removed 78) and now considering 297/655 (removed 358) transitions.
[2025-06-05 00:28:26] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2025-06-05 00:28:26] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:28:26] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-05 00:28:26] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2025-06-05 00:28:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:28:26] [INFO ] State equation strengthened by 271 read => feed constraints.
[2025-06-05 00:28:26] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:28:26] [INFO ] Redundant transitions in 10 ms returned []
Running 289 sub problems to find dead transitions.
[2025-06-05 00:28:26] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2025-06-05 00:28:26] [INFO ] Invariant cache hit.
[2025-06-05 00:28:26] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:29] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:29] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:29] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:29] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:29] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:30] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:30] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:30] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:30] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:30] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:30] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:30] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:30] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:30] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:31] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:31] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:31] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:31] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:31] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:31] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:32] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:32] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:32] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:32] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:32] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:32] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:32] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:32] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:32] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:32] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:33] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:33] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:33] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:33] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:34] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:34] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:35] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:35] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:35] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:35] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:35] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 287/312 variables, 25/67 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 270/337 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 1/313 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 313/313 variables, and 338 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/17 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:59] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:59] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:59] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:59] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:59] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:59] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:59] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:59] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:28:59] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:00] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:00] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:01] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:01] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:01] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 287/312 variables, 25/81 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 270/351 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 17/368 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (OVERLAPS) 1/313 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 369 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/17 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60858ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 60861ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/103 places, 297/655 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61304 ms. Remains : 25/103 places, 297/655 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-11
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-11 finished in 61377 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)||G(p1))))'
Support contains 9 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 655/655 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 653
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 653
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 101 transition count 652
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 101 transition count 652
Applied a total of 4 rules in 9 ms. Remains 101 /103 variables (removed 2) and now considering 652/655 (removed 3) transitions.
[2025-06-05 00:29:27] [INFO ] Flow matrix only has 642 transitions (discarded 10 similar events)
// Phase 1: matrix 642 rows 101 cols
[2025-06-05 00:29:27] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:29:27] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-05 00:29:27] [INFO ] Flow matrix only has 642 transitions (discarded 10 similar events)
[2025-06-05 00:29:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:29:28] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:29:28] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 651 sub problems to find dead transitions.
[2025-06-05 00:29:28] [INFO ] Flow matrix only has 642 transitions (discarded 10 similar events)
[2025-06-05 00:29:28] [INFO ] Invariant cache hit.
[2025-06-05 00:29:28] [INFO ] State equation strengthened by 517 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:38] [INFO ] Deduced a trap composed of 13 places in 352 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:38] [INFO ] Deduced a trap composed of 13 places in 255 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:39] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:39] [INFO ] Deduced a trap composed of 13 places in 255 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:39] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:39] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:40] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:40] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:40] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:40] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:40] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:41] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:41] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:41] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:41] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:41] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:41] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:41] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:41] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:42] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:42] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:42] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:43] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:43] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:43] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:43] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:43] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:43] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:44] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:44] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:44] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:44] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:44] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:45] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:45] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:45] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:45] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:45] [INFO ] Deduced a trap composed of 13 places in 284 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:46] [INFO ] Deduced a trap composed of 15 places in 284 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:46] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:49] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:49] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:49] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:49] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:49] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:50] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:50] [INFO ] Deduced a trap composed of 13 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-05 00:29:50] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:50] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:50] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:50] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:50] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:51] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:51] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:51] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:51] [INFO ] Deduced a trap composed of 13 places in 286 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:51] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:52] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:52] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:52] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:53] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:53] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:53] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:54] [INFO ] Deduced a trap composed of 13 places in 247 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:54] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:54] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:54] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:54] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:58] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:58] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:29:58] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 11/73 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 101/743 variables, and 73 constraints, problems are : Problem set: 0 solved, 651 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/101 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 651/132 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 651 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:05] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:05] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:05] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:05] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:05] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:06] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:06] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:06] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:07] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:07] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:13] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 11/84 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 651 unsolved
SMT process timed out in 61339ms, After SMT, problems are : Problem set: 0 solved, 651 unsolved
Search for dead transitions found 0 dead transitions in 61342ms
Starting structural reductions in LTL mode, iteration 1 : 101/103 places, 652/655 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61764 ms. Remains : 101/103 places, 652/655 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-12
Product exploration explored 100000 steps with 1923 reset in 672 ms.
Product exploration explored 100000 steps with 1923 reset in 599 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (10 resets) in 1400 ms. (28 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 701 ms. (56 steps per ms) remains 1/1 properties
[2025-06-05 00:30:31] [INFO ] Flow matrix only has 642 transitions (discarded 10 similar events)
[2025-06-05 00:30:31] [INFO ] Invariant cache hit.
[2025-06-05 00:30:31] [INFO ] State equation strengthened by 517 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
After SMT solving in domain Real declared 9/743 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/101 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p0), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 335 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Support contains 9 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 100 transition count 626
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 75 transition count 626
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 75 transition count 618
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 67 transition count 618
Performed 24 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 114 place count 43 transition count 586
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 2 with 256 rules applied. Total rules applied 370 place count 43 transition count 330
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 384 place count 36 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 391 place count 36 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 399 place count 36 transition count 308
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 415 place count 28 transition count 300
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 416 place count 28 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 27 transition count 299
Applied a total of 417 rules in 116 ms. Remains 27 /101 variables (removed 74) and now considering 299/652 (removed 353) transitions.
[2025-06-05 00:30:32] [INFO ] Flow matrix only has 289 transitions (discarded 10 similar events)
// Phase 1: matrix 289 rows 27 cols
[2025-06-05 00:30:32] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:30:33] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-05 00:30:33] [INFO ] Flow matrix only has 289 transitions (discarded 10 similar events)
[2025-06-05 00:30:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:30:33] [INFO ] State equation strengthened by 271 read => feed constraints.
[2025-06-05 00:30:33] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:30:33] [INFO ] Redundant transitions in 5 ms returned []
Running 291 sub problems to find dead transitions.
[2025-06-05 00:30:33] [INFO ] Flow matrix only has 289 transitions (discarded 10 similar events)
[2025-06-05 00:30:33] [INFO ] Invariant cache hit.
[2025-06-05 00:30:33] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 8/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:35] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:35] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:35] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:35] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:35] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:36] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:36] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:36] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:36] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:36] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:36] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:36] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:36] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:36] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:36] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:36] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:36] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:37] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:30:37] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 288/315 variables, 27/48 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 270/318 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 1/316 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/316 variables, and 319 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 291/19 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 8/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:05] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:05] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:05] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:05] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:05] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:05] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:06] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:06] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:07] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:07] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:07] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:07] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:07] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:08] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:08] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:08] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:08] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:08] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:08] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:08] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:08] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:08] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:09] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:09] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:09] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:10] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 288/315 variables, 27/74 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 19/363 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:20] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 315/316 variables, and 364 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 270/271 constraints, PredecessorRefiner: 291/19 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60556ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 60557ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/101 places, 299/652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60896 ms. Remains : 27/101 places, 299/652 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 152 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
RANDOM walk for 10932 steps (59 resets) in 471 ms. (23 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 9 factoid took 347 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 11111 reset in 1391 ms.
Product exploration explored 100000 steps with 11111 reset in 1146 ms.
Built C files in :
/tmp/ltsmin18439804945480768154
[2025-06-05 00:31:38] [INFO ] Computing symmetric may disable matrix : 299 transitions.
[2025-06-05 00:31:38] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:31:38] [INFO ] Computing symmetric may enable matrix : 299 transitions.
[2025-06-05 00:31:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:31:38] [INFO ] Computing Do-Not-Accords matrix : 299 transitions.
[2025-06-05 00:31:38] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:31:38] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18439804945480768154
Running compilation step : cd /tmp/ltsmin18439804945480768154;'/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 1997 ms.
Running link step : cd /tmp/ltsmin18439804945480768154;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18439804945480768154;'/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/stateBased3854013788873237918.hoa' '--buchi-type=spotba'
LTSmin run took 549 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-07a-LTLFireability-12 finished in 132956 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 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 655/655 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 102 transition count 628
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 76 transition count 628
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 52 place count 76 transition count 619
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 70 place count 67 transition count 619
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 65 transition count 616
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 65 transition count 616
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 65 transition count 615
Performed 24 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 123 place count 41 transition count 582
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Iterating post reduction 3 with 254 rules applied. Total rules applied 377 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 391 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 398 place count 34 transition count 314
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 406 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 422 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 423 place count 25 transition count 297
Applied a total of 423 rules in 176 ms. Remains 25 /103 variables (removed 78) and now considering 297/655 (removed 358) transitions.
[2025-06-05 00:31:41] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2025-06-05 00:31:41] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:31:41] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-05 00:31:41] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2025-06-05 00:31:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:31:41] [INFO ] State equation strengthened by 271 read => feed constraints.
[2025-06-05 00:31:41] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:31:41] [INFO ] Redundant transitions in 10 ms returned []
Running 289 sub problems to find dead transitions.
[2025-06-05 00:31:41] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2025-06-05 00:31:41] [INFO ] Invariant cache hit.
[2025-06-05 00:31:41] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:44] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:44] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:44] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:44] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:44] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:44] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:44] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:44] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:44] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:45] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:45] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:45] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:45] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:45] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:45] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:46] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:46] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:46] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:46] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:46] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:47] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:47] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:47] [INFO ] Deduced a trap composed of 4 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-05 00:31:47] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:47] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:47] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:47] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:47] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:47] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:47] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:47] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:48] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:48] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:48] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:49] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:49] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:49] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:50] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:50] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:50] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:31:50] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 287/312 variables, 25/67 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 270/337 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 1/313 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 313/313 variables, and 338 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/17 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:13] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:13] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:13] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:13] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:13] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:13] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:13] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:13] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:13] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:13] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:13] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:15] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:15] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:15] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 287/312 variables, 25/81 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 270/351 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 17/368 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (OVERLAPS) 1/313 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 369 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/17 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60884ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 60887ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/103 places, 297/655 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61321 ms. Remains : 25/103 places, 297/655 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-14
Product exploration explored 100000 steps with 11111 reset in 1091 ms.
Product exploration explored 100000 steps with 11111 reset in 1098 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 32 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2025-06-05 00:32:44] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2025-06-05 00:32:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:32:44] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-05 00:32:45] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2025-06-05 00:32:45] [INFO ] State equation strengthened by 271 read => feed constraints.
[2025-06-05 00:32:45] [INFO ] [Real]Added 271 Read/Feed constraints in 48 ms returned sat
[2025-06-05 00:32:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:32:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-05 00:32:45] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2025-06-05 00:32:45] [INFO ] [Nat]Added 271 Read/Feed constraints in 51 ms returned sat
[2025-06-05 00:32:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 23 ms.
[2025-06-05 00:32:45] [INFO ] Added : 0 causal constraints over 0 iterations in 63 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 21 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2025-06-05 00:32:45] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2025-06-05 00:32:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:32:45] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-05 00:32:45] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2025-06-05 00:32:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:32:45] [INFO ] State equation strengthened by 271 read => feed constraints.
[2025-06-05 00:32:45] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:32:45] [INFO ] Redundant transitions in 8 ms returned []
Running 289 sub problems to find dead transitions.
[2025-06-05 00:32:45] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2025-06-05 00:32:45] [INFO ] Invariant cache hit.
[2025-06-05 00:32:45] [INFO ] State equation strengthened by 271 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:47] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:47] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:47] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:47] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:47] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:48] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:48] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:48] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:48] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:48] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:48] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:48] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:48] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:48] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:48] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:49] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:49] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:49] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:49] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:49] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:49] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:49] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:49] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:50] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:50] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:50] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:50] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:50] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:50] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:50] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:50] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:50] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:50] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:50] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:52] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:52] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:52] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:52] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:52] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:52] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:32:52] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 287/312 variables, 25/67 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 270/337 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 1/313 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 313/313 variables, and 338 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/17 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 41/42 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:17] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:17] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:17] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:17] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:17] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:17] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:17] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:17] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:17] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:18] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:18] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:18] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:19] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:33:19] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 287/312 variables, 25/81 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 270/351 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 17/368 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (OVERLAPS) 1/313 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 369 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/17 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60644ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 60646ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60922 ms. Remains : 25/25 places, 297/297 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 32 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2025-06-05 00:33:46] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2025-06-05 00:33:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:33:47] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-05 00:33:47] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2025-06-05 00:33:47] [INFO ] State equation strengthened by 271 read => feed constraints.
[2025-06-05 00:33:47] [INFO ] [Real]Added 271 Read/Feed constraints in 75 ms returned sat
[2025-06-05 00:33:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 00:33:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-05 00:33:47] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2025-06-05 00:33:48] [INFO ] [Nat]Added 271 Read/Feed constraints in 77 ms returned sat
[2025-06-05 00:33:48] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 37 ms.
[2025-06-05 00:33:48] [INFO ] Added : 0 causal constraints over 0 iterations in 100 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 1284 ms.
Product exploration explored 100000 steps with 11111 reset in 1095 ms.
Built C files in :
/tmp/ltsmin3016939989522294348
[2025-06-05 00:33:50] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2025-06-05 00:33:50] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:33:50] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2025-06-05 00:33:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:33:50] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2025-06-05 00:33:50] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 00:33:50] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3016939989522294348
Running compilation step : cd /tmp/ltsmin3016939989522294348;'/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 1649 ms.
Running link step : cd /tmp/ltsmin3016939989522294348;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin3016939989522294348;'/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/stateBased4846754714073479254.hoa' '--buchi-type=spotba'
LTSmin run took 563 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-07a-LTLFireability-14 finished in 132063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(!p0)) U p0)))))'
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 655/655 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 101 transition count 652
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 652
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 100 transition count 651
Applied a total of 6 rules in 7 ms. Remains 100 /103 variables (removed 3) and now considering 651/655 (removed 4) transitions.
[2025-06-05 00:33:52] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2025-06-05 00:33:52] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:33:52] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-05 00:33:52] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:33:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:33:53] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:33:53] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2025-06-05 00:33:53] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:33:53] [INFO ] Invariant cache hit.
[2025-06-05 00:33:53] [INFO ] State equation strengthened by 517 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:02] [INFO ] Deduced a trap composed of 13 places in 290 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:03] [INFO ] Deduced a trap composed of 13 places in 331 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:03] [INFO ] Deduced a trap composed of 13 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-05 00:34:03] [INFO ] Deduced a trap composed of 13 places in 295 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:04] [INFO ] Deduced a trap composed of 15 places in 343 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:04] [INFO ] Deduced a trap composed of 13 places in 336 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:04] [INFO ] Deduced a trap composed of 13 places in 325 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:05] [INFO ] Deduced a trap composed of 13 places in 400 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:05] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:05] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:05] [INFO ] Deduced a trap composed of 13 places in 319 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:06] [INFO ] Deduced a trap composed of 13 places in 280 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:06] [INFO ] Deduced a trap composed of 13 places in 277 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:06] [INFO ] Deduced a trap composed of 13 places in 315 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:07] [INFO ] Deduced a trap composed of 13 places in 310 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:07] [INFO ] Deduced a trap composed of 13 places in 247 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:08] [INFO ] Deduced a trap composed of 13 places in 425 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:08] [INFO ] Deduced a trap composed of 13 places in 283 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:08] [INFO ] Deduced a trap composed of 13 places in 419 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:09] [INFO ] Deduced a trap composed of 13 places in 353 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:09] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:09] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:10] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:10] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:10] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:10] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:11] [INFO ] Deduced a trap composed of 13 places in 274 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:11] [INFO ] Deduced a trap composed of 13 places in 347 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:11] [INFO ] Deduced a trap composed of 15 places in 318 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:12] [INFO ] Deduced a trap composed of 15 places in 264 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:12] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:12] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:12] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:13] [INFO ] Deduced a trap composed of 13 places in 289 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:13] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:13] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:13] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:14] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:17] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:17] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:21] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:21] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:21] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:21] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:22] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:22] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:22] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:22] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:22] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:22] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:22] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:23] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/742 variables, and 53 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/100 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 650/131 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:28] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:28] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:28] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:28] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:28] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:28] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:28] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:28] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:28] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:28] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:28] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:29] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:29] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:29] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:29] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:29] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:29] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:29] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:29] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:29] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:32] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:32] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:32] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:32] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:32] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:33] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:33] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:42] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:42] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:43] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:49] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:49] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:50] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:50] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:34:50] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 100/742 variables, and 88 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/100 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 519/131 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61005ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 61007ms
Starting structural reductions in LTL mode, iteration 1 : 100/103 places, 651/655 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61331 ms. Remains : 100/103 places, 651/655 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), p0, p0]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-15
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-15 finished in 61652 ms.
All properties solved by simple procedures.
Total runtime 1162563 ms.

BK_STOP 1749083694637

--------------------
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="StigmergyCommit-PT-07a"
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 StigmergyCommit-PT-07a, 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 r226-smll-174903490700084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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