fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r226-smll-174903490900170
Last Updated
June 24, 2025

About the Execution of ITS-Tools for StigmergyElection-PT-02b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 900106.00 0.00 0.00 FFTTTFFFFFFFFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490900170.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 StigmergyElection-PT-02b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490900170
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 71K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749134347243

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-05 14:39:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 14:39:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 14:39:09] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2025-06-05 14:39:10] [INFO ] Transformed 291 places.
[2025-06-05 14:39:10] [INFO ] Transformed 332 transitions.
[2025-06-05 14:39:10] [INFO ] Found NUPN structural information;
[2025-06-05 14:39:10] [INFO ] Parsed PT model containing 291 places and 332 transitions and 734 arcs in 434 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Support contains 102 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 332/332 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 271 transition count 312
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 271 transition count 312
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 267 transition count 308
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 267 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 266 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 266 transition count 307
Applied a total of 50 rules in 108 ms. Remains 266 /291 variables (removed 25) and now considering 307/332 (removed 25) transitions.
// Phase 1: matrix 307 rows 266 cols
[2025-06-05 14:39:10] [INFO ] Computed 3 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:39:10] [INFO ] Implicit Places using invariants in 463 ms returned []
[2025-06-05 14:39:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:39:11] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2025-06-05 14:39:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:39:19] [INFO ] Deduced a trap composed of 173 places in 250 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:39:19] [INFO ] Deduced a trap composed of 173 places in 194 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:39:19] [INFO ] Deduced a trap composed of 103 places in 166 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:39:20] [INFO ] Deduced a trap composed of 202 places in 190 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:39:21] [INFO ] Deduced a trap composed of 176 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:39:21] [INFO ] Deduced a trap composed of 174 places in 179 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:39:22] [INFO ] Deduced a trap composed of 181 places in 180 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:39:22] [INFO ] Deduced a trap composed of 181 places in 167 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:39:24] [INFO ] Deduced a trap composed of 202 places in 220 ms of which 31 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:39:31] [INFO ] Deduced a trap composed of 183 places in 188 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (OVERLAPS) 307/573 variables, 266/279 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 279 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/266 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 307/573 variables, 266/279 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 306/585 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:40:02] [INFO ] Deduced a trap along path composed of 3 places in 49 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/573 variables, and 586 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Starting structural reductions in LTL mode, iteration 1 : 266/291 places, 307/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61243 ms. Remains : 266/291 places, 307/332 transitions.
Support contains 102 out of 266 places after structural reductions.
[2025-06-05 14:40:11] [INFO ] Flatten gal took : 94 ms
[2025-06-05 14:40:11] [INFO ] Flatten gal took : 39 ms
[2025-06-05 14:40:12] [INFO ] Input system was already deterministic with 307 transitions.
RANDOM walk for 40000 steps (554 resets) in 3436 ms. (11 steps per ms) remains 13/91 properties
BEST_FIRST walk for 40001 steps (210 resets) in 591 ms. (67 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40002 steps (173 resets) in 243 ms. (163 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (197 resets) in 191 ms. (208 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (185 resets) in 197 ms. (202 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (196 resets) in 143 ms. (277 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (199 resets) in 132 ms. (300 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (263 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (151 resets) in 269 ms. (148 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (256 resets) in 136 ms. (291 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (161 resets) in 111 ms. (357 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40001 steps (108 resets) in 197 ms. (202 steps per ms) remains 9/9 properties
[2025-06-05 14:40:14] [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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp79 is UNSAT
At refinement iteration 1 (OVERLAPS) 248/266 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 307/573 variables, 266/269 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 0/269 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/573 variables, 0/269 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 269 constraints, problems are : Problem set: 3 solved, 6 unsolved in 654 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 255/266 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 307/573 variables, 266/269 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 6/275 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 0/275 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:40:15] [INFO ] Deduced a trap composed of 101 places in 197 ms of which 12 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/573 variables, 1/276 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/276 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/573 variables, 0/276 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 573/573 variables, and 276 constraints, problems are : Problem set: 3 solved, 6 unsolved in 1991 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 6/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2661ms problems are : Problem set: 3 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 137 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=68 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 38 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2025-06-05 14:40:16] [INFO ] Flatten gal took : 32 ms
[2025-06-05 14:40:16] [INFO ] Flatten gal took : 31 ms
[2025-06-05 14:40:16] [INFO ] Input system was already deterministic with 307 transitions.
Support contains 92 out of 266 places (down from 100) after GAL structural reductions.
Computed a total of 35 stabilizing places and 37 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 307/307 transitions.
Graph (trivial) has 261 edges and 266 vertex of which 39 / 266 are part of one of the 6 SCC in 4 ms
Free SCC test removed 33 places
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 0 with 154 rules applied. Total rules applied 155 place count 232 transition count 116
Reduce places removed 154 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 158 rules applied. Total rules applied 313 place count 78 transition count 112
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 317 place count 76 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 319 place count 74 transition count 110
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 319 place count 74 transition count 104
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 331 place count 68 transition count 104
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 343 place count 56 transition count 91
Iterating global reduction 4 with 12 rules applied. Total rules applied 355 place count 56 transition count 91
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 4 with 1 rules applied. Total rules applied 356 place count 56 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 357 place count 55 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 357 place count 55 transition count 89
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 359 place count 54 transition count 89
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 360 place count 53 transition count 88
Iterating global reduction 6 with 1 rules applied. Total rules applied 361 place count 53 transition count 88
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 362 place count 52 transition count 87
Iterating global reduction 6 with 1 rules applied. Total rules applied 363 place count 52 transition count 87
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 373 place count 47 transition count 82
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 380 place count 40 transition count 65
Iterating global reduction 6 with 7 rules applied. Total rules applied 387 place count 40 transition count 65
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 392 place count 40 transition count 60
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 393 place count 39 transition count 59
Iterating global reduction 7 with 1 rules applied. Total rules applied 394 place count 39 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 397 place count 39 transition count 56
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 403 place count 36 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 404 place count 35 transition count 52
Applied a total of 404 rules in 90 ms. Remains 35 /266 variables (removed 231) and now considering 52/307 (removed 255) transitions.
[2025-06-05 14:40:17] [INFO ] Flow matrix only has 48 transitions (discarded 4 similar events)
// Phase 1: matrix 48 rows 35 cols
[2025-06-05 14:40:17] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:40:17] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-05 14:40:17] [INFO ] Flow matrix only has 48 transitions (discarded 4 similar events)
[2025-06-05 14:40:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:40:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-05 14:40:17] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 14:40:17] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2025-06-05 14:40:17] [INFO ] Flow matrix only has 48 transitions (discarded 4 similar events)
[2025-06-05 14:40:17] [INFO ] Invariant cache hit.
[2025-06-05 14:40:17] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/35 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:40:17] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:40:17] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:40:17] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:40:17] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 47/82 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 1/83 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/83 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 44 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1934 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/35 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 47/82 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 47/90 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 1/83 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/83 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 91 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1948 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3898ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 3899ms
Starting structural reductions in SI_CTL mode, iteration 1 : 35/266 places, 52/307 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4137 ms. Remains : 35/266 places, 52/307 transitions.
[2025-06-05 14:40:21] [INFO ] Flatten gal took : 7 ms
[2025-06-05 14:40:21] [INFO ] Flatten gal took : 6 ms
[2025-06-05 14:40:21] [INFO ] Input system was already deterministic with 52 transitions.
[2025-06-05 14:40:21] [INFO ] Flatten gal took : 5 ms
[2025-06-05 14:40:21] [INFO ] Flatten gal took : 5 ms
[2025-06-05 14:40:21] [INFO ] Time to serialize gal into /tmp/CTLFireability5267463113983476718.gal : 3 ms
[2025-06-05 14:40:21] [INFO ] Time to serialize properties into /tmp/CTLFireability14391387300600104075.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5267463113983476718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14391387300600104075.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,472,0.033472,4044,2,183,5,1016,6,0,187,1111,0


Converting to forward existential form...Done !
original formula: EF(AG(((AF(((p260==1)&&(p81==1))) + AF((p161==0))) + ((p252==1)||(p143==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((!(EG(!(((p260==1)&&(p81==1))))) + !(EG(!((p161==0))))) + ((p252==1)||(p143==1...172
Reverse transition relation is NOT exact ! Due to transitions t2, t12, t13, t20, t29, t30, t36, t37, t38, t39, t40, t44, t48, Intersection with reachable ...224
(forward)formula 0,1,0.24368,10316,1,0,257,36513,134,123,1168,35909,315
FORMULA StigmergyElection-PT-02b-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 307/307 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 246 transition count 287
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 246 transition count 287
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 51 place count 235 transition count 276
Iterating global reduction 0 with 11 rules applied. Total rules applied 62 place count 235 transition count 276
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 233 transition count 274
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 233 transition count 274
Applied a total of 66 rules in 40 ms. Remains 233 /266 variables (removed 33) and now considering 274/307 (removed 33) transitions.
// Phase 1: matrix 274 rows 233 cols
[2025-06-05 14:40:21] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:40:21] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-05 14:40:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:40:21] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2025-06-05 14:40:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:40:27] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:40:27] [INFO ] Deduced a trap composed of 163 places in 170 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:40:28] [INFO ] Deduced a trap composed of 164 places in 186 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:40:29] [INFO ] Deduced a trap composed of 166 places in 173 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 274/507 variables, 233/240 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (OVERLAPS) 0/507 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 240 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:40:55] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 37 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (OVERLAPS) 274/507 variables, 233/241 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 273/514 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:41:07] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:41:07] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 273 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 507/507 variables, and 516 constraints, problems are : Problem set: 0 solved, 273 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in LTL mode, iteration 1 : 233/266 places, 274/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60484 ms. Remains : 233/266 places, 274/307 transitions.
[2025-06-05 14:41:22] [INFO ] Flatten gal took : 15 ms
[2025-06-05 14:41:22] [INFO ] Flatten gal took : 14 ms
[2025-06-05 14:41:22] [INFO ] Input system was already deterministic with 274 transitions.
[2025-06-05 14:41:22] [INFO ] Flatten gal took : 14 ms
[2025-06-05 14:41:22] [INFO ] Flatten gal took : 14 ms
[2025-06-05 14:41:22] [INFO ] Time to serialize gal into /tmp/CTLFireability3264003080813187541.gal : 8 ms
[2025-06-05 14:41:22] [INFO ] Time to serialize properties into /tmp/CTLFireability12233753212497019330.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3264003080813187541.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12233753212497019330.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,134457,0.304407,12376,2,1897,5,27648,6,0,1208,40695,0


