Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 141K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748974461380

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-28b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 18:14:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 18:14:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 18:14:24] [INFO ] Load time of PNML (sax parser for PT used): 240 ms
[2025-06-03 18:14:24] [INFO ] Transformed 568 places.
[2025-06-03 18:14:24] [INFO ] Transformed 597 transitions.
[2025-06-03 18:14:24] [INFO ] Found NUPN structural information;
[2025-06-03 18:14:24] [INFO ] Parsed PT model containing 568 places and 597 transitions and 1477 arcs in 483 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 568 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 568/568 places, 597/597 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 567 transition count 597
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 56 place count 512 transition count 542
Iterating global reduction 1 with 55 rules applied. Total rules applied 111 place count 512 transition count 542
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 136 place count 487 transition count 517
Iterating global reduction 1 with 25 rules applied. Total rules applied 161 place count 487 transition count 517
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 183 place count 487 transition count 495
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 184 place count 486 transition count 494
Iterating global reduction 2 with 1 rules applied. Total rules applied 185 place count 486 transition count 494
Applied a total of 185 rules in 372 ms. Remains 486 /568 variables (removed 82) and now considering 494/597 (removed 103) transitions.
// Phase 1: matrix 494 rows 486 cols
[2025-06-03 18:14:25] [INFO ] Computed 29 invariants in 41 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:14:26] [INFO ] Implicit Places using invariants in 896 ms returned []
[2025-06-03 18:14:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:14:27] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned []
Implicit Place search using SMT with State Equation took 2041 ms to find 0 implicit places.
Running 493 sub problems to find dead transitions.
[2025-06-03 18:14:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 2 (OVERLAPS) 494/979 variables, 485/514 constraints. Problems are: Problem set: 0 solved, 493 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 979/980 variables, and 514 constraints, problems are : Problem set: 0 solved, 493 unsolved in 30106 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 485/486 constraints, PredecessorRefiner: 493/493 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 493 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 2 (OVERLAPS) 494/979 variables, 485/514 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/979 variables, 493/1007 constraints. Problems are: Problem set: 0 solved, 493 unsolved
(t451 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((t0 32)
(t1 31)
(t2 30)
(t3 0)
(t4 0)
(t5 29)
(t6 0)
(t7 0)
(t8 0)
(t9 0)
(t10 0)
(t11 1)
(t12 31)
(t13 31)
(t14 1)
(t15 1)
(t16 1)
(t17 1)
(t18 1)
(t19 0)
(t20 1)
(t21 0)
(t22 30)
(t23 1)
(t24 0)
(t25 30)
(t26 29)
(t27 28)
(t28 4)
(t29 3)
(t30 2)
(t31 1)
(t32 0)
(t33 0)
(t34 0)
(t35 27)
(t36 0)
(t37 0)
(t38 0)
(t39 29)
(t40 28)
(t41 27)
(t42 26)
(t43 25)
(t44 24)
(t45 2)
(t46 1)
(t47 0)
(t48 0)
(t49 0)
(t50 0)
(t51 0)
(t52 0)
(t53 0)
(t54 28)
(t55 7)
(t56 6)
(t57 4)
(t58 3)
(t59 2)
(t60 1)
(t61 0)
(t62 0)
(t63 0)
(t64 5)
(t65 0)
(t66 0)
(t67 0)
(t68 27)
(t69 26)
(t70 25)
(t71 4)
(t72 3)
(t73 2)
(t74 1)
(t75 0)
(t76 0)
(t77 0)
(t78 24)
(t79 0)
(t80 0)
(t81 0)
(t82 26)
(t83 25)
(t84 6)
(t85 4)
(t86 3)
(t87 2)
(t88 1)
(t89 0)
(t90 0)
(t91 0)
(t92 5)
(t93 0)
(t94 0)
(t95 0)
(t96 25)
(t97 7)
(t98 6)
(t99 5)
(t100 4)
(t101 3)
(t102 2)
(t103 1)
(t104 0)
(t105 0)
(t106 0)
(t107 0)
(t108 0)
(t109 0)
(t110 0)
(t111 24)
(t112 23)
(t113 22)
(t114 4)
(t115 3)
(t116 2)
(t117 1)
(t118 0)
(t119 0)
(t120 0)
(t121 21)
(t122 0)
(t123 0)
(t124 0)
(t125 23)
(t126 7)
(t127 6)
(t128 4)
(t129 3)
(t130 2)
(t131 1)
(t132 0)
(t133 0)
(t134 0)
(t135 0)
(t136 0)
(t137 0)
(t138 5)
(t139 0)
(t140 0)
(t141 0)
(t142 22)
(t143 21)
(t144 20)
(t145 4)
(t146 3)
(t147 2)
(t148 1)
(t149 0)
(t150 0)
(t151 0)
(t152 19)
(t153 0)
(t154 0)
(t155 0)
(t156 21)
(t157 7)
(t158 6)
(t159 4)
(t160 3)
(t161 2)
(t162 1)
(t163 0)
(t164 0)
(t165 0)
(t166 5)
(t167 0)
(t168 0)
(t169 0)
(t170 20)
(t171 19)
(t172 18)
(t173 16)
(t174 3)
(t175 2)
(t176 1)
(t177 0)
(t178 0)
(t179 0)
(t180 17)
(t181 0)
(t182 0)
(t183 0)
(t184 19)
(t185 18)
(t186 17)
(t187 16)
(t188 15)
(t189 14)
(t190 2)
(t191 1)
(t192 0)
(t193 0)
(t194 0)
(t195 0)
(t196 0)
(t197 0)
(t198 0)
(t199 0)
(t200 0)
(t201 0)
(t202 18)
(t203 7)
(t204 6)
(t205 4)
(t206 3)
(t207 2)
(t208 1)
(t209 0)
(t210 0)
(t211 0)
(t212 0)
(t213 0)
(t214 5)
(t215 0)
(t216 0)
(t217 0)
(t218 17)
(t219 16)
(t220 15)
(t221 4)
(t222 3)
(t223 2)
(t224 1)
(t225 0)
(t226 0)
(t227 0)
(t228 0)
(t229 0)
(t230 14)
(t231 0)
(t232 0)
(t233 0)
(t234 16)
(t235 15)
(t236 6)
(t237 4)
(t238 3)
(t239 2)
(t240 1)
(t241 0)
(t242 0)
(t243 0)
(t244 5)
(t245 0)
(t246 0)
(t247 0)
(t248 15)
(t249 7)
(t250 6)
(t251 4)
(t252 3)
(t253 2)
(t254 1)
(t255 0)
(t256 0)
(t257 0)
(t258 5)
(t259 0)
(t260 0)
(t261 0)
(t262 14)
(t263 13)
(t264 6)
(t265 4)
(t266 3)
(t267 2)
(t268 1)
(t269 0)
(t270 0)
(t271 0)
(t272 5)
(t273 0)
(t274 0)
(t275 0)
(t276 13)
(t277 7)
(t278 6)
(t279 4)
(t280 3)
(t281 2)
(t282 1)
(t283 0)
(t284 0)
(t285 0)
(t286 5)
(t287 0)
(t288 0)
(t289 0)
(t290 12)
(t291 11)
(t292 10)
(t293 9)
(t294 8)
(t295 7)
(t296 1)
(t297 1)
(t298 0)
(t299 0)
(t300 0)
(t301 0)
(t302 0)
(t303 0)
(t304 0)
(t305 11)
(t306 5)
(t307 5)
(t308 4)
(t309 3)
(t310 2)
(t311 1)
(t312 0)
(t313 0)
(t314 0)
(t315 5)
(t316 0)
(t317 0)
(t318 0)
(t319 10)
(t320 9)
(t321 8)
(t322 7)
(t323 7)
(t324 7)
(t325 1)
(t326 0)
(t327 0)
(t328 0)
(t329 7)
(t330 0)
(t331 0)
(t332 0)
(t333 9)
(t334 8)
(t335 7)
(t336 6)
(t337 6)
(t338 6)
(t339 1)
(t340 0)
(t341 0)
(t342 0)
(t343 6)
(t344 0)
(t345 0)
(t346 0)
(t347 8)
(t348 7)
(t349 6)
(t350 4)
(t351 3)
(t352 2)
(t353 1)
(t354 0)
(t355 0)
(t356 0)
(t357 5)
(t358 0)
(t359 0)
(t360 0)
(t361 4)
(t362 2)
(t363 2)
(t364 2)
(t365 2)
(t366 2)
(t367 1)
(t368 0)
(t369 0)
(t370 0)
(t371 2)
(t372 0)
(t373 0)
(t374 0)
(t375 4)
(t376 3)
(t377 3)
(t378 3)
(t379 3)
(t380 3)
(t381 1)
(t382 0)
(t383 0)
(t384 0)
(t385 0)
(t386 0)
(t387 0)
(t388 3)
(t389 0)
(t390 0)
(t391 0)
(t392 4)
(t393 4)
(t394 4)
(t395 4)
(t396 4)
(t397 2)
(t398 1)
(t399 0)
(t400 0)
(t401 0)
(t402 4)
(t403 0)
(t404 0)
(t405 0)
(t406 4)
(t407 3)
(t408 3)
(t409 2)
(t410 2)
(t411 2)
(t412 1)
(t413 0)
(t414 0)
(t415 0)
(t416 0)
(t417 0)
(t418 0)
(t419 2)
(t420 0)
(t421 0)
(t422 0)
(t423 4)
(t424 4)
(t425 4)
(t426 4)
(t427 2)
(t428 1)
(t429 0)
(t430 0)
(t431 0)
(t432 4)
(t433 0)
(t434 0)
(t435 0)
(t436 0)
(t437 0)
(t438 0)
(t439 0)
(t440 0)
(t441 0)
(t442 0)
(t443 0)
(t444 0)
(t445 0)
(t446 0)
(t447 0)
(t448 0)
(t449 0)
(t450 0)
(t451 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 979/980 variables, and 1007 constraints, problems are : Problem set: 0 solved, 493 unsolved in 30049 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 485/486 constraints, PredecessorRefiner: 493/493 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60575ms problems are : Problem set: 0 solved, 493 unsolved
Search for dead transitions found 0 dead transitions in 60619ms
Starting structural reductions in LTL mode, iteration 1 : 486/568 places, 494/597 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63084 ms. Remains : 486/568 places, 494/597 transitions.
Support contains 32 out of 486 places after structural reductions.
[2025-06-03 18:15:28] [INFO ] Flatten gal took : 135 ms
[2025-06-03 18:15:28] [INFO ] Flatten gal took : 67 ms
[2025-06-03 18:15:28] [INFO ] Input system was already deterministic with 494 transitions.
Support contains 31 out of 486 places (down from 32) after GAL structural reductions.
RANDOM walk for 40000 steps (162 resets) in 2669 ms. (14 steps per ms) remains 2/30 properties
BEST_FIRST walk for 40002 steps (17 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
[2025-06-03 18:15:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 480/485 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/485 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 494/979 variables, 485/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/979 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/980 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/980 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/980 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 980/980 variables, and 515 constraints, problems are : Problem set: 0 solved, 2 unsolved in 943 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 486/486 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 480/485 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/485 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 494/979 variables, 485/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/979 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/979 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/980 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/980 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 980/980 variables, and 517 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1253 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 486/486 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2224ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 264 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=33 )
Parikh walk visited 2 properties in 23 ms.
Computed a total of 91 stabilizing places and 91 stable transitions
Graph (complete) has 755 edges and 486 vertex of which 454 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.28 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((p0||(p1 U (G(p1)||(p1&&G(!p0)))))) U X(p2)))))'
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 494/494 transitions.
Graph (trivial) has 402 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 749 edges and 481 vertex of which 449 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.5 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 233 transitions
Trivial Post-agglo rules discarded 233 transitions
Performed 233 trivial Post agglomeration. Transition count delta: 233
Iterating post reduction 0 with 233 rules applied. Total rules applied 235 place count 448 transition count 251
Reduce places removed 233 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 241 rules applied. Total rules applied 476 place count 215 transition count 243
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 480 place count 213 transition count 241
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 482 place count 211 transition count 241
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 60 Pre rules applied. Total rules applied 482 place count 211 transition count 181
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 602 place count 151 transition count 181
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 629 place count 124 transition count 154
Iterating global reduction 4 with 27 rules applied. Total rules applied 656 place count 124 transition count 154
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 822 place count 41 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 823 place count 41 transition count 70
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 850 place count 14 transition count 17
Iterating global reduction 5 with 27 rules applied. Total rules applied 877 place count 14 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 879 place count 13 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 880 place count 12 transition count 15
Applied a total of 880 rules in 128 ms. Remains 12 /486 variables (removed 474) and now considering 15/494 (removed 479) transitions.
// Phase 1: matrix 15 rows 12 cols
[2025-06-03 18:15:32] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:15:32] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-03 18:15:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:15:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 18:15:33] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:15:33] [INFO ] Redundant transitions in 19 ms returned []
Running 11 sub problems to find dead transitions.
[2025-06-03 18:15:33] [INFO ] Invariant cache hit.
[2025-06-03 18:15:33] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 14/24 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/27 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 13 constraints, problems are : Problem set: 0 solved, 11 unsolved in 335 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 14/24 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 2/26 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/27 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/27 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 24 constraints, problems are : Problem set: 0 solved, 11 unsolved in 310 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 655ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 656ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/486 places, 15/494 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 902 ms. Remains : 12/486 places, 15/494 transitions.
Stuttering acceptance computed with spot in 410 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), false]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-00 finished in 1456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 494/494 transitions.
Graph (trivial) has 405 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 749 edges and 481 vertex of which 449 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 239 place count 448 transition count 247
Reduce places removed 237 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 245 rules applied. Total rules applied 484 place count 211 transition count 239
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 486 place count 209 transition count 239
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 486 place count 209 transition count 179
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 606 place count 149 transition count 179
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 633 place count 122 transition count 152
Iterating global reduction 3 with 27 rules applied. Total rules applied 660 place count 122 transition count 152
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 830 place count 37 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 831 place count 37 transition count 66
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 858 place count 10 transition count 13
Iterating global reduction 4 with 27 rules applied. Total rules applied 885 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 887 place count 9 transition count 12
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 888 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 889 place count 8 transition count 11
Applied a total of 889 rules in 51 ms. Remains 8 /486 variables (removed 478) and now considering 11/494 (removed 483) transitions.
[2025-06-03 18:15:34] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 8 cols
[2025-06-03 18:15:34] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:15:34] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-03 18:15:34] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2025-06-03 18:15:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:15:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 18:15:34] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:15:34] [INFO ] Redundant transitions in 15 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-03 18:15:34] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2025-06-03 18:15:34] [INFO ] Invariant cache hit.
[2025-06-03 18:15:34] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/17 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/18 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 9 constraints, problems are : Problem set: 0 solved, 6 unsolved in 115 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/17 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/18 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 201 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 321ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 321ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/486 places, 11/494 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 465 ms. Remains : 8/486 places, 11/494 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-01
Stuttering criterion allowed to conclude after 9 steps with 2 reset in 1 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-01 finished in 532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 494/494 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 477 transition count 485
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 477 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 477 transition count 484
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 473 transition count 480
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 473 transition count 480
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 473 transition count 476
Applied a total of 31 rules in 75 ms. Remains 473 /486 variables (removed 13) and now considering 476/494 (removed 18) transitions.
// Phase 1: matrix 476 rows 473 cols
[2025-06-03 18:15:34] [INFO ] Computed 29 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:15:35] [INFO ] Implicit Places using invariants in 330 ms returned []
[2025-06-03 18:15:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:15:35] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1211 ms to find 0 implicit places.
Running 475 sub problems to find dead transitions.
[2025-06-03 18:15:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 2 (OVERLAPS) 476/948 variables, 472/501 constraints. Problems are: Problem set: 0 solved, 475 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 948/949 variables, and 501 constraints, problems are : Problem set: 0 solved, 475 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/473 constraints, PredecessorRefiner: 475/475 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 475 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 2 (OVERLAPS) 476/948 variables, 472/501 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/948 variables, 475/976 constraints. Problems are: Problem set: 0 solved, 475 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: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 948/949 variables, and 976 constraints, problems are : Problem set: 0 solved, 475 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/473 constraints, PredecessorRefiner: 475/475 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60254ms problems are : Problem set: 0 solved, 475 unsolved
Search for dead transitions found 0 dead transitions in 60258ms
Starting structural reductions in LTL mode, iteration 1 : 473/486 places, 476/494 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61547 ms. Remains : 473/486 places, 476/494 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-02 finished in 61765 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((F(p0) U p1)))||p1)) U p2))'
Support contains 4 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 494/494 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 477 transition count 485
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 477 transition count 485
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 477 transition count 483
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 473 transition count 479
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 473 transition count 479
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 32 place count 473 transition count 475
Applied a total of 32 rules in 76 ms. Remains 473 /486 variables (removed 13) and now considering 475/494 (removed 19) transitions.
// Phase 1: matrix 475 rows 473 cols
[2025-06-03 18:16:36] [INFO ] Computed 29 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:16:36] [INFO ] Implicit Places using invariants in 317 ms returned []
[2025-06-03 18:16:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:16:37] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
Running 474 sub problems to find dead transitions.
[2025-06-03 18:16:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (OVERLAPS) 475/947 variables, 472/501 constraints. Problems are: Problem set: 0 solved, 474 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 947/948 variables, and 501 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/473 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 474 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (OVERLAPS) 475/947 variables, 472/501 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/947 variables, 474/975 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 947/948 variables, and 975 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/473 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 474 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in LTL mode, iteration 1 : 473/486 places, 475/494 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61258 ms. Remains : 473/486 places, 475/494 transitions.
Stuttering acceptance computed with spot in 333 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-05
Product exploration explored 100000 steps with 1595 reset in 554 ms.
Product exploration explored 100000 steps with 1603 reset in 403 ms.
Computed a total of 88 stabilizing places and 88 stable transitions
Graph (complete) has 736 edges and 473 vertex of which 441 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.9 ms
Computed a total of 88 stabilizing places and 88 stable transitions
Detected a total of 88/473 stabilizing places and 88/475 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 261 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p0)]
RANDOM walk for 25579 steps (106 resets) in 239 ms. (106 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 6 factoid took 397 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p0)]
[2025-06-03 18:17:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:17:41] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 27 ms returned sat
[2025-06-03 18:17:41] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2025-06-03 18:17:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:17:42] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 24 ms returned sat
[2025-06-03 18:17:43] [INFO ] [Nat]Absence check using state equation in 1309 ms returned sat
[2025-06-03 18:17:43] [INFO ] Computed and/alt/rep : 469/615/469 causal constraints (skipped 5 transitions) in 38 ms.
[2025-06-03 18:17:51] [INFO ] Added : 443 causal constraints over 89 iterations in 7365 ms. Result :sat
Could not prove EG (NOT p1)
[2025-06-03 18:17:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 6 factoid took 428 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-28b-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-05 finished in 75621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 494/494 transitions.
Graph (trivial) has 403 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 749 edges and 481 vertex of which 449 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 233 transitions
Trivial Post-agglo rules discarded 233 transitions
Performed 233 trivial Post agglomeration. Transition count delta: 233
Iterating post reduction 0 with 233 rules applied. Total rules applied 235 place count 448 transition count 251
Reduce places removed 233 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 240 rules applied. Total rules applied 475 place count 215 transition count 244
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 478 place count 213 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 479 place count 212 transition count 243
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 59 Pre rules applied. Total rules applied 479 place count 212 transition count 184
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 597 place count 153 transition count 184
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 624 place count 126 transition count 157
Iterating global reduction 4 with 27 rules applied. Total rules applied 651 place count 126 transition count 157
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 823 place count 40 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 824 place count 40 transition count 70
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 850 place count 14 transition count 19
Iterating global reduction 5 with 26 rules applied. Total rules applied 876 place count 14 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 880 place count 12 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 881 place count 11 transition count 17
Applied a total of 881 rules in 57 ms. Remains 11 /486 variables (removed 475) and now considering 17/494 (removed 477) transitions.
[2025-06-03 18:17:52] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 11 cols
[2025-06-03 18:17:52] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:17:52] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-03 18:17:52] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2025-06-03 18:17:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:17:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 18:17:52] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:17:52] [INFO ] Redundant transitions in 17 ms returned []
Running 10 sub problems to find dead transitions.
[2025-06-03 18:17:52] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2025-06-03 18:17:52] [INFO ] Invariant cache hit.
[2025-06-03 18:17:52] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 15/23 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 3/26 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1/27 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 12 constraints, problems are : Problem set: 0 solved, 10 unsolved in 343 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 15/23 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 3/26 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/27 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/27 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 319 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 668ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 668ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/486 places, 17/494 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 831 ms. Remains : 11/486 places, 17/494 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-06 finished in 1005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U X(p1))||X(X(X(p2)))))))'
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 494/494 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 476 transition count 484
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 476 transition count 484
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 476 transition count 482
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 472 transition count 478
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 472 transition count 478
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 34 place count 472 transition count 474
Applied a total of 34 rules in 56 ms. Remains 472 /486 variables (removed 14) and now considering 474/494 (removed 20) transitions.
// Phase 1: matrix 474 rows 472 cols
[2025-06-03 18:17:53] [INFO ] Computed 29 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:17:53] [INFO ] Implicit Places using invariants in 309 ms returned []
[2025-06-03 18:17:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:17:54] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2025-06-03 18:17:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 945/946 variables, and 500 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 471/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 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: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 945/946 variables, and 973 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 471/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in LTL mode, iteration 1 : 472/486 places, 474/494 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61492 ms. Remains : 472/486 places, 474/494 transitions.
Stuttering acceptance computed with spot in 700 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-07 finished in 62237 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(p1)))&&(p2 U p3)))'
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 494/494 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 477 transition count 485
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 477 transition count 485
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 477 transition count 483
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 474 transition count 480
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 474 transition count 480
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 29 place count 474 transition count 477
Applied a total of 29 rules in 49 ms. Remains 474 /486 variables (removed 12) and now considering 477/494 (removed 17) transitions.
// Phase 1: matrix 477 rows 474 cols
[2025-06-03 18:18:55] [INFO ] Computed 29 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:18:55] [INFO ] Implicit Places using invariants in 321 ms returned []
[2025-06-03 18:18:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:18:56] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
Running 476 sub problems to find dead transitions.
[2025-06-03 18:18:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 476 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 950/951 variables, and 502 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/474 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 476 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 476/978 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 950/951 variables, and 978 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/474 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 476 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in LTL mode, iteration 1 : 474/486 places, 477/494 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61445 ms. Remains : 474/486 places, 477/494 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p3) (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (NOT p3), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-08
Product exploration explored 100000 steps with 5948 reset in 253 ms.
Product exploration explored 100000 steps with 5830 reset in 424 ms.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 738 edges and 474 vertex of which 442 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.9 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Detected a total of 87/474 stabilizing places and 87/477 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) p2 p0 p1), (X p2), (X (NOT p3)), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT p3))), (X (X (AND (NOT p3) p2))), (X (X p1)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 172 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
RANDOM walk for 40000 steps (166 resets) in 305 ms. (130 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (21 resets) in 175 ms. (227 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (20 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
[2025-06-03 18:19:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 370/372 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 101/473 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/951 variables, 1/503 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/951 variables, 0/503 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/951 variables, 0/503 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 951/951 variables, and 503 constraints, problems are : Problem set: 1 solved, 2 unsolved in 655 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 370/372 variables, 22/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 101/473 variables, 7/29 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 2/504 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/950 variables, 0/504 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/951 variables, 1/505 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/951 variables, 0/505 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/951 variables, 0/505 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 951/951 variables, and 505 constraints, problems are : Problem set: 1 solved, 2 unsolved in 633 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1297ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 134 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=67 )
Parikh walk visited 2 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) p2 p0 p1), (X p2), (X (NOT p3)), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT p3))), (X (X (AND (NOT p3) p2))), (X (X p1)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (F (OR (G p3) (G (NOT p3)))), (G (OR p2 (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR p2 p3))), (F (NOT (AND p2 (NOT p3)))), (F (NOT p2)), (F p3)]
Knowledge based reduction with 13 factoid took 314 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 106 ms :[true, (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3))]
[2025-06-03 18:20:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:20:00] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 20 ms returned sat
[2025-06-03 18:20:01] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2025-06-03 18:20:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:20:01] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 26 ms returned sat
[2025-06-03 18:20:02] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2025-06-03 18:20:02] [INFO ] Computed and/alt/rep : 471/619/471 causal constraints (skipped 5 transitions) in 47 ms.
[2025-06-03 18:20:03] [INFO ] Added : 96 causal constraints over 20 iterations in 1034 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 2 out of 474 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 477/477 transitions.
Graph (trivial) has 387 edges and 474 vertex of which 6 / 474 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 732 edges and 469 vertex of which 437 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 225 transitions
Trivial Post-agglo rules discarded 225 transitions
Performed 225 trivial Post agglomeration. Transition count delta: 225
Iterating post reduction 0 with 225 rules applied. Total rules applied 227 place count 436 transition count 242
Reduce places removed 225 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 226 rules applied. Total rules applied 453 place count 211 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 454 place count 210 transition count 241
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 454 place count 210 transition count 183
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 570 place count 152 transition count 183
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 597 place count 125 transition count 156
Iterating global reduction 3 with 27 rules applied. Total rules applied 624 place count 125 transition count 156
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 792 place count 41 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 793 place count 41 transition count 71
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 819 place count 15 transition count 20
Iterating global reduction 4 with 26 rules applied. Total rules applied 845 place count 15 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 849 place count 13 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 850 place count 12 transition count 18
Applied a total of 850 rules in 45 ms. Remains 12 /474 variables (removed 462) and now considering 18/477 (removed 459) transitions.
[2025-06-03 18:20:03] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 12 cols
[2025-06-03 18:20:03] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:20:03] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-03 18:20:03] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2025-06-03 18:20:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:20:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 18:20:03] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:20:03] [INFO ] Redundant transitions in 20 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-03 18:20:03] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2025-06-03 18:20:03] [INFO ] Invariant cache hit.
[2025-06-03 18:20:03] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 16/26 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1/29 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 13 constraints, problems are : Problem set: 0 solved, 14 unsolved in 401 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 16/26 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 2/28 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/29 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/29 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 27 constraints, problems are : Problem set: 0 solved, 14 unsolved in 365 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 772ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 774ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/474 places, 18/477 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 926 ms. Remains : 12/474 places, 18/477 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/12 stabilizing places and 4/18 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p3)), (X p2), (X (X p2)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p2 p3)), (X (NOT (AND p2 p3))), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p2 p3))), (X (X (NOT (AND p2 p3)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3)))))]
Knowledge based reduction with 4 factoid took 524 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3))]
RANDOM walk for 162 steps (14 resets) in 8 ms. (18 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 (NOT p3)), (X p2), (X (X p2)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p2 p3)), (X (NOT (AND p2 p3))), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p2 p3))), (X (X (NOT (AND p2 p3)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (F (NOT (AND p2 (NOT p3)))), (F p3), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 722 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 119 ms :[true, (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3))]
[2025-06-03 18:20:05] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2025-06-03 18:20:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:20:05] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 18:20:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 18:20:05] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 18:20:05] [INFO ] Computed and/alt/rep : 13/30/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 18:20:05] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 120 ms :[true, (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3))]
Stuttering criterion allowed to conclude after 3 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-08 finished in 70664 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 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 494/494 transitions.
Graph (trivial) has 404 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 749 edges and 481 vertex of which 449 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 240 place count 448 transition count 246
Reduce places removed 238 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 246 rules applied. Total rules applied 486 place count 210 transition count 238
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 488 place count 208 transition count 238
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 488 place count 208 transition count 179
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 606 place count 149 transition count 179
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 633 place count 122 transition count 152
Iterating global reduction 3 with 27 rules applied. Total rules applied 660 place count 122 transition count 152
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 832 place count 36 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 833 place count 36 transition count 65
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 860 place count 9 transition count 11
Iterating global reduction 4 with 27 rules applied. Total rules applied 887 place count 9 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 889 place count 7 transition count 9
Applied a total of 889 rules in 35 ms. Remains 7 /486 variables (removed 479) and now considering 9/494 (removed 485) transitions.
// Phase 1: matrix 9 rows 7 cols
[2025-06-03 18:20:06] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:20:06] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-03 18:20:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:20:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 18:20:06] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:20:06] [INFO ] Redundant transitions in 19 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-03 18:20:06] [INFO ] Invariant cache hit.
[2025-06-03 18:20:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/15 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 8 constraints, problems are : Problem set: 0 solved, 6 unsolved in 167 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/15 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/16 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/16 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 14 constraints, problems are : Problem set: 0 solved, 6 unsolved in 183 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 356ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 356ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/486 places, 9/494 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 486 ms. Remains : 7/486 places, 9/494 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-09 finished in 597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||(((p1 U (p2||G(p1))) U p3) U p4)))'
Support contains 4 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 494/494 transitions.
Graph (trivial) has 399 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 749 edges and 481 vertex of which 449 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 231 transitions
Trivial Post-agglo rules discarded 231 transitions
Performed 231 trivial Post agglomeration. Transition count delta: 231
Iterating post reduction 0 with 231 rules applied. Total rules applied 233 place count 448 transition count 253
Reduce places removed 231 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 239 rules applied. Total rules applied 472 place count 217 transition count 245
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 475 place count 215 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 476 place count 214 transition count 244
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 60 Pre rules applied. Total rules applied 476 place count 214 transition count 184
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 596 place count 154 transition count 184
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 623 place count 127 transition count 157
Iterating global reduction 4 with 27 rules applied. Total rules applied 650 place count 127 transition count 157
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 818 place count 43 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 819 place count 43 transition count 72
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 844 place count 18 transition count 23
Iterating global reduction 5 with 25 rules applied. Total rules applied 869 place count 18 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 871 place count 17 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 872 place count 17 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 873 place count 16 transition count 21
Applied a total of 873 rules in 51 ms. Remains 16 /486 variables (removed 470) and now considering 21/494 (removed 473) transitions.
// Phase 1: matrix 21 rows 16 cols
[2025-06-03 18:20:06] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:20:06] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-03 18:20:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:20:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 18:20:06] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:20:06] [INFO ] Redundant transitions in 19 ms returned []
Running 13 sub problems to find dead transitions.
[2025-06-03 18:20:06] [INFO ] Invariant cache hit.
[2025-06-03 18:20:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 20/31 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 5/36 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1/37 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 17 constraints, problems are : Problem set: 0 solved, 13 unsolved in 492 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 20/31 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 5/36 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 30 constraints, problems are : Problem set: 0 solved, 13 unsolved in 454 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 952ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 952ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/486 places, 21/494 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1161 ms. Remains : 16/486 places, 21/494 transitions.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p4)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-11
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-11 finished in 1421 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 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 494/494 transitions.
Graph (trivial) has 405 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 749 edges and 481 vertex of which 449 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 236 transitions
Trivial Post-agglo rules discarded 236 transitions
Performed 236 trivial Post agglomeration. Transition count delta: 236
Iterating post reduction 0 with 236 rules applied. Total rules applied 238 place count 448 transition count 248
Reduce places removed 236 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 244 rules applied. Total rules applied 482 place count 212 transition count 240
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 484 place count 210 transition count 240
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 484 place count 210 transition count 179
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 606 place count 149 transition count 179
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 633 place count 122 transition count 152
Iterating global reduction 3 with 27 rules applied. Total rules applied 660 place count 122 transition count 152
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 830 place count 37 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 831 place count 37 transition count 66
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 859 place count 9 transition count 11
Iterating global reduction 4 with 28 rules applied. Total rules applied 887 place count 9 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 889 place count 8 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 890 place count 7 transition count 9
Applied a total of 890 rules in 36 ms. Remains 7 /486 variables (removed 479) and now considering 9/494 (removed 485) transitions.
// Phase 1: matrix 9 rows 7 cols
[2025-06-03 18:20:08] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:20:08] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-03 18:20:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:20:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 18:20:08] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:20:08] [INFO ] Redundant transitions in 17 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-03 18:20:08] [INFO ] Invariant cache hit.
[2025-06-03 18:20:08] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 8 constraints, problems are : Problem set: 0 solved, 5 unsolved in 159 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 13 constraints, problems are : Problem set: 0 solved, 5 unsolved in 141 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 306ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 306ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/486 places, 9/494 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 430 ms. Remains : 7/486 places, 9/494 transitions.
Stuttering acceptance computed with spot in 93 ms :[p0, p0]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-12 finished in 540 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 4 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 494/494 transitions.
Graph (trivial) has 401 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 749 edges and 481 vertex of which 449 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 236 transitions
Trivial Post-agglo rules discarded 236 transitions
Performed 236 trivial Post agglomeration. Transition count delta: 236
Iterating post reduction 0 with 236 rules applied. Total rules applied 238 place count 448 transition count 248
Reduce places removed 236 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 242 rules applied. Total rules applied 480 place count 212 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 481 place count 211 transition count 242
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 481 place count 211 transition count 184
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 597 place count 153 transition count 184
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 623 place count 127 transition count 158
Iterating global reduction 3 with 26 rules applied. Total rules applied 649 place count 127 transition count 158
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 817 place count 43 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 818 place count 43 transition count 73
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 844 place count 17 transition count 22
Iterating global reduction 4 with 26 rules applied. Total rules applied 870 place count 17 transition count 22
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 876 place count 14 transition count 21
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 878 place count 14 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 879 place count 13 transition count 20
Applied a total of 879 rules in 33 ms. Remains 13 /486 variables (removed 473) and now considering 20/494 (removed 474) transitions.
[2025-06-03 18:20:08] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 13 cols
[2025-06-03 18:20:08] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:20:08] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-03 18:20:08] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2025-06-03 18:20:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:20:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 18:20:08] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:20:08] [INFO ] Redundant transitions in 20 ms returned []
Running 18 sub problems to find dead transitions.
[2025-06-03 18:20:08] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2025-06-03 18:20:08] [INFO ] Invariant cache hit.
[2025-06-03 18:20:08] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 14 constraints, problems are : Problem set: 0 solved, 18 unsolved in 509 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 32 constraints, problems are : Problem set: 0 solved, 18 unsolved in 612 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1145ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 1145ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/486 places, 20/494 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1274 ms. Remains : 13/486 places, 20/494 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-13
Product exploration explored 100000 steps with 7924 reset in 506 ms.
Product exploration explored 100000 steps with 7918 reset in 406 ms.
Computed a total of 4 stabilizing places and 8 stable transitions
Computed a total of 4 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 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 100 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1953 steps (148 resets) in 8 ms. (217 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 145 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 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2025-06-03 18:20:11] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2025-06-03 18:20:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:20:11] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-03 18:20:11] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2025-06-03 18:20:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:20:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 18:20:11] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:20:11] [INFO ] Redundant transitions in 15 ms returned []
Running 18 sub problems to find dead transitions.
[2025-06-03 18:20:11] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2025-06-03 18:20:11] [INFO ] Invariant cache hit.
[2025-06-03 18:20:11] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 14 constraints, problems are : Problem set: 0 solved, 18 unsolved in 443 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 32 constraints, problems are : Problem set: 0 solved, 18 unsolved in 474 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 924ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 924ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1016 ms. Remains : 13/13 places, 20/20 transitions.
Computed a total of 4 stabilizing places and 8 stable transitions
Computed a total of 4 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 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 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 11456 steps (1034 resets) in 37 ms. (301 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7881 reset in 121 ms.
Product exploration explored 100000 steps with 7839 reset in 421 ms.
Built C files in :
/tmp/ltsmin8844065122493352158
[2025-06-03 18:20:13] [INFO ] Computing symmetric may disable matrix : 20 transitions.
[2025-06-03 18:20:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:20:13] [INFO ] Computing symmetric may enable matrix : 20 transitions.
[2025-06-03 18:20:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:20:13] [INFO ] Computing Do-Not-Accords matrix : 20 transitions.
[2025-06-03 18:20:13] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 18:20:13] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8844065122493352158
Running compilation step : cd /tmp/ltsmin8844065122493352158;'/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 462 ms.
Running link step : cd /tmp/ltsmin8844065122493352158;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin8844065122493352158;'/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/stateBased14902713951409727366.hoa' '--buchi-type=spotba'
LTSmin run took 2216 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-13 finished in 7762 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&&G(p1))))'
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 494/494 transitions.
Graph (trivial) has 404 edges and 486 vertex of which 6 / 486 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 749 edges and 481 vertex of which 449 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 237 place count 448 transition count 249
Reduce places removed 235 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 242 rules applied. Total rules applied 479 place count 213 transition count 242
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 482 place count 211 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 483 place count 210 transition count 241
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 483 place count 210 transition count 183
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 599 place count 152 transition count 183
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 626 place count 125 transition count 156
Iterating global reduction 4 with 27 rules applied. Total rules applied 653 place count 125 transition count 156
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 825 place count 39 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 826 place count 39 transition count 69
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 852 place count 13 transition count 18
Iterating global reduction 5 with 26 rules applied. Total rules applied 878 place count 13 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 882 place count 11 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 883 place count 10 transition count 16
Applied a total of 883 rules in 21 ms. Remains 10 /486 variables (removed 476) and now considering 16/494 (removed 478) transitions.
[2025-06-03 18:20:16] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 10 cols
[2025-06-03 18:20:16] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:20:16] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-03 18:20:16] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2025-06-03 18:20:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:20:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 18:20:16] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:20:16] [INFO ] Redundant transitions in 15 ms returned []
Running 9 sub problems to find dead transitions.
[2025-06-03 18:20:16] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2025-06-03 18:20:16] [INFO ] Invariant cache hit.
[2025-06-03 18:20:16] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/21 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/24 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/25 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 11 constraints, problems are : Problem set: 0 solved, 9 unsolved in 269 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/21 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/24 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/25 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 20 constraints, problems are : Problem set: 0 solved, 9 unsolved in 234 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 510ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 510ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/486 places, 16/494 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 680 ms. Remains : 10/486 places, 16/494 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-14 finished in 778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(G(p1)))) U p2)))'
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 486/486 places, 494/494 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 478 transition count 486
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 478 transition count 486
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 478 transition count 484
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 475 transition count 481
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 475 transition count 481
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 475 transition count 478
Applied a total of 27 rules in 42 ms. Remains 475 /486 variables (removed 11) and now considering 478/494 (removed 16) transitions.
// Phase 1: matrix 478 rows 475 cols
[2025-06-03 18:20:17] [INFO ] Computed 29 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:20:17] [INFO ] Implicit Places using invariants in 290 ms returned []
[2025-06-03 18:20:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:20:18] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
Running 477 sub problems to find dead transitions.
[2025-06-03 18:20:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 952/953 variables, and 503 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/475 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/952 variables, 477/980 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 952/953 variables, and 980 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/475 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Starting structural reductions in LTL mode, iteration 1 : 475/486 places, 478/494 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61316 ms. Remains : 475/486 places, 478/494 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-15
Product exploration explored 100000 steps with 449 reset in 265 ms.
Product exploration explored 100000 steps with 449 reset in 639 ms.
Computed a total of 88 stabilizing places and 88 stable transitions
Graph (complete) has 739 edges and 475 vertex of which 443 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.6 ms
Computed a total of 88 stabilizing places and 88 stable transitions
Detected a total of 88/475 stabilizing places and 88/478 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (AND (NOT p2) p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (AND (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 176 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
RANDOM walk for 40000 steps (166 resets) in 163 ms. (243 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (19 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (17 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (18 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
[2025-06-03 18:21:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 83/86 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 388/474 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/953 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/953 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/953 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 953/953 variables, and 504 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1085 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 83/86 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 388/474 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 3/506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/953 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/953 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/953 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 953/953 variables, and 507 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1123 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2221ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 332 ms.
Support contains 3 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 478/478 transitions.
Graph (trivial) has 386 edges and 475 vertex of which 6 / 475 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 732 edges and 470 vertex of which 438 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 228 rules applied. Total rules applied 230 place count 438 transition count 240
Reduce places removed 226 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 227 rules applied. Total rules applied 457 place count 212 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 458 place count 211 transition count 239
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 458 place count 211 transition count 181
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 574 place count 153 transition count 181
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 603 place count 124 transition count 152
Iterating global reduction 3 with 29 rules applied. Total rules applied 632 place count 124 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 632 place count 124 transition count 151
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 634 place count 123 transition count 151
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 800 place count 40 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 107 edges and 40 vertex of which 39 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 802 place count 39 transition count 67
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 805 place count 39 transition count 64
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 830 place count 14 transition count 14
Iterating global reduction 5 with 25 rules applied. Total rules applied 855 place count 14 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 860 place count 11 transition count 12
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 15 edges and 11 vertex of which 10 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 3 rules applied. Total rules applied 863 place count 10 transition count 10
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 864 place count 10 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 865 place count 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 866 place count 8 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 866 place count 8 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 870 place count 6 transition count 6
Applied a total of 870 rules in 34 ms. Remains 6 /475 variables (removed 469) and now considering 6/478 (removed 472) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 6/475 places, 6/478 transitions.
RANDOM walk for 28 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (AND (NOT p2) p0)), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (AND (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 11 factoid took 632 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 198 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
[2025-06-03 18:21:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:21:24] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 24 ms returned sat
[2025-06-03 18:21:26] [INFO ] [Real]Absence check using state equation in 1876 ms returned sat
[2025-06-03 18:21:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:21:26] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 17 ms returned sat
[2025-06-03 18:21:26] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2025-06-03 18:21:26] [INFO ] Computed and/alt/rep : 472/620/472 causal constraints (skipped 5 transitions) in 53 ms.
[2025-06-03 18:21:35] [INFO ] Added : 300 causal constraints over 62 iterations in 8514 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 478/478 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 478/478 (removed 0) transitions.
[2025-06-03 18:21:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:21:35] [INFO ] Implicit Places using invariants in 273 ms returned []
[2025-06-03 18:21:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:21:36] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
Running 477 sub problems to find dead transitions.
[2025-06-03 18:21:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 477 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 952/953 variables, and 503 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/475 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/952 variables, 477/980 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 0)
(s26 0)
(s27 1)
(s28 1)
(s29 1)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 2)
(s43 1)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 1)
(s54 1)
(s55 2)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 0)
(s72 0)
(s73 3)
(s74 0)
(s75 1)
(s76 1)
(s77 0)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 5)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 1)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 1)
(s107 0)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 1)
(s130 1)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 6)
(s136 1)
(s137 0)
(s138 0)
(s139 1)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 2)
(s150 1)
(s151 1)
(s152 0)
(s153 0)
(s154 1)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 3)
(s165 1)
(s166 1)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 5)
(s180 1)
(s181 5)
(s182 0)
(s183 0)
(s184 1)
(s185 1)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 6)
(s197 0)
(s198 0)
(s199 1)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 0)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 8)
(s226 9)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 0)
(s243 0)
(s244 1)
(s245 1)
(s246 1)
(s247 0)
(s248 0)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 8)
(s256 1)
(s257 0)
(s258 0)
(s259 1)
(s260 1)
(s261 0)
(s262 0)
(s263 0)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 10)
(s269 1)
(s270 1)
(s271 12)
(s272 0)
(s273 0)
(s274 1)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 13)
(s301 1)
(s302 0)
(s303 0)
(s304 1)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 13)
(s315 1)
(s316 1)
(s317 0)
(s318 0)
(s319 1)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 14)
(s330 1)
(s331 1)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 16)
(s346 1)
(s347 0)
(s348 0)
(s349 1)
(s350 1)
(s351 0)
(s352 0)
(s353 0)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 16)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 18)
(s377 1)
(s378 1)
(s379 0)
(s380 1)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 19)
(s392 1)
(s393 1)
(s394 0)
(s395 1)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 20)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 0)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 16)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 0)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 17)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 0)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 18)
(s450 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 Int declared 952/953 variables, and 980 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/475 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Finished structural reductions in LTL mode , in 1 iterations and 61226 ms. Remains : 475/475 places, 478/478 transitions.
Computed a total of 88 stabilizing places and 88 stable transitions
Graph (complete) has 739 edges and 475 vertex of which 443 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Computed a total of 88 stabilizing places and 88 stable transitions
Detected a total of 88/475 stabilizing places and 88/478 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 235 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
RANDOM walk for 40000 steps (165 resets) in 190 ms. (209 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (18 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
[2025-06-03 18:22:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 404/474 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/953 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/953 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/953 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 953/953 variables, and 504 constraints, problems are : Problem set: 0 solved, 2 unsolved in 531 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 404/474 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 2/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/953 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/953 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/953 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 953/953 variables, and 506 constraints, problems are : Problem set: 0 solved, 2 unsolved in 865 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1405ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 655 steps, including 1 resets, run visited all 2 properties in 7 ms. (steps per millisecond=93 )
Parikh walk visited 2 properties in 7 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 11 factoid took 588 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 176 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
[2025-06-03 18:22:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:22:39] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 18 ms returned sat
[2025-06-03 18:22:41] [INFO ] [Real]Absence check using state equation in 1831 ms returned sat
[2025-06-03 18:22:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 18:22:41] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 24 ms returned sat
[2025-06-03 18:22:42] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2025-06-03 18:22:42] [INFO ] Computed and/alt/rep : 472/620/472 causal constraints (skipped 5 transitions) in 34 ms.
[2025-06-03 18:22:49] [INFO ] Added : 300 causal constraints over 62 iterations in 6895 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 239 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 448 reset in 276 ms.
Entered a terminal (fully accepting) state of product in 55825 steps with 250 reset in 293 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-15 finished in 153072 ms.
All properties solved by simple procedures.
Total runtime 506113 ms.

BK_STOP 1748974970205

--------------------
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="GPUForwardProgress-PT-28b"
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 GPUForwardProgress-PT-28b, 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 r100-smll-174867008000484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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