Converting to forward existential form...Done !
original formula: (AX(((AF(((EX((p51==0)) * (p257==0)) * (p139==0))) + A(E((p141==1) U (p22==1)) U (((p259==1)&&(p289==1))||(p77==1)))) + (AF(((p57==1)||(p...217
=> equivalent forward existential formula: ([FwdG(((EY(Init) * !((!(EG(!(((EX((p51==0)) * (p257==0)) * (p139==0))))) + !((E(!((((p259==1)&&(p289==1))||(p77...391
Hit Full ! (commute/partial/dont) 272/0/2
(forward)formula 0,0,3.33928,80636,1,0,64,401736,20,4,5498,340421,61
FORMULA StigmergyElection-PT-02b-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 307/307 transitions.
Graph (trivial) has 267 edges and 266 vertex of which 41 / 266 are part of one of the 6 SCC in 4 ms
Free SCC test removed 35 places
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 158 place count 231 transition count 111
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 161 rules applied. Total rules applied 319 place count 74 transition count 107
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 324 place count 72 transition count 104
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 327 place count 69 transition count 104
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 327 place count 69 transition count 98
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 339 place count 63 transition count 98
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 350 place count 52 transition count 85
Iterating global reduction 4 with 11 rules applied. Total rules applied 361 place count 52 transition count 85
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 4 with 1 rules applied. Total rules applied 362 place count 52 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 363 place count 51 transition count 84
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 364 place count 50 transition count 83
Iterating global reduction 6 with 1 rules applied. Total rules applied 365 place count 50 transition count 83
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 366 place count 49 transition count 82
Iterating global reduction 6 with 1 rules applied. Total rules applied 367 place count 49 transition count 82
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 381 place count 42 transition count 75
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 389 place count 34 transition count 56
Iterating global reduction 6 with 8 rules applied. Total rules applied 397 place count 34 transition count 56
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 402 place count 34 transition count 51
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 404 place count 32 transition count 49
Iterating global reduction 7 with 2 rules applied. Total rules applied 406 place count 32 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 408 place count 32 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 412 place count 30 transition count 45
Applied a total of 412 rules in 57 ms. Remains 30 /266 variables (removed 236) and now considering 45/307 (removed 262) transitions.
[2025-06-05 14:41:25] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
// Phase 1: matrix 42 rows 30 cols
[2025-06-05 14:41:25] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:41:25] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-05 14:41:25] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
[2025-06-05 14:41:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:41:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-05 14:41:25] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 14:41:25] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2025-06-05 14:41:25] [INFO ] Flow matrix only has 42 transitions (discarded 3 similar events)
[2025-06-05 14:41:25] [INFO ] Invariant cache hit.
[2025-06-05 14:41:25] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:41:25] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:41:26] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:41:26] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:41:26] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 41/71 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 1/72 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:41:27] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/72 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 40 constraints, problems are : Problem set: 0 solved, 44 unsolved in 2498 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 30/30 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:41:28] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 41/71 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 44/84 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:41:28] [INFO ] Deduced a trap along path composed of 4 places in 30 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 1/72 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 12 (OVERLAPS) 0/72 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 86 constraints, problems are : Problem set: 0 solved, 44 unsolved in 2656 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 30/30 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5169ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 5171ms
Starting structural reductions in SI_CTL mode, iteration 1 : 30/266 places, 45/307 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5362 ms. Remains : 30/266 places, 45/307 transitions.
[2025-06-05 14:41:30] [INFO ] Flatten gal took : 3 ms
[2025-06-05 14:41:30] [INFO ] Flatten gal took : 2 ms
[2025-06-05 14:41:30] [INFO ] Input system was already deterministic with 45 transitions.
[2025-06-05 14:41:30] [INFO ] Flatten gal took : 2 ms
[2025-06-05 14:41:30] [INFO ] Flatten gal took : 2 ms
[2025-06-05 14:41:30] [INFO ] Time to serialize gal into /tmp/CTLFireability11090500007707218140.gal : 1 ms
[2025-06-05 14:41:30] [INFO ] Time to serialize properties into /tmp/CTLFireability12028967150258890706.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11090500007707218140.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12028967150258890706.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,556,0.014759,4120,2,239,5,1317,6,0,162,1457,0


Converting to forward existential form...Done !
original formula: AG((AG((p209!=1)) * AF(((p288!=1)&&(p272!=1)))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * !((p209!=1)))] = FALSE * [FwdG(FwdU(Init,TRUE),!(((p288!=1)&&(p272!=1))))] = FAL...158
Hit Full ! (commute/partial/dont) 40/0/5
(forward)formula 0,0,0.040811,5016,1,0,19,5477,20,2,774,4388,18
FORMULA StigmergyElection-PT-02b-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 307/307 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 248 transition count 289
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 248 transition count 289
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 240 transition count 281
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 240 transition count 281
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 239 transition count 280
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 239 transition count 280
Applied a total of 54 rules in 29 ms. Remains 239 /266 variables (removed 27) and now considering 280/307 (removed 27) transitions.
// Phase 1: matrix 280 rows 239 cols
[2025-06-05 14:41:30] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:41:31] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-06-05 14:41:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:41:31] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2025-06-05 14:41:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:41:37] [INFO ] Deduced a trap composed of 164 places in 122 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:41:37] [INFO ] Deduced a trap composed of 165 places in 127 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:41:38] [INFO ] Deduced a trap composed of 183 places in 205 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:41:39] [INFO ] Deduced a trap composed of 166 places in 151 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:41:40] [INFO ] Deduced a trap composed of 166 places in 162 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:41:40] [INFO ] Deduced a trap composed of 166 places in 144 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 280/519 variables, 239/248 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 279 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 519/519 variables, and 248 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:42:05] [INFO ] Deduced a trap composed of 167 places in 158 ms of which 32 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:42:07] [INFO ] Deduced a trap composed of 184 places in 252 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:42:08] [INFO ] Deduced a trap composed of 151 places in 248 ms of which 37 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (OVERLAPS) 280/519 variables, 239/251 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 279/530 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:42:21] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:42:21] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:42:22] [INFO ] Deduced a trap along path composed of 16 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/519 variables, 3/533 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 519/519 variables, and 533 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in LTL mode, iteration 1 : 239/266 places, 280/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60623 ms. Remains : 239/266 places, 280/307 transitions.
[2025-06-05 14:42:31] [INFO ] Flatten gal took : 17 ms
[2025-06-05 14:42:31] [INFO ] Flatten gal took : 17 ms
[2025-06-05 14:42:31] [INFO ] Input system was already deterministic with 280 transitions.
[2025-06-05 14:42:31] [INFO ] Flatten gal took : 17 ms
[2025-06-05 14:42:31] [INFO ] Flatten gal took : 17 ms
[2025-06-05 14:42:31] [INFO ] Time to serialize gal into /tmp/CTLFireability1541209403053584866.gal : 7 ms
[2025-06-05 14:42:31] [INFO ] Time to serialize properties into /tmp/CTLFireability3946017348246356652.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1541209403053584866.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3946017348246356652.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,156697,0.59323,15904,2,3204,5,38919,6,0,1238,59876,0


Converting to forward existential form...Done !
original formula: (E((E((p166==1) U !(EX((p104==1)))) * (p154==1)) U ((p254==1) * ((AX(!(EF((p256==1)))) + !(AF((p47==1)))) + (AF((p287==1)) * EF((p285==1)...199
=> equivalent forward existential formula: [(FwdU((Init * !(E((E((p166==1) U !(EX((p104==1)))) * (p154==1)) U ((p254==1) * ((!(EX(!(!(E(TRUE U (p256==1))))...298
Reverse transition relation is NOT exact ! Due to transitions t20, t22, t35, t49, t50, t51, t60, t94, t95, t96, t129, t130, t132, t133, t148, t159, t194, t...290
Detected timeout of ITS tools.
[2025-06-05 14:43:01] [INFO ] Flatten gal took : 14 ms
[2025-06-05 14:43:01] [INFO ] Applying decomposition
[2025-06-05 14:43:01] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9844893837298716398.txt' '-o' '/tmp/graph9844893837298716398.bin' '-w' '/tmp/graph9844893837298716398.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9844893837298716398.bin' '-l' '-1' '-v' '-w' '/tmp/graph9844893837298716398.weights' '-q' '0' '-e' '0.001'
[2025-06-05 14:43:02] [INFO ] Decomposing Gal with order
[2025-06-05 14:43:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 14:43:02] [INFO ] Removed a total of 90 redundant transitions.
[2025-06-05 14:43:02] [INFO ] Flatten gal took : 97 ms
[2025-06-05 14:43:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 10 ms.
[2025-06-05 14:43:02] [INFO ] Time to serialize gal into /tmp/CTLFireability13529920260438875262.gal : 9 ms
[2025-06-05 14:43:02] [INFO ] Time to serialize properties into /tmp/CTLFireability11053120209873051357.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13529920260438875262.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11053120209873051357.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,156697,0.090468,5880,406,17,2887,200,461,3786,44,387,0


Converting to forward existential form...Done !
original formula: (E((E((i11.u50.p166==1) U !(EX((i6.u31.p104==1)))) * (i10.u45.p154==1)) U ((i13.u79.p254==1) * ((AX(!(EF((i18.i0.u80.p256==1)))) + !(AF((...292
=> equivalent forward existential formula: [(FwdU((Init * !(E((E((i11.u50.p166==1) U !(EX((i6.u31.p104==1)))) * (i10.u45.p154==1)) U ((i13.u79.p254==1) * (...391
Reverse transition relation is NOT exact ! Due to transitions t50, t95, t133, t159, t194, t195, t229, t231, t246, i0.u3.t228, i8.i0.t230, i8.i0.u40.t148, i...392
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,1.22616,48504,1,0,90749,225,3705,136135,215,561,260693
FORMULA StigmergyElection-PT-02b-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 307/307 transitions.
Graph (trivial) has 263 edges and 266 vertex of which 38 / 266 are part of one of the 5 SCC in 1 ms
Free SCC test removed 33 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 156 rules applied. Total rules applied 157 place count 232 transition count 113
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 160 rules applied. Total rules applied 317 place count 76 transition count 109
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 320 place count 74 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 321 place count 73 transition count 108
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 321 place count 73 transition count 101
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 335 place count 66 transition count 101
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 347 place count 54 transition count 87
Iterating global reduction 4 with 12 rules applied. Total rules applied 359 place count 54 transition count 87
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 4 with 1 rules applied. Total rules applied 360 place count 54 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 361 place count 53 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 361 place count 53 transition count 85
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 363 place count 52 transition count 85
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 364 place count 51 transition count 84
Iterating global reduction 6 with 1 rules applied. Total rules applied 365 place count 51 transition count 84
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 366 place count 50 transition count 83
Iterating global reduction 6 with 1 rules applied. Total rules applied 367 place count 50 transition count 83
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 377 place count 45 transition count 78
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 382 place count 40 transition count 66
Iterating global reduction 6 with 5 rules applied. Total rules applied 387 place count 40 transition count 66
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 390 place count 40 transition count 63
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 391 place count 39 transition count 62
Iterating global reduction 7 with 1 rules applied. Total rules applied 392 place count 39 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 394 place count 39 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 398 place count 37 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 399 place count 36 transition count 57
Applied a total of 399 rules in 29 ms. Remains 36 /266 variables (removed 230) and now considering 57/307 (removed 250) transitions.
[2025-06-05 14:43:03] [INFO ] Flow matrix only has 54 transitions (discarded 3 similar events)
// Phase 1: matrix 54 rows 36 cols
[2025-06-05 14:43:03] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:43:03] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-05 14:43:03] [INFO ] Flow matrix only has 54 transitions (discarded 3 similar events)
[2025-06-05 14:43:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:43:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-05 14:43:03] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 14:43:03] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2025-06-05 14:43:03] [INFO ] Flow matrix only has 54 transitions (discarded 3 similar events)
[2025-06-05 14:43:03] [INFO ] Invariant cache hit.
[2025-06-05 14:43:03] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 2/36 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:43:04] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:43:04] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 53/89 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 1/90 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/90 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 44 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2424 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 36/36 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 2/36 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 53/89 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 52/95 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:43:07] [INFO ] Deduced a trap along path composed of 2 places in 47 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 1/90 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (OVERLAPS) 0/90 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 97 constraints, problems are : Problem set: 0 solved, 52 unsolved in 3073 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 36/36 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5516ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 5516ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/266 places, 57/307 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5685 ms. Remains : 36/266 places, 57/307 transitions.
[2025-06-05 14:43:09] [INFO ] Flatten gal took : 4 ms
[2025-06-05 14:43:09] [INFO ] Flatten gal took : 4 ms
[2025-06-05 14:43:09] [INFO ] Input system was already deterministic with 57 transitions.
[2025-06-05 14:43:09] [INFO ] Flatten gal took : 4 ms
[2025-06-05 14:43:09] [INFO ] Flatten gal took : 3 ms
[2025-06-05 14:43:09] [INFO ] Time to serialize gal into /tmp/CTLFireability11951580075537653449.gal : 1 ms
[2025-06-05 14:43:09] [INFO ] Time to serialize properties into /tmp/CTLFireability17113317640067555667.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11951580075537653449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17113317640067555667.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,482,0.018127,4180,2,233,5,1282,6,0,197,1286,0


Converting to forward existential form...Done !
original formula: AG(AF((EF((p67==1)) * (!(A((p82==1) U ((p84==1)&&(p219==1)))) + (p100==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((E(TRUE U (p67==1)) * (!(!((E(!(((p84==1)&&(p219==1))) U (!((p82==1)) * !(((p84==1)&&(p2...224
Reverse transition relation is NOT exact ! Due to transitions t1, t10, t30, t32, t33, t38, t39, t41, t42, t46, t52, Intersection with reachable at each st...214
(forward)formula 0,0,0.277861,11348,1,0,209,42290,148,112,1243,40281,261
FORMULA StigmergyElection-PT-02b-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 307/307 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 243 transition count 284
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 243 transition count 284
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 232 transition count 273
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 232 transition count 273
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 230 transition count 271
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 230 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 229 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 229 transition count 270
Applied a total of 74 rules in 20 ms. Remains 229 /266 variables (removed 37) and now considering 270/307 (removed 37) transitions.
// Phase 1: matrix 270 rows 229 cols
[2025-06-05 14:43:09] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:43:09] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-05 14:43:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:43:09] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2025-06-05 14:43:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:43:17] [INFO ] Deduced a trap composed of 162 places in 177 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:43:17] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:43:18] [INFO ] Deduced a trap composed of 165 places in 207 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:43:18] [INFO ] Deduced a trap composed of 163 places in 202 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:43:19] [INFO ] Deduced a trap composed of 163 places in 205 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 270/499 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/499 variables, and 237 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 270/499 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 269/506 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:43:50] [INFO ] Deduced a trap composed of 164 places in 236 ms of which 35 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:44:06] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:44:06] [INFO ] Deduced a trap along path composed of 3 places in 40 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 2)
(t3 2)
(t4 2)
(t5 2)
(t6 1)
(t7 1)
(t8 2)
(t9 2)
(t10 1)
(t11 1)
(t12 2)
(t13 2)
(t14 1)
(t15 1)
(t16 1)
(t17 8)
(t18 6)
(t19 6)
(t20 6)
(t21 6)
(t22 6)
(t23 1)
(t24 1)
(t25 1)
(t26 1)
(t27 1)
(t28 1)
(t29 9)
(t30 1)
(t31 1)
(t32 1)
(t33 1)
(t34 1)
(t35 1)
(t36 1)
(t37 1)
(t38 0)
(t39 0)
(t40 0)
(t41 0)
(t42 0)
(t43 1)
(t44 1)
(t45 1)
(t46 1)
(t47 1)
(t48 1)
(t49 1)
(t50 1)
(t51 1)
(t52 1)
(t53 0)
(t54 0)
(t55 0)
(t56 1)
(t57 1)
(t58 1)
(t59 1)
(t60 1)
(t61 1)
(t62 1)
(t63 1)
(t64 1)
(t65 1)
(t66 1)
(t67 1)
(t68 2)
(t69 2)
(t70 2)
(t71 2)
(t72 2)
(t73 2)
(t74 2)
(t75 2)
(t76 2)
(t77 2)
(t78 1)
(t79 1)
(t80 1)
(t81 0)
(t82 0)
(t83 1)
(t84 2)
(t85 1)
(t86 1)
(t87 1)
(t88 2)
(t89 1)
(t90 1)
(t91 1)
(t92 1)
(t93 1)
(t94 1)
(t95 1)
(t96 1)
(t97 1)
(t98 1)
(t99 1)
(t100 1)
(t101 1)
(t102 2)
(t103 2)
(t104 2)
(t105 2)
(t106 2)
(t107 2)
(t108 2)
(t109 2)
(t110 2)
(t111 2)
(t112 2)
(t113 2)
(t114 1)
(t115 1)
(t116 0)
(t117 0)
(t118 2)
(t119 2)
(t120 1)
(t121 1)
(t122 1)
(t123 3)
(t124 6)
(t125 0)
(t126 9)
(t127 0)
(t128 2)
(t129 1)
(t130 1)
(t131 1)
(t132 1)
(t133 1)
(t134 1)
(t135 1)
(t136 0)
(t137 0)
(t138 0)
(t139 0)
(t140 0)
(t141 1)
(t142 1)
(t143 1)
(t144 1)
(t145 1)
(t146 1)
(t147 1)
(t148 1)
(t149 1)
(t150 1)
(t151 0)
(t152 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 509 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 229/266 places, 270/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60554 ms. Remains : 229/266 places, 270/307 transitions.
[2025-06-05 14:44:10] [INFO ] Flatten gal took : 15 ms
[2025-06-05 14:44:10] [INFO ] Flatten gal took : 28 ms
[2025-06-05 14:44:10] [INFO ] Input system was already deterministic with 270 transitions.
[2025-06-05 14:44:10] [INFO ] Flatten gal took : 12 ms
[2025-06-05 14:44:10] [INFO ] Flatten gal took : 12 ms
[2025-06-05 14:44:10] [INFO ] Time to serialize gal into /tmp/CTLFireability5770213321535601671.gal : 11 ms
[2025-06-05 14:44:10] [INFO ] Time to serialize properties into /tmp/CTLFireability12341731094942231410.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5770213321535601671.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12341731094942231410.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,130971,0.447966,11840,2,1894,5,26679,6,0,1188,36848,0


Converting to forward existential form...Done !
original formula: A(!(AG(((EF((p120==1)) * (p196==1)) * ((p222!=1) + EF((p214==1)))))) U !(EF(!(EX((p289==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(EX((p289==1))))))))) * !(E(!(!(E(TRUE U !(EX((p289==1)))))) U (!(!(!(E(TRUE U !(((...278
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t87, t88, t89, t122, t123, t125, t141, t150, t184, t185, t186, t219, t220, t222, t2...265
(forward)formula 0,0,12.3241,313280,1,0,574,2.19081e+06,568,347,6797,1.23409e+06,851
FORMULA StigmergyElection-PT-02b-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 307/307 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 244 transition count 285
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 244 transition count 285
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 56 place count 232 transition count 273
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 232 transition count 273
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 230 transition count 271
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 230 transition count 271
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 229 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 229 transition count 270
Applied a total of 74 rules in 22 ms. Remains 229 /266 variables (removed 37) and now considering 270/307 (removed 37) transitions.
// Phase 1: matrix 270 rows 229 cols
[2025-06-05 14:44:22] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:44:22] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-05 14:44:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:44:23] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2025-06-05 14:44:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:44:30] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:44:30] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:44:31] [INFO ] Deduced a trap composed of 165 places in 219 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:44:31] [INFO ] Deduced a trap composed of 163 places in 181 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:44:32] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:44:32] [INFO ] Deduced a trap composed of 163 places in 142 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 270/499 variables, 229/238 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (OVERLAPS) 0/499 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 238 constraints, problems are : Problem set: 0 solved, 269 unsolved in 27246 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 270/499 variables, 229/238 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 269/507 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:45:00] [INFO ] Deduced a trap along path composed of 3 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:45:01] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 269 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 509 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 57294ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 57296ms
Starting structural reductions in LTL mode, iteration 1 : 229/266 places, 270/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57811 ms. Remains : 229/266 places, 270/307 transitions.
[2025-06-05 14:45:20] [INFO ] Flatten gal took : 9 ms
[2025-06-05 14:45:20] [INFO ] Flatten gal took : 9 ms
[2025-06-05 14:45:20] [INFO ] Input system was already deterministic with 270 transitions.
[2025-06-05 14:45:20] [INFO ] Flatten gal took : 8 ms
[2025-06-05 14:45:20] [INFO ] Flatten gal took : 8 ms
[2025-06-05 14:45:20] [INFO ] Time to serialize gal into /tmp/CTLFireability8731715756548118484.gal : 3 ms
[2025-06-05 14:45:20] [INFO ] Time to serialize properties into /tmp/CTLFireability13906189548807555351.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8731715756548118484.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13906189548807555351.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,130971,0.346327,11972,2,1898,5,26614,6,0,1188,38040,0


Converting to forward existential form...Done !
original formula: (E(((p71==1)&&(p282==1)) U EX(EX((p213==1)))) + EG(EX((AG((p110==0)) + AG((p231==0))))))
=> equivalent forward existential formula: ([(EY(EY(FwdU(Init,((p71==1)&&(p282==1))))) * (p213==1))] != FALSE + [FwdG(Init,EX((!(E(TRUE U !((p110==0)))) + ...194
Hit Full ! (commute/partial/dont) 261/8/9
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t59, t87, t88, t89, t122, t123, t125, t141, t150, t184, t185, t186, t219, t220, t22...270
(forward)formula 0,0,8.71464,205224,1,0,460,1.28394e+06,578,285,6822,768222,683
FORMULA StigmergyElection-PT-02b-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 307/307 transitions.
Graph (trivial) has 261 edges and 266 vertex of which 32 / 266 are part of one of the 5 SCC in 0 ms
Free SCC test removed 27 places
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 162 place count 238 transition count 115
Reduce places removed 161 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 163 rules applied. Total rules applied 325 place count 77 transition count 113
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 328 place count 76 transition count 111
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 332 place count 74 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 333 place count 73 transition count 109
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 333 place count 73 transition count 105
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 341 place count 69 transition count 105
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 352 place count 58 transition count 93
Iterating global reduction 5 with 11 rules applied. Total rules applied 363 place count 58 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 363 place count 58 transition count 92
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 365 place count 57 transition count 92
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 366 place count 56 transition count 91
Iterating global reduction 5 with 1 rules applied. Total rules applied 367 place count 56 transition count 91
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 368 place count 55 transition count 90
Iterating global reduction 5 with 1 rules applied. Total rules applied 369 place count 55 transition count 90
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 383 place count 48 transition count 83
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 389 place count 42 transition count 68
Iterating global reduction 5 with 6 rules applied. Total rules applied 395 place count 42 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 399 place count 42 transition count 64
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 400 place count 41 transition count 63
Iterating global reduction 6 with 1 rules applied. Total rules applied 401 place count 41 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 404 place count 41 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 406 place count 41 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 408 place count 39 transition count 58
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 8 with 2 rules applied. Total rules applied 410 place count 38 transition count 57
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 411 place count 38 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 412 place count 37 transition count 56
Applied a total of 412 rules in 29 ms. Remains 37 /266 variables (removed 229) and now considering 56/307 (removed 251) transitions.
[2025-06-05 14:45:29] [INFO ] Flow matrix only has 53 transitions (discarded 3 similar events)
// Phase 1: matrix 53 rows 37 cols
[2025-06-05 14:45:29] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:45:29] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-05 14:45:29] [INFO ] Flow matrix only has 53 transitions (discarded 3 similar events)
[2025-06-05 14:45:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:45:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-05 14:45:29] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 14:45:29] [INFO ] Redundant transitions in 2 ms returned []
Running 51 sub problems to find dead transitions.
[2025-06-05 14:45:29] [INFO ] Flow matrix only has 53 transitions (discarded 3 similar events)
[2025-06-05 14:45:29] [INFO ] Invariant cache hit.
[2025-06-05 14:45:29] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:45:29] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:45:30] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:45:30] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:45:30] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 52/89 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 1/90 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (OVERLAPS) 0/90 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 46 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2942 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 37/37 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 2/37 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 52/89 variables, 37/43 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 51/96 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 1/90 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 11 (OVERLAPS) 0/90 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 97 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2721 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 37/37 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5672ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 5676ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/266 places, 56/307 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5865 ms. Remains : 37/266 places, 56/307 transitions.
[2025-06-05 14:45:35] [INFO ] Flatten gal took : 4 ms
[2025-06-05 14:45:35] [INFO ] Flatten gal took : 3 ms
[2025-06-05 14:45:35] [INFO ] Input system was already deterministic with 56 transitions.
[2025-06-05 14:45:35] [INFO ] Flatten gal took : 3 ms
[2025-06-05 14:45:35] [INFO ] Flatten gal took : 3 ms
[2025-06-05 14:45:35] [INFO ] Time to serialize gal into /tmp/CTLFireability8167795219465351461.gal : 1 ms
[2025-06-05 14:45:35] [INFO ] Time to serialize properties into /tmp/CTLFireability1710112892750604645.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8167795219465351461.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1710112892750604645.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,504,0.036603,4172,2,226,5,1278,6,0,200,1416,0


Converting to forward existential form...Done !
original formula: A(AF(!((((p62!=1) * A((p208==1) U (p70==1))) * AG((p96==1))))) U ((p23==1)||(p59==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(((p23==1)||(p59==1)))))) * !(E(!(((p23==1)||(p59==1))) U (!(!(EG(!(!((((p62!=1) * !((E(!((p70==...284
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t10, t11, t29, t30, t32, t36, t37, t38, t39, t42, t47, t51, Intersection with reacha...228
(forward)formula 0,0,0.251293,8780,1,0,211,26657,150,101,1262,26723,258
FORMULA StigmergyElection-PT-02b-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 307/307 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 246 transition count 287
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 246 transition count 287
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 238 transition count 279
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 238 transition count 279
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 237 transition count 278
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 237 transition count 278
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 236 transition count 277
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 236 transition count 277
Applied a total of 60 rules in 23 ms. Remains 236 /266 variables (removed 30) and now considering 277/307 (removed 30) transitions.
// Phase 1: matrix 277 rows 236 cols
[2025-06-05 14:45:35] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:45:35] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-05 14:45:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:45:36] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-05 14:45: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/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:45:43] [INFO ] Deduced a trap composed of 163 places in 225 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:45:44] [INFO ] Deduced a trap composed of 165 places in 250 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:45:44] [INFO ] Deduced a trap composed of 167 places in 132 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:45:44] [INFO ] Deduced a trap composed of 166 places in 129 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:45:45] [INFO ] Deduced a trap composed of 167 places in 116 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 277/513 variables, 236/244 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 513/513 variables, and 244 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 277/513 variables, 236/244 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 276/520 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:46:18] [INFO ] Deduced a trap composed of 169 places in 103 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/513 variables, and 521 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in LTL mode, iteration 1 : 236/266 places, 277/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60659 ms. Remains : 236/266 places, 277/307 transitions.
[2025-06-05 14:46:36] [INFO ] Flatten gal took : 8 ms
[2025-06-05 14:46:36] [INFO ] Flatten gal took : 8 ms
[2025-06-05 14:46:36] [INFO ] Input system was already deterministic with 277 transitions.
[2025-06-05 14:46:36] [INFO ] Flatten gal took : 7 ms
[2025-06-05 14:46:36] [INFO ] Flatten gal took : 11 ms
[2025-06-05 14:46:36] [INFO ] Time to serialize gal into /tmp/CTLFireability11883885358524398917.gal : 1 ms
[2025-06-05 14:46:36] [INFO ] Time to serialize properties into /tmp/CTLFireability12509109113590264636.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11883885358524398917.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12509109113590264636.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,137257,0.314763,12004,2,1848,5,27147,6,0,1223,36647,0


Converting to forward existential form...Done !
original formula: E(AX(!(((E(A((p146==1) U (p171==1)) U EF((p63==1))) + (p286==1)) + ((p74!=1)&&((p197==1)||((p97==1)&&(p207==1))))))) U !(EG(EF(!(AG((p190...165
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(!(((E(!((E(!((p171==1)) U (!((p146==1)) * !((p171==1)))) + EG(!((p171==1))))) U E(TRUE U (p63...288
Reverse transition relation is NOT exact ! Due to transitions t43, t53, t91, t92, t105, t127, t128, t130, t146, t155, t189, t190, t191, t224, t225, t227, t...266
(forward)formula 0,0,12.2054,257500,1,0,521,1.73762e+06,579,320,6989,993914,784
FORMULA StigmergyElection-PT-02b-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 307/307 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 244 transition count 285
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 244 transition count 285
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 233 transition count 274
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 233 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 231 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 231 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 230 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 230 transition count 271
Applied a total of 72 rules in 15 ms. Remains 230 /266 variables (removed 36) and now considering 271/307 (removed 36) transitions.
// Phase 1: matrix 271 rows 230 cols
[2025-06-05 14:46:48] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:46:48] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-05 14:46:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:46:48] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2025-06-05 14:46:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:46:56] [INFO ] Deduced a trap composed of 162 places in 186 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:46:56] [INFO ] Deduced a trap composed of 163 places in 126 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:46:57] [INFO ] Deduced a trap composed of 164 places in 161 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:46:57] [INFO ] Deduced a trap composed of 165 places in 163 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:46:57] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:46:58] [INFO ] Deduced a trap composed of 164 places in 141 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/239 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 0/501 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 239 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/239 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 270/509 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:47:29] [INFO ] Deduced a trap along path composed of 3 places in 35 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:47:29] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 2/511 constraints. Problems are: Problem set: 0 solved, 270 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 Int declared 501/501 variables, and 511 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Starting structural reductions in LTL mode, iteration 1 : 230/266 places, 271/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60408 ms. Remains : 230/266 places, 271/307 transitions.
[2025-06-05 14:47:48] [INFO ] Flatten gal took : 7 ms
[2025-06-05 14:47:48] [INFO ] Flatten gal took : 8 ms
[2025-06-05 14:47:48] [INFO ] Input system was already deterministic with 271 transitions.
[2025-06-05 14:47:48] [INFO ] Flatten gal took : 7 ms
[2025-06-05 14:47:49] [INFO ] Flatten gal took : 7 ms
[2025-06-05 14:47:49] [INFO ] Time to serialize gal into /tmp/CTLFireability6746515049314799712.gal : 1 ms
[2025-06-05 14:47:49] [INFO ] Time to serialize properties into /tmp/CTLFireability13353833855768341022.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6746515049314799712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13353833855768341022.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,131951,0.332157,12104,2,1906,5,27070,6,0,1193,38166,0


Converting to forward existential form...Done !
original formula: E(EF(!(AF((p132==1)))) U ((p120==1) + EF(((((p38==1) + AG((p248==1))) * (p158==1)) * EX((p152==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,E(TRUE U !(!(EG(!((p132==1))))))) * (p120==1))] != FALSE + [(EY((FwdU(FwdU(Init,E(TRUE U !(!(EG(!((...256
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t86, t87, t88, t123, t124, t126, t142, t151, t185, t186, t187, t220, t221, t223, t2...265
(forward)formula 0,1,16.5752,400932,1,0,841,2.85577e+06,572,457,7228,1.77686e+06,1234
FORMULA StigmergyElection-PT-02b-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 307/307 transitions.
Graph (trivial) has 262 edges and 266 vertex of which 41 / 266 are part of one of the 6 SCC in 1 ms
Free SCC test removed 35 places
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 154 place count 230 transition count 114
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 157 rules applied. Total rules applied 311 place count 77 transition count 110
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 318 place count 75 transition count 105
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 323 place count 70 transition count 105
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 323 place count 70 transition count 97
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 339 place count 62 transition count 97
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 352 place count 49 transition count 82
Iterating global reduction 4 with 13 rules applied. Total rules applied 365 place count 49 transition count 82
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 4 with 1 rules applied. Total rules applied 366 place count 49 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 367 place count 48 transition count 81
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 368 place count 47 transition count 80
Iterating global reduction 6 with 1 rules applied. Total rules applied 369 place count 47 transition count 80
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 370 place count 46 transition count 79
Iterating global reduction 6 with 1 rules applied. Total rules applied 371 place count 46 transition count 79
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 381 place count 41 transition count 74
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 389 place count 33 transition count 55
Iterating global reduction 6 with 8 rules applied. Total rules applied 397 place count 33 transition count 55
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 402 place count 33 transition count 50
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 404 place count 31 transition count 48
Iterating global reduction 7 with 2 rules applied. Total rules applied 406 place count 31 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 408 place count 31 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 412 place count 29 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 413 place count 28 transition count 43
Applied a total of 413 rules in 27 ms. Remains 28 /266 variables (removed 238) and now considering 43/307 (removed 264) transitions.
[2025-06-05 14:48:05] [INFO ] Flow matrix only has 40 transitions (discarded 3 similar events)
// Phase 1: matrix 40 rows 28 cols
[2025-06-05 14:48:05] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:48:05] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-05 14:48:05] [INFO ] Flow matrix only has 40 transitions (discarded 3 similar events)
[2025-06-05 14:48:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:48:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-05 14:48:05] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 14:48:05] [INFO ] Redundant transitions in 1 ms returned []
Running 38 sub problems to find dead transitions.
[2025-06-05 14:48:05] [INFO ] Flow matrix only has 40 transitions (discarded 3 similar events)
[2025-06-05 14:48:05] [INFO ] Invariant cache hit.
[2025-06-05 14:48:05] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 3/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:48:06] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:48:06] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:48:06] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:48:06] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 39/67 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 1/68 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/68 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/68 variables, and 37 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1354 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 28/28 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 3/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 39/67 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 38/74 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 1/68 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/68 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/68 variables, and 75 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1389 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 28/28 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2757ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2757ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/266 places, 43/307 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2906 ms. Remains : 28/266 places, 43/307 transitions.
[2025-06-05 14:48:08] [INFO ] Flatten gal took : 3 ms
[2025-06-05 14:48:08] [INFO ] Flatten gal took : 2 ms
[2025-06-05 14:48:08] [INFO ] Input system was already deterministic with 43 transitions.
[2025-06-05 14:48:08] [INFO ] Flatten gal took : 2 ms
[2025-06-05 14:48:08] [INFO ] Flatten gal took : 2 ms
[2025-06-05 14:48:08] [INFO ] Time to serialize gal into /tmp/CTLFireability9469992481805392343.gal : 1 ms
[2025-06-05 14:48:08] [INFO ] Time to serialize properties into /tmp/CTLFireability15838449994804602682.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9469992481805392343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15838449994804602682.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,444,0.011755,3956,2,154,5,747,6,0,151,669,0


Converting to forward existential form...Done !
original formula: AG((EF(((p117==0)&&(p27==1))) + (p289==0)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p289==0))) * !(E(TRUE U ((p117==0)&&(p27==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t20, t21, t23, t24, t26, t30, t31, t32, t36, t40, Intersection with reachable at eac...218
(forward)formula 0,0,0.05922,5876,1,0,105,10055,105,49,936,8314,111
FORMULA StigmergyElection-PT-02b-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 307/307 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 243 transition count 284
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 243 transition count 284
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 58 place count 231 transition count 272
Iterating global reduction 0 with 12 rules applied. Total rules applied 70 place count 231 transition count 272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 229 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 228 transition count 269
Applied a total of 76 rules in 15 ms. Remains 228 /266 variables (removed 38) and now considering 269/307 (removed 38) transitions.
// Phase 1: matrix 269 rows 228 cols
[2025-06-05 14:48:08] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:48:08] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-06-05 14:48:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:48:09] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2025-06-05 14:48:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:48:15] [INFO ] Deduced a trap composed of 162 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:48:15] [INFO ] Deduced a trap composed of 163 places in 142 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:48:16] [INFO ] Deduced a trap composed of 164 places in 135 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:48:16] [INFO ] Deduced a trap composed of 163 places in 116 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:48:17] [INFO ] Deduced a trap composed of 162 places in 111 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (OVERLAPS) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 236 constraints, problems are : Problem set: 0 solved, 268 unsolved in 29875 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:48:42] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 36 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 269/497 variables, 228/237 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 268/505 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:48:51] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:48:51] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 2/507 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 507 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 59910ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 59911ms
Starting structural reductions in LTL mode, iteration 1 : 228/266 places, 269/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60384 ms. Remains : 228/266 places, 269/307 transitions.
[2025-06-05 14:49:09] [INFO ] Flatten gal took : 14 ms
[2025-06-05 14:49:09] [INFO ] Flatten gal took : 10 ms
[2025-06-05 14:49:09] [INFO ] Input system was already deterministic with 269 transitions.
[2025-06-05 14:49:09] [INFO ] Flatten gal took : 10 ms
[2025-06-05 14:49:09] [INFO ] Flatten gal took : 10 ms
[2025-06-05 14:49:09] [INFO ] Time to serialize gal into /tmp/CTLFireability15661723220514896097.gal : 2 ms
[2025-06-05 14:49:09] [INFO ] Time to serialize properties into /tmp/CTLFireability6573143254396356863.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15661723220514896097.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6573143254396356863.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,130047,0.460645,11840,2,1866,5,26218,6,0,1183,36497,0


Converting to forward existential form...Done !
original formula: EF((AX(FALSE) * (EG((p199==1)) + AG((p177==1)))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,TRUE) * !(EX(!(FALSE)))),(p199==1))] != FALSE + [((FwdU(Init,TRUE) * !(EX(!(FALSE)))) * !(E(TR...186
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t86, t87, t88, t121, t122, t124, t140, t149, t183, t184, t185, t218, t219, t221, t2...265
(forward)formula 0,0,4.35262,97788,1,0,401,435226,569,256,6771,415967,606
FORMULA StigmergyElection-PT-02b-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 307/307 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 248 transition count 289
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 248 transition count 289
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 47 place count 237 transition count 278
Iterating global reduction 0 with 11 rules applied. Total rules applied 58 place count 237 transition count 278
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 236 transition count 277
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 236 transition count 277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 235 transition count 276
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 235 transition count 276
Applied a total of 62 rules in 14 ms. Remains 235 /266 variables (removed 31) and now considering 276/307 (removed 31) transitions.
// Phase 1: matrix 276 rows 235 cols
[2025-06-05 14:49:13] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:49:13] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-05 14:49:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:49:13] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 275 sub problems to find dead transitions.
[2025-06-05 14:49:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:49:22] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:49:22] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:49:22] [INFO ] Deduced a trap composed of 166 places in 236 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:49:23] [INFO ] Deduced a trap composed of 167 places in 206 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:49:24] [INFO ] Deduced a trap composed of 167 places in 204 ms of which 34 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 276/511 variables, 235/243 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/511 variables, and 243 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (OVERLAPS) 276/511 variables, 235/243 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 275/518 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:49:58] [INFO ] Deduced a trap along path composed of 3 places in 49 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:49:58] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/511 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/511 variables, and 520 constraints, problems are : Problem set: 0 solved, 275 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in LTL mode, iteration 1 : 235/266 places, 276/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60410 ms. Remains : 235/266 places, 276/307 transitions.
[2025-06-05 14:50:14] [INFO ] Flatten gal took : 21 ms
[2025-06-05 14:50:14] [INFO ] Flatten gal took : 12 ms
[2025-06-05 14:50:14] [INFO ] Input system was already deterministic with 276 transitions.
[2025-06-05 14:50:14] [INFO ] Flatten gal took : 13 ms
[2025-06-05 14:50:14] [INFO ] Flatten gal took : 11 ms
[2025-06-05 14:50:14] [INFO ] Time to serialize gal into /tmp/CTLFireability448646437803799507.gal : 3 ms
[2025-06-05 14:50:14] [INFO ] Time to serialize properties into /tmp/CTLFireability13666589319189423386.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability448646437803799507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13666589319189423386.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,136347,0.526206,12280,2,1733,5,27251,6,0,1218,39691,0


Converting to forward existential form...Done !
original formula: EF((((p53==1) * EX(AF(((p24==1)&&(p282==1))))) * (A(!((AX((p83==1)) + E((p103==1) U (p88==1)))) U (AX(((p117==1)||(p139==1))) + AG(A((p9=...342
=> equivalent forward existential formula: ((([(((((FwdU(Init,TRUE) * ((p53==1) * EX(!(EG(!(((p24==1)&&(p282==1)))))))) * !((E(!((!(EX(!(((p117==1)||(p139=...2485
Reverse transition relation is NOT exact ! Due to transitions t43, t88, t89, t122, t123, t127, t142, t151, t168, t187, t188, t190, t223, t224, t226, t239, ...267
Detected timeout of ITS tools.
[2025-06-05 14:50:44] [INFO ] Flatten gal took : 12 ms
[2025-06-05 14:50:44] [INFO ] Applying decomposition
[2025-06-05 14:50:44] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17919855351740723566.txt' '-o' '/tmp/graph17919855351740723566.bin' '-w' '/tmp/graph17919855351740723566.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17919855351740723566.bin' '-l' '-1' '-v' '-w' '/tmp/graph17919855351740723566.weights' '-q' '0' '-e' '0.001'
[2025-06-05 14:50:44] [INFO ] Decomposing Gal with order
[2025-06-05 14:50:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 14:50:44] [INFO ] Removed a total of 92 redundant transitions.
[2025-06-05 14:50:44] [INFO ] Flatten gal took : 29 ms
[2025-06-05 14:50:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 11 ms.
[2025-06-05 14:50:44] [INFO ] Time to serialize gal into /tmp/CTLFireability6795123528528951466.gal : 8 ms
[2025-06-05 14:50:44] [INFO ] Time to serialize properties into /tmp/CTLFireability12628317745338987455.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6795123528528951466.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12628317745338987455.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,136347,0.073589,5776,292,19,2293,262,451,2727,49,610,0


Converting to forward existential form...Done !
original formula: EF((((i3.u20.p53==1) * EX(AF(((i1.u7.p24==1)&&(i18.i1.u86.p282==1))))) * (A(!((AX((i7.u37.p83==1)) + E((i6.i0.u32.p103==1) U (i5.i0.u27.p...539
=> equivalent forward existential formula: ((([(((((FwdU(Init,TRUE) * ((i3.u20.p53==1) * EX(!(EG(!(((i1.u7.p24==1)&&(i18.i1.u86.p282==1)))))))) * !((E(!((!...3471
Reverse transition relation is NOT exact ! Due to transitions t43, t88, t89, t123, t127, t188, t190, t224, t226, t239, t241, i0.u3.t223, i3.t151, i3.u18.t1...315
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,2.59103,77328,1,0,141637,317,3525,240688,266,665,371263
FORMULA StigmergyElection-PT-02b-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 307/307 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 243 transition count 284
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 243 transition count 284
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 232 transition count 273
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 232 transition count 273
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 231 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 231 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 230 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 230 transition count 271
Applied a total of 72 rules in 17 ms. Remains 230 /266 variables (removed 36) and now considering 271/307 (removed 36) transitions.
// Phase 1: matrix 271 rows 230 cols
[2025-06-05 14:50:47] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:50:47] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-05 14:50:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:50:47] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2025-06-05 14:50:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:50:54] [INFO ] Deduced a trap composed of 162 places in 143 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:50:54] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:50:54] [INFO ] Deduced a trap composed of 165 places in 123 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:50:55] [INFO ] Deduced a trap composed of 163 places in 201 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:50:55] [INFO ] Deduced a trap composed of 165 places in 219 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:50:55] [INFO ] Deduced a trap composed of 163 places in 184 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:50:58] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (OVERLAPS) 271/501 variables, 230/240 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/501 variables, and 240 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/240 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 270/510 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:51:25] [INFO ] Deduced a trap composed of 165 places in 116 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:51:34] [INFO ] Deduced a trap along path composed of 3 places in 42 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:51:34] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 2/513 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 513 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in LTL mode, iteration 1 : 230/266 places, 271/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60488 ms. Remains : 230/266 places, 271/307 transitions.
[2025-06-05 14:51:47] [INFO ] Flatten gal took : 6 ms
[2025-06-05 14:51:47] [INFO ] Flatten gal took : 5 ms
[2025-06-05 14:51:47] [INFO ] Input system was already deterministic with 271 transitions.
[2025-06-05 14:51:47] [INFO ] Flatten gal took : 6 ms
[2025-06-05 14:51:47] [INFO ] Flatten gal took : 5 ms
[2025-06-05 14:51:47] [INFO ] Time to serialize gal into /tmp/CTLFireability7608645172257577504.gal : 1 ms
[2025-06-05 14:51:47] [INFO ] Time to serialize properties into /tmp/CTLFireability9736567195494626961.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7608645172257577504.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9736567195494626961.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,131755,0.302613,11984,2,1790,5,27000,6,0,1193,36329,0


Converting to forward existential form...Done !
original formula: AX((A((p198!=1) U ((p192==1)||(p275==1))) + (p283==1)))
=> equivalent forward existential formula: ([(FwdU((EY(Init) * !((p283==1))),!(((p192==1)||(p275==1)))) * (!((p198!=1)) * !(((p192==1)||(p275==1)))))] = FA...229
Hit Full ! (commute/partial/dont) 267/4/4
(forward)formula 0,0,3.02293,84356,1,0,68,431142,22,6,5442,359212,63
FORMULA StigmergyElection-PT-02b-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 307/307 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 243 transition count 284
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 243 transition count 284
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 58 place count 231 transition count 272
Iterating global reduction 0 with 12 rules applied. Total rules applied 70 place count 231 transition count 272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 229 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 229 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 228 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 228 transition count 269
Applied a total of 76 rules in 16 ms. Remains 228 /266 variables (removed 38) and now considering 269/307 (removed 38) transitions.
// Phase 1: matrix 269 rows 228 cols
[2025-06-05 14:51:50] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:51:50] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-05 14:51:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:51:51] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2025-06-05 14:51:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:51:58] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:51:58] [INFO ] Deduced a trap composed of 163 places in 203 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:51:59] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:51:59] [INFO ] Deduced a trap composed of 163 places in 207 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:52:00] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 497/497 variables, and 236 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:52:25] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 36 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (OVERLAPS) 269/497 variables, 228/237 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 268/505 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:52:37] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:52:38] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 2/507 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/497 variables, and 507 constraints, problems are : Problem set: 0 solved, 268 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in LTL mode, iteration 1 : 228/266 places, 269/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60480 ms. Remains : 228/266 places, 269/307 transitions.
[2025-06-05 14:52:51] [INFO ] Flatten gal took : 9 ms
[2025-06-05 14:52:51] [INFO ] Flatten gal took : 9 ms
[2025-06-05 14:52:51] [INFO ] Input system was already deterministic with 269 transitions.
[2025-06-05 14:52:51] [INFO ] Flatten gal took : 8 ms
[2025-06-05 14:52:51] [INFO ] Flatten gal took : 8 ms
[2025-06-05 14:52:51] [INFO ] Time to serialize gal into /tmp/CTLFireability913216887316036918.gal : 2 ms
[2025-06-05 14:52:51] [INFO ] Time to serialize properties into /tmp/CTLFireability7135544270634162475.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability913216887316036918.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7135544270634162475.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,130047,0.459047,11840,2,1866,5,26218,6,0,1183,36497,0


Converting to forward existential form...Done !
original formula: EG(((p252==0) + EF(((p66==0) + EX((p110==1))))))
=> equivalent forward existential formula: [FwdG(Init,((p252==0) + E(TRUE U ((p66==0) + EX((p110==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t86, t87, t88, t121, t122, t124, t140, t149, t183, t184, t185, t218, t219, t221, t2...265
(forward)formula 0,1,5.03172,102860,1,0,405,455715,565,259,7171,442861,612
FORMULA StigmergyElection-PT-02b-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 307/307 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 243 transition count 284
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 243 transition count 284
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 233 transition count 274
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 233 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 231 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 231 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 230 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 230 transition count 271
Applied a total of 72 rules in 23 ms. Remains 230 /266 variables (removed 36) and now considering 271/307 (removed 36) transitions.
// Phase 1: matrix 271 rows 230 cols
[2025-06-05 14:52:56] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:52:56] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-05 14:52:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 14:52:56] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2025-06-05 14:52: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/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:53:04] [INFO ] Deduced a trap composed of 163 places in 176 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:53:04] [INFO ] Deduced a trap composed of 163 places in 205 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:53:05] [INFO ] Deduced a trap composed of 164 places in 149 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:53:05] [INFO ] Deduced a trap composed of 164 places in 125 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:53:05] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:53:06] [INFO ] Deduced a trap composed of 96 places in 158 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:53:13] [INFO ] Deduced a trap composed of 165 places in 209 ms of which 34 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 271/501 variables, 230/240 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/501 variables, and 240 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/240 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 270/510 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:53:37] [INFO ] Deduced a trap composed of 188 places in 203 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:53:48] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:53:48] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 14:53:49] [INFO ] Deduced a trap along path composed of 14 places in 77 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 514 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Starting structural reductions in LTL mode, iteration 1 : 230/266 places, 271/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60582 ms. Remains : 230/266 places, 271/307 transitions.
[2025-06-05 14:53:56] [INFO ] Flatten gal took : 11 ms
[2025-06-05 14:53:56] [INFO ] Flatten gal took : 8 ms
[2025-06-05 14:53:56] [INFO ] Input system was already deterministic with 271 transitions.
[2025-06-05 14:53:56] [INFO ] Flatten gal took : 8 ms
[2025-06-05 14:53:56] [INFO ] Flatten gal took : 9 ms
[2025-06-05 14:53:56] [INFO ] Time to serialize gal into /tmp/CTLFireability4380338990204684401.gal : 3 ms
[2025-06-05 14:53:56] [INFO ] Time to serialize properties into /tmp/CTLFireability9174447123162944970.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4380338990204684401.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9174447123162944970.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,136777,0.628698,14928,2,2361,5,32980,6,0,1193,54830,0


Converting to forward existential form...Done !
original formula: EX(EG((((AG((p94==0)) + EF((p272==0))) + ((p135==1) + (E(((p50==1)&&(p172==1)) U (p33==1)) * (EX((p134==1)) + (p283==0))))) + ((((p120==1...207
=> equivalent forward existential formula: [FwdG(EY(Init),(((!(E(TRUE U !((p94==0)))) + E(TRUE U (p272==0))) + ((p135==1) + (E(((p50==1)&&(p172==1)) U (p33...268
Reverse transition relation is NOT exact ! Due to transitions t17, t23, t44, t53, t87, t88, t89, t122, t123, t124, t125, t141, t150, t184, t185, t186, t219...287
(forward)formula 0,1,10.2366,247208,1,0,466,1.49778e+06,578,291,7227,990970,687
FORMULA StigmergyElection-PT-02b-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2025-06-05 14:54:07] [INFO ] Flatten gal took : 6 ms
[2025-06-05 14:54:07] [INFO ] Flatten gal took : 5 ms
Total runtime 897682 ms.

BK_STOP 1749135247349

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="StigmergyElection-PT-02b"
export BK_EXAMINATION="CTLFireability"
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 StigmergyElection-PT-02b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-smll-174903490900170"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-02b.tgz
mv StigmergyElection-PT-02b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;