fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r098-tall-177955695500410
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for DLCflexbar-PT-3a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
517.796 690457.00 820477.00 10343.50 FFFFTFFFTTTFFTTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695500410.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is DLCflexbar-PT-3a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695500410
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.4K Mar 6 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 6 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 6 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 09:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 15 09:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Mar 6 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Mar 6 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 996K Mar 3 18:30 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 DLCflexbar-PT-3a-CTLFireability-2024-00
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-2024-01
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-2024-02
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-2024-03
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-2024-04
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-2024-05
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-2024-06
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-2024-07
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-2024-08
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-2024-09
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-2024-10
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-2024-11
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-2024-12
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-2024-13
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-2024-14
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779608223190

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCflexbar-PT-3a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-24 07:37:04] [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]
[2026-05-24 07:37:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 07:37:04] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2026-05-24 07:37:04] [INFO ] Transformed 581 places.
[2026-05-24 07:37:04] [INFO ] Transformed 3891 transitions.
[2026-05-24 07:37:04] [INFO ] Found NUPN structural information;
[2026-05-24 07:37:04] [INFO ] Parsed PT model containing 581 places and 3891 transitions and 14956 arcs in 299 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Ensure Unique test removed 455 transitions
Reduce redundant transitions removed 455 transitions.
Support contains 162 out of 581 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 581/581 places, 3436/3436 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 539 transition count 3154
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 539 transition count 3154
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 100 place count 539 transition count 3138
Drop transitions (Redundant composition of simpler transitions.) removed 1116 transitions
Redundant transition composition rules discarded 1116 transitions
Iterating global reduction 1 with 1116 rules applied. Total rules applied 1216 place count 539 transition count 2022
Applied a total of 1216 rules in 181 ms. Remains 539 /581 variables (removed 42) and now considering 2022/3436 (removed 1414) transitions.
[2026-05-24 07:37:04] [INFO ] Flow matrix only has 324 transitions (discarded 1698 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-521935145673171938.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12320805252046906462.kers'
[2026-05-24 07:37:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-521935145673171938.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12320805252046906462.kers]
Normalized transition count is 323 out of 324 initially.
Culling duplicate invariants (modulo rational): removing 320 columns.
Culled 320 columns in 0 ms.
// Phase 1: matrix 323 rows 219 cols 680 entries
Finished phase 1 with 184 SingleSign rule and 0 generalized
[2026-05-24 07:37:04] [INFO ] Computed 355 invariants in 1 ms
Computed 355 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12320805252046906462.kers
Total runtime 2 ms.
[2026-05-24 07:37:06] [INFO ] Implicit Places using invariants in 1402 ms returned [219, 221, 223, 224, 225, 228, 229, 230, 231, 232, 233, 235, 236, 237, 238, 241, 242, 243, 245, 247, 248, 249, 250, 251, 253, 254, 255, 257, 258, 262, 263, 264, 265, 267, 268, 270, 271, 273, 274, 275, 276, 277, 279, 280, 281, 282, 283, 285, 286, 288, 289, 290, 291, 292, 294, 295, 296, 297, 300, 301, 304, 305, 307, 311, 312, 314, 315, 316, 317, 318, 319, 320, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 339, 340, 341, 342, 343, 344, 345, 348, 349, 350, 351, 352, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 367, 370, 371, 372, 373, 375, 376, 377, 378, 379, 380, 382, 383, 384, 385, 386, 387, 389, 390, 391, 393, 394, 395, 396, 397, 399, 401, 403, 404, 405, 407, 409, 410, 414, 416, 417, 418, 419, 420, 421, 422, 423, 425, 428, 429, 430, 432, 434, 435, 436, 437, 439, 440, 443, 444, 445, 446, 447, 449, 451, 452, 453, 454, 456, 459, 461, 462, 464, 465, 466, 467, 468, 469, 471, 473, 474, 475, 476, 477, 479, 480, 483, 485, 486, 487, 488, 489, 492, 493, 495, 496, 499, 500, 501, 502, 503, 506, 507, 508, 509, 510, 511, 512, 513, 515, 516, 517, 518, 519, 520, 521, 523, 524, 525, 527, 528, 532, 533, 535, 536]
Discarding 231 places :
Ensure Unique test removed 1060 transitions
Reduce isomorphic transitions removed 1060 transitions.
Implicit Place search using SMT only with invariants took 1445 ms to find 231 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 308/581 places, 962/3436 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 531 transitions
Redundant transition composition rules discarded 531 transitions
Iterating global reduction 0 with 531 rules applied. Total rules applied 531 place count 308 transition count 431
Applied a total of 531 rules in 12 ms. Remains 308 /308 variables (removed 0) and now considering 431/962 (removed 531) transitions.
[2026-05-24 07:37:06] [INFO ] Flow matrix only has 324 transitions (discarded 107 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-580816746284444475.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1053586748410848883.kers'
[2026-05-24 07:37:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-580816746284444475.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1053586748410848883.kers]
Normalized transition count is 323 out of 324 initially.
Culling duplicate invariants (modulo rational): removing 89 columns.
Culled 89 columns in 0 ms.
// Phase 1: matrix 323 rows 219 cols 680 entries
Finished phase 1 with 184 SingleSign rule and 0 generalized
[2026-05-24 07:37:06] [INFO ] Computed 124 invariants in 1 ms
Computed 124 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1053586748410848883.kers
Total runtime 1 ms.
[2026-05-24 07:37:06] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-24 07:37:06] [INFO ] Flow matrix only has 324 transitions (discarded 107 similar events)
[2026-05-24 07:37:06] [INFO ] Invariant cache hit.
[2026-05-24 07:37:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:37:06] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 308/581 places, 431/3436 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1916 ms. Remains : 308/581 places, 431/3436 transitions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 431/431 transitions.
Applied a total of 0 rules in 6 ms. Remains 308 /308 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2026-05-24 07:37:06] [INFO ] Flow matrix only has 324 transitions (discarded 107 similar events)
[2026-05-24 07:37:06] [INFO ] Invariant cache hit.
[2026-05-24 07:37:06] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-24 07:37:06] [INFO ] Flow matrix only has 324 transitions (discarded 107 similar events)
[2026-05-24 07:37:06] [INFO ] Invariant cache hit.
[2026-05-24 07:37:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:37:06] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2026-05-24 07:37:06] [INFO ] Flow matrix only has 324 transitions (discarded 107 similar events)
[2026-05-24 07:37:06] [INFO ] Invariant cache hit.
[2026-05-24 07:37:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/219 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 89/308 variables, 89/124 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (OVERLAPS) 323/631 variables, 308/432 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 1/632 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/632 variables, and 433 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 124/124 constraints, State Equation: 308/308 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/219 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 89/308 variables, 89/124 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (OVERLAPS) 323/631 variables, 308/432 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 430/862 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (OVERLAPS) 1/632 variables, 1/863 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/632 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/632 variables, and 863 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 124/124 constraints, State Equation: 308/308 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Finished structural reductions in LTL mode , in 1 iterations and 60469 ms. Remains : 308/308 places, 431/431 transitions.
Support contains 162 out of 308 places after structural reductions.
[2026-05-24 07:38:07] [INFO ] Flatten gal took : 56 ms
[2026-05-24 07:38:07] [INFO ] Flatten gal took : 23 ms
[2026-05-24 07:38:07] [INFO ] Input system was already deterministic with 431 transitions.
RANDOM walk for 40000 steps (8 resets) in 1716 ms. (23 steps per ms) remains 1/93 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
[2026-05-24 07:38:07] [INFO ] Flow matrix only has 324 transitions (discarded 107 similar events)
[2026-05-24 07:38:07] [INFO ] Invariant cache hit.
[2026-05-24 07:38:07] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 288/308 variables, 119/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 323/631 variables, 308/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/632 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/632 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/632 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 632/632 variables, and 433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 124/124 constraints, State Equation: 308/308 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp49 is UNSAT
After SMT solving in domain Int declared 20/632 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 5/124 constraints, State Equation: 0/308 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 195ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-24 07:38:08] [INFO ] Flatten gal took : 16 ms
[2026-05-24 07:38:08] [INFO ] Flatten gal took : 17 ms
[2026-05-24 07:38:08] [INFO ] Input system was already deterministic with 431 transitions.
Computed a total of 90 stabilizing places and 1 stable transitions
Graph (complete) has 554 edges and 308 vertex of which 219 are kept as prefixes of interest. Removing 89 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 431/431 transitions.
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 225 transition count 431
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 109 place count 199 transition count 379
Iterating global reduction 1 with 26 rules applied. Total rules applied 135 place count 199 transition count 379
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 147 place count 199 transition count 367
Applied a total of 147 rules in 12 ms. Remains 199 /308 variables (removed 109) and now considering 367/431 (removed 64) transitions.
[2026-05-24 07:38:08] [INFO ] Flow matrix only has 286 transitions (discarded 81 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13231299094689398187.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7602458924950395540.kers'
[2026-05-24 07:38:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13231299094689398187.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7602458924950395540.kers]
Normalized transition count is 285 out of 286 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 285 rows 193 cols 604 entries
Finished phase 1 with 158 SingleSign rule and 0 generalized
[2026-05-24 07:38:08] [INFO ] Computed 41 invariants in 3 ms
Computed 41 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7602458924950395540.kers
Total runtime 4 ms.
[2026-05-24 07:38:08] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 07:38:08] [INFO ] Flow matrix only has 286 transitions (discarded 81 similar events)
[2026-05-24 07:38:08] [INFO ] Invariant cache hit.
[2026-05-24 07:38:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:38:08] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2026-05-24 07:38:08] [INFO ] Flow matrix only has 286 transitions (discarded 81 similar events)
[2026-05-24 07:38:08] [INFO ] Invariant cache hit.
[2026-05-24 07:38:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (OVERLAPS) 6/199 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 285/484 variables, 199/240 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (OVERLAPS) 1/485 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 9 (OVERLAPS) 0/485 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 366 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 241 constraints, problems are : Problem set: 0 solved, 366 unsolved in 26850 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 199/199 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (OVERLAPS) 6/199 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 285/484 variables, 199/240 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 366/606 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 8 (OVERLAPS) 1/485 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 10 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 366 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 366 unsolved in 25275 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 199/199 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52160ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 52163ms
Starting structural reductions in LTL mode, iteration 1 : 199/308 places, 367/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52316 ms. Remains : 199/308 places, 367/431 transitions.
[2026-05-24 07:39:00] [INFO ] Flatten gal took : 13 ms
[2026-05-24 07:39:00] [INFO ] Flatten gal took : 9 ms
[2026-05-24 07:39:00] [INFO ] Input system was already deterministic with 367 transitions.
[2026-05-24 07:39:00] [INFO ] Flatten gal took : 9 ms
[2026-05-24 07:39:00] [INFO ] Flatten gal took : 9 ms
[2026-05-24 07:39:00] [INFO ] Time to serialize gal into /tmp/CTLFireability246728670405024355.gal : 6 ms
[2026-05-24 07:39:00] [INFO ] Time to serialize properties into /tmp/CTLFireability676793979961645384.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability246728670405024355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability676793979961645384.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
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,4.39453e+25,0.062031,5480,2,555,5,2133,6,0,1065,1466,0


Converting to forward existential form...Done !
original formula: AG(AX(((A(!((((p42==1)&&(p235==1))&&(p434==1))) U (((p93==1)||((p198==1)&&(p497==1)))&&(!((p218==1)&&(p308==1))))) + AF(((p189==1)&&(p314...221
=> equivalent forward existential formula: [FwdG(((EY(FwdU(Init,TRUE)) * !((EX(((p210==1)&&(p380==1))) + ((p240==1)&&(p396==1))))) * !(!((E(!((((p93==1)||(...434
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 357/0/10
Hit Full ! (commute/partial/dont) 360/0/7
(forward)formula 0,0,0.274622,12712,1,0,17,44558,34,5,5048,7907,18
FORMULA DLCflexbar-PT-3a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 431/431 transitions.
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 224 transition count 431
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 109 place count 199 transition count 381
Iterating global reduction 1 with 25 rules applied. Total rules applied 134 place count 199 transition count 381
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 147 place count 199 transition count 368
Applied a total of 147 rules in 16 ms. Remains 199 /308 variables (removed 109) and now considering 368/431 (removed 63) transitions.
[2026-05-24 07:39:01] [INFO ] Flow matrix only has 286 transitions (discarded 82 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15522571229700784068.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13653246998002406139.kers'
[2026-05-24 07:39:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15522571229700784068.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13653246998002406139.kers]
Normalized transition count is 285 out of 286 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 285 rows 194 cols 604 entries
Finished phase 1 with 159 SingleSign rule and 0 generalized
[2026-05-24 07:39:01] [INFO ] Computed 40 invariants in 0 ms
Computed 40 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13653246998002406139.kers
Total runtime 1 ms.
[2026-05-24 07:39:01] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-24 07:39:01] [INFO ] Flow matrix only has 286 transitions (discarded 82 similar events)
[2026-05-24 07:39:01] [INFO ] Invariant cache hit.
[2026-05-24 07:39:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:39:01] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2026-05-24 07:39:01] [INFO ] Flow matrix only has 286 transitions (discarded 82 similar events)
[2026-05-24 07:39:01] [INFO ] Invariant cache hit.
[2026-05-24 07:39:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/194 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (OVERLAPS) 5/199 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 285/484 variables, 199/239 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 1/485 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 9 (OVERLAPS) 0/485 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 367 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 240 constraints, problems are : Problem set: 0 solved, 367 unsolved in 26596 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 199/199 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/194 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (OVERLAPS) 5/199 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 285/484 variables, 199/239 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 367/606 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (OVERLAPS) 1/485 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 10 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 367 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 367 unsolved in 24418 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 199/199 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51049ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 51050ms
Starting structural reductions in LTL mode, iteration 1 : 199/308 places, 368/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51224 ms. Remains : 199/308 places, 368/431 transitions.
[2026-05-24 07:39:52] [INFO ] Flatten gal took : 9 ms
[2026-05-24 07:39:52] [INFO ] Flatten gal took : 8 ms
[2026-05-24 07:39:52] [INFO ] Input system was already deterministic with 368 transitions.
[2026-05-24 07:39:52] [INFO ] Flatten gal took : 8 ms
[2026-05-24 07:39:52] [INFO ] Flatten gal took : 10 ms
[2026-05-24 07:39:52] [INFO ] Time to serialize gal into /tmp/CTLFireability2407440313403590686.gal : 6 ms
[2026-05-24 07:39:52] [INFO ] Time to serialize properties into /tmp/CTLFireability5743024786090037846.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2407440313403590686.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5743024786090037846.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,4.63486e+25,0.051343,5572,2,556,5,2140,6,0,1068,1471,0


Converting to forward existential form...Done !
original formula: AG((AG((((p244==0)||(p576==0)) * EX(((p231==0)||(p572==0))))) + EG(!(A((((p7==1)&&(p262==1))&&(p242==1)) U (((p113==1)&&(p473==1))&&((p25...178
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * !(EG(!(!((E(!((((p113==1)&&(p473==1))&&((p259==1)&&(p539==1)))) U (!((((p7==1)&&(p262...638
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 355/0/13
Using saturation style SCC detection
(forward)formula 0,0,0.26161,12580,1,0,14,43114,33,4,5356,6734,16
FORMULA DLCflexbar-PT-3a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 431/431 transitions.
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 227 transition count 431
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 107 place count 201 transition count 379
Iterating global reduction 1 with 26 rules applied. Total rules applied 133 place count 201 transition count 379
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 146 place count 201 transition count 366
Applied a total of 146 rules in 6 ms. Remains 201 /308 variables (removed 107) and now considering 366/431 (removed 65) transitions.
[2026-05-24 07:39:52] [INFO ] Flow matrix only has 285 transitions (discarded 81 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17622345885121806399.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5744375531099712516.kers'
[2026-05-24 07:39:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17622345885121806399.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5744375531099712516.kers]
Normalized transition count is 284 out of 285 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 284 rows 193 cols 602 entries
Finished phase 1 with 158 SingleSign rule and 0 generalized
[2026-05-24 07:39:52] [INFO ] Computed 43 invariants in 1 ms
Computed 43 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5744375531099712516.kers
Total runtime 6 ms.
[2026-05-24 07:39:52] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-24 07:39:52] [INFO ] Flow matrix only has 285 transitions (discarded 81 similar events)
[2026-05-24 07:39:52] [INFO ] Invariant cache hit.
[2026-05-24 07:39:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:39:52] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2026-05-24 07:39:52] [INFO ] Flow matrix only has 285 transitions (discarded 81 similar events)
[2026-05-24 07:39:52] [INFO ] Invariant cache hit.
[2026-05-24 07:39:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (OVERLAPS) 8/201 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 284/485 variables, 201/244 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (OVERLAPS) 1/486 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 9 (OVERLAPS) 0/486 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 365 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 245 constraints, problems are : Problem set: 0 solved, 365 unsolved in 27349 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 201/201 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (OVERLAPS) 8/201 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 284/485 variables, 201/244 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 365/609 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (OVERLAPS) 1/486 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 10 (OVERLAPS) 0/486 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 365 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 610 constraints, problems are : Problem set: 0 solved, 365 unsolved in 23691 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 201/201 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51063ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 51064ms
Starting structural reductions in LTL mode, iteration 1 : 201/308 places, 366/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51239 ms. Remains : 201/308 places, 366/431 transitions.
[2026-05-24 07:40:43] [INFO ] Flatten gal took : 12 ms
[2026-05-24 07:40:43] [INFO ] Flatten gal took : 7 ms
[2026-05-24 07:40:43] [INFO ] Input system was already deterministic with 366 transitions.
[2026-05-24 07:40:43] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:40:43] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:40:43] [INFO ] Time to serialize gal into /tmp/CTLFireability1620230859534296762.gal : 2 ms
[2026-05-24 07:40:43] [INFO ] Time to serialize properties into /tmp/CTLFireability8701196191585584167.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1620230859534296762.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8701196191585584167.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,4.11987e+25,0.05177,5572,2,559,5,2143,6,0,1066,1470,0


Converting to forward existential form...Done !
original formula: !(A((!(((!(EG(((p35==1)&&(p389==1)))) * (p217==1)) * (p288==1))) + !(E(A(((p259==1)&&(p547==1)) U ((p249==1)&&(p483==1))) U !(((p231==1)&...257
=> equivalent forward existential formula: ([(EY((FwdU(Init,!(!(EX(!(E(((p126==1)&&(p536==1)) U !((E(!(((p177==1)&&(p311==1))) U (!(((p233==1)&&(p440==1)))...812
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 362/0/4
Hit Full ! (commute/partial/dont) 359/6/7
Hit Full ! (commute/partial/dont) 356/0/10
(forward)formula 0,0,0.30023,13676,1,0,26,48976,66,15,5062,11021,32
FORMULA DLCflexbar-PT-3a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 431/431 transitions.
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 220 transition count 431
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 116 place count 192 transition count 375
Iterating global reduction 1 with 28 rules applied. Total rules applied 144 place count 192 transition count 375
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 158 place count 192 transition count 361
Applied a total of 158 rules in 12 ms. Remains 192 /308 variables (removed 116) and now considering 361/431 (removed 70) transitions.
[2026-05-24 07:40:44] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13026950757746269187.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12606536069481897952.kers'
[2026-05-24 07:40:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13026950757746269187.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12606536069481897952.kers]
Normalized transition count is 281 out of 282 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 281 rows 191 cols 596 entries
Finished phase 1 with 156 SingleSign rule and 0 generalized
[2026-05-24 07:40:44] [INFO ] Computed 36 invariants in 1 ms
Computed 36 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12606536069481897952.kers
Total runtime 2 ms.
[2026-05-24 07:40:44] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 07:40:44] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2026-05-24 07:40:44] [INFO ] Invariant cache hit.
[2026-05-24 07:40:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:40:44] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2026-05-24 07:40:44] [INFO ] Flow matrix only has 282 transitions (discarded 79 similar events)
[2026-05-24 07:40:44] [INFO ] Invariant cache hit.
[2026-05-24 07:40:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 281/473 variables, 192/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 1/474 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (OVERLAPS) 0/474 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 229 constraints, problems are : Problem set: 0 solved, 360 unsolved in 25454 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 192/192 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/191 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (OVERLAPS) 1/192 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (OVERLAPS) 281/473 variables, 192/228 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 360/588 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (OVERLAPS) 1/474 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 10 (OVERLAPS) 0/474 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 589 constraints, problems are : Problem set: 0 solved, 360 unsolved in 24327 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 192/192 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49821ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 49822ms
Starting structural reductions in LTL mode, iteration 1 : 192/308 places, 361/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49992 ms. Remains : 192/308 places, 361/431 transitions.
[2026-05-24 07:41:34] [INFO ] Flatten gal took : 20 ms
[2026-05-24 07:41:34] [INFO ] Flatten gal took : 10 ms
[2026-05-24 07:41:34] [INFO ] Input system was already deterministic with 361 transitions.
[2026-05-24 07:41:34] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:41:34] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:41:34] [INFO ] Time to serialize gal into /tmp/CTLFireability2194053733981158961.gal : 2 ms
[2026-05-24 07:41:34] [INFO ] Time to serialize properties into /tmp/CTLFireability11998163710635897161.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2194053733981158961.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11998163710635897161.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,3.05176e+25,0.046555,5536,2,539,5,2071,6,0,1048,1431,0


Converting to forward existential form...Done !
original formula: AG(EX(AF(EG(((p250==0)||(p444==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG(!(EG(((p250==0)||(p444==0)))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.188946,11020,1,0,10,38267,23,4,4569,3160,9
FORMULA DLCflexbar-PT-3a-CTLFireability-2024-03 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 : 308/308 places, 431/431 transitions.
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 226 transition count 431
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 109 place count 199 transition count 377
Iterating global reduction 1 with 27 rules applied. Total rules applied 136 place count 199 transition count 377
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 150 place count 199 transition count 363
Applied a total of 150 rules in 8 ms. Remains 199 /308 variables (removed 109) and now considering 363/431 (removed 68) transitions.
[2026-05-24 07:41:34] [INFO ] Flow matrix only has 283 transitions (discarded 80 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15514809288690973905.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5576696062090007613.kers'
[2026-05-24 07:41:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15514809288690973905.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5576696062090007613.kers]
Normalized transition count is 282 out of 283 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 282 rows 192 cols 598 entries
Finished phase 1 with 157 SingleSign rule and 0 generalized
[2026-05-24 07:41:34] [INFO ] Computed 42 invariants in 1 ms
Computed 42 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5576696062090007613.kers
Total runtime 1 ms.
[2026-05-24 07:41:34] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-24 07:41:34] [INFO ] Flow matrix only has 283 transitions (discarded 80 similar events)
[2026-05-24 07:41:34] [INFO ] Invariant cache hit.
[2026-05-24 07:41:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:41:34] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2026-05-24 07:41:34] [INFO ] Flow matrix only has 283 transitions (discarded 80 similar events)
[2026-05-24 07:41:34] [INFO ] Invariant cache hit.
[2026-05-24 07:41:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (OVERLAPS) 7/199 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (OVERLAPS) 282/481 variables, 199/241 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (OVERLAPS) 1/482 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 9 (OVERLAPS) 0/482 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 362 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 242 constraints, problems are : Problem set: 0 solved, 362 unsolved in 26000 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 199/199 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (OVERLAPS) 7/199 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (OVERLAPS) 282/481 variables, 199/241 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 362/603 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 8 (OVERLAPS) 1/482 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 10 (OVERLAPS) 0/482 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 362 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 604 constraints, problems are : Problem set: 0 solved, 362 unsolved in 24316 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 199/199 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50340ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 50340ms
Starting structural reductions in LTL mode, iteration 1 : 199/308 places, 363/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50504 ms. Remains : 199/308 places, 363/431 transitions.
[2026-05-24 07:42:24] [INFO ] Flatten gal took : 10 ms
[2026-05-24 07:42:24] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:42:24] [INFO ] Input system was already deterministic with 363 transitions.
[2026-05-24 07:42:24] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:42:24] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:42:24] [INFO ] Time to serialize gal into /tmp/CTLFireability2855405113385187567.gal : 2 ms
[2026-05-24 07:42:24] [INFO ] Time to serialize properties into /tmp/CTLFireability18162687294248778864.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2855405113385187567.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18162687294248778864.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,3.43323e+25,0.05067,5556,2,554,5,2122,6,0,1059,1460,0


Converting to forward existential form...Done !
original formula: EG((((!(E(((p224==1)&&(p380==1)) U EX(((p228==1)&&(p350==1))))) + !(E(!(EF(((p245==1)&&(p448==1)))) U ((EX(((p154==1)&&(p484==1))) + (p96...247
=> equivalent forward existential formula: [FwdG(Init,(((!(E(((p224==1)&&(p380==1)) U EX(((p228==1)&&(p350==1))))) + !(E(!(E(TRUE U ((p245==1)&&(p448==1)))...296
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 359/4/4
(forward)formula 0,1,0.258328,12736,1,0,21,45314,35,9,5000,8894,27
FORMULA DLCflexbar-PT-3a-CTLFireability-2024-04 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 : 308/308 places, 431/431 transitions.
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 232 transition count 431
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 101 place count 207 transition count 381
Iterating global reduction 1 with 25 rules applied. Total rules applied 126 place count 207 transition count 381
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 139 place count 207 transition count 368
Applied a total of 139 rules in 4 ms. Remains 207 /308 variables (removed 101) and now considering 368/431 (removed 63) transitions.
[2026-05-24 07:42:25] [INFO ] Flow matrix only has 286 transitions (discarded 82 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14092610163834188114.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8921910041860838744.kers'
[2026-05-24 07:42:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14092610163834188114.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8921910041860838744.kers]
Normalized transition count is 285 out of 286 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 285 rows 194 cols 604 entries
Finished phase 1 with 159 SingleSign rule and 0 generalized
[2026-05-24 07:42:25] [INFO ] Computed 48 invariants in 2 ms
Computed 48 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8921910041860838744.kers
Total runtime 7 ms.
[2026-05-24 07:42:25] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-24 07:42:25] [INFO ] Flow matrix only has 286 transitions (discarded 82 similar events)
[2026-05-24 07:42:25] [INFO ] Invariant cache hit.
[2026-05-24 07:42:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:42:25] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2026-05-24 07:42:25] [INFO ] Flow matrix only has 286 transitions (discarded 82 similar events)
[2026-05-24 07:42:25] [INFO ] Invariant cache hit.
[2026-05-24 07:42:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/194 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (OVERLAPS) 13/207 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 285/492 variables, 207/255 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 1/493 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 9 (OVERLAPS) 0/493 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 367 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 256 constraints, problems are : Problem set: 0 solved, 367 unsolved in 27695 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 207/207 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/194 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (OVERLAPS) 13/207 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 285/492 variables, 207/255 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 367/622 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (OVERLAPS) 1/493 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/493 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 10 (OVERLAPS) 0/493 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 367 unsolved
No progress, stopping.
After SMT solving in domain Int declared 493/493 variables, and 623 constraints, problems are : Problem set: 0 solved, 367 unsolved in 25041 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 207/207 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52757ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 52758ms
Starting structural reductions in LTL mode, iteration 1 : 207/308 places, 368/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52908 ms. Remains : 207/308 places, 368/431 transitions.
[2026-05-24 07:43:18] [INFO ] Flatten gal took : 10 ms
[2026-05-24 07:43:18] [INFO ] Flatten gal took : 7 ms
[2026-05-24 07:43:18] [INFO ] Input system was already deterministic with 368 transitions.
[2026-05-24 07:43:18] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:43:18] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:43:18] [INFO ] Time to serialize gal into /tmp/CTLFireability1401211118643357525.gal : 1 ms
[2026-05-24 07:43:18] [INFO ] Time to serialize properties into /tmp/CTLFireability6619739690833535513.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1401211118643357525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6619739690833535513.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,4.63486e+25,0.053075,5584,2,572,5,2189,6,0,1076,1498,0


Converting to forward existential form...Done !
original formula: EG((A((((p219==1)&&(p269==1)) + E((((p140==1)&&(p480==1))&&(p147==1)) U !(((p214==1)&&(p268==1))))) U (!((!(((p84==1)&&(p344==1))) + AG((...465
=> equivalent forward existential formula: [FwdG(Init,(!((E(!((!((!(((p84==1)&&(p344==1))) + !(E(TRUE U !(((p7==1)&&(p442==1))))))) + (!(!(EX(!(((p43==1)&&...999
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 366/0/2
Hit Full ! (commute/partial/dont) 364/4/4
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 355/24/13
Using saturation style SCC detection
(forward)formula 0,0,0.347818,14900,1,0,49,56352,92,29,5621,17087,52
FORMULA DLCflexbar-PT-3a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 431/431 transitions.
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 230 transition count 431
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 105 place count 203 transition count 377
Iterating global reduction 1 with 27 rules applied. Total rules applied 132 place count 203 transition count 377
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 145 place count 203 transition count 364
Applied a total of 145 rules in 9 ms. Remains 203 /308 variables (removed 105) and now considering 364/431 (removed 67) transitions.
[2026-05-24 07:43:18] [INFO ] Flow matrix only has 284 transitions (discarded 80 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5968894466948940639.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18386388454898818232.kers'
[2026-05-24 07:43:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5968894466948940639.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18386388454898818232.kers]
Normalized transition count is 283 out of 284 initially.
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 283 rows 192 cols 600 entries
Finished phase 1 with 157 SingleSign rule and 0 generalized
[2026-05-24 07:43:18] [INFO ] Computed 46 invariants in 0 ms
Computed 46 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18386388454898818232.kers
Total runtime 1 ms.
[2026-05-24 07:43:18] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 07:43:18] [INFO ] Flow matrix only has 284 transitions (discarded 80 similar events)
[2026-05-24 07:43:18] [INFO ] Invariant cache hit.
[2026-05-24 07:43:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:43:18] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2026-05-24 07:43:18] [INFO ] Flow matrix only has 284 transitions (discarded 80 similar events)
[2026-05-24 07:43:18] [INFO ] Invariant cache hit.
[2026-05-24 07:43:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (OVERLAPS) 11/203 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 283/486 variables, 203/249 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 1/487 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 9 (OVERLAPS) 0/487 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 250 constraints, problems are : Problem set: 0 solved, 363 unsolved in 26862 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 203/203 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (OVERLAPS) 11/203 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (OVERLAPS) 283/486 variables, 203/249 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 363/612 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (OVERLAPS) 1/487 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 10 (OVERLAPS) 0/487 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 363 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 613 constraints, problems are : Problem set: 0 solved, 363 unsolved in 23851 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 203/203 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50736ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 50736ms
Starting structural reductions in LTL mode, iteration 1 : 203/308 places, 364/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50884 ms. Remains : 203/308 places, 364/431 transitions.
[2026-05-24 07:44:09] [INFO ] Flatten gal took : 8 ms
[2026-05-24 07:44:09] [INFO ] Flatten gal took : 7 ms
[2026-05-24 07:44:09] [INFO ] Input system was already deterministic with 364 transitions.
[2026-05-24 07:44:09] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:44:09] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:44:09] [INFO ] Time to serialize gal into /tmp/CTLFireability18268764864189657718.gal : 1 ms
[2026-05-24 07:44:09] [INFO ] Time to serialize properties into /tmp/CTLFireability6491457403220820819.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18268764864189657718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6491457403220820819.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,3.66211e+25,0.053183,5568,2,562,5,2147,6,0,1064,1471,0


Converting to forward existential form...Done !
original formula: ((AX(AG((((((p239==0)||(p395==0))||((p239==0)||(p430==0)))&&((p56==0)||(p276==0)))&&(((p51==0)||(p335==0))&&((p189==0)||(p314==0)))))) + ...353
=> equivalent forward existential formula: [(FwdU(EY(((Init * !((E(TRUE U !(E(TRUE U !((p68==1))))) * EX(((((p112==0)||(p352==0))||((p260==0)||(p579==0)))|...449
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.257564,12628,1,0,13,44044,21,3,5075,5853,14
FORMULA DLCflexbar-PT-3a-CTLFireability-2024-06 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 : 308/308 places, 431/431 transitions.
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 227 transition count 431
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 106 place count 202 transition count 381
Iterating global reduction 1 with 25 rules applied. Total rules applied 131 place count 202 transition count 381
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 144 place count 202 transition count 368
Applied a total of 144 rules in 9 ms. Remains 202 /308 variables (removed 106) and now considering 368/431 (removed 63) transitions.
[2026-05-24 07:44:09] [INFO ] Flow matrix only has 286 transitions (discarded 82 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16736800802208627753.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1893081294606133500.kers'
[2026-05-24 07:44:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16736800802208627753.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1893081294606133500.kers]
Normalized transition count is 285 out of 286 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 285 rows 194 cols 604 entries
Finished phase 1 with 159 SingleSign rule and 0 generalized
[2026-05-24 07:44:09] [INFO ] Computed 43 invariants in 3 ms
Computed 43 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1893081294606133500.kers
Total runtime 4 ms.
[2026-05-24 07:44:09] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-24 07:44:09] [INFO ] Flow matrix only has 286 transitions (discarded 82 similar events)
[2026-05-24 07:44:09] [INFO ] Invariant cache hit.
[2026-05-24 07:44:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:44:09] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2026-05-24 07:44:09] [INFO ] Flow matrix only has 286 transitions (discarded 82 similar events)
[2026-05-24 07:44:09] [INFO ] Invariant cache hit.
[2026-05-24 07:44:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/194 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (OVERLAPS) 8/202 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 285/487 variables, 202/245 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 1/488 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 9 (OVERLAPS) 0/488 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 367 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 246 constraints, problems are : Problem set: 0 solved, 367 unsolved in 26715 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 202/202 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (OVERLAPS) 1/194 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (OVERLAPS) 8/202 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (OVERLAPS) 285/487 variables, 202/245 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 367/612 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (OVERLAPS) 1/488 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 10 (OVERLAPS) 0/488 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 367 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 613 constraints, problems are : Problem set: 0 solved, 367 unsolved in 24002 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, State Equation: 202/202 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50735ms problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 50735ms
Starting structural reductions in LTL mode, iteration 1 : 202/308 places, 368/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50891 ms. Remains : 202/308 places, 368/431 transitions.
[2026-05-24 07:45:00] [INFO ] Flatten gal took : 9 ms
[2026-05-24 07:45:00] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:45:00] [INFO ] Input system was already deterministic with 368 transitions.
[2026-05-24 07:45:00] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:45:00] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:45:00] [INFO ] Time to serialize gal into /tmp/CTLFireability16247395259542708683.gal : 1 ms
[2026-05-24 07:45:00] [INFO ] Time to serialize properties into /tmp/CTLFireability16572728685751987066.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16247395259542708683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16572728685751987066.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,4.63486e+25,0.061579,5580,2,562,5,2157,6,0,1071,1478,0


Converting to forward existential form...Done !
original formula: (AG((E((AX(((p213==1)&&(p288==1))) + !((((p259==1)&&(p540==1))&&((p213==1)&&(p276==1))))) U ((p247==1)&&(p492==1))) * E(!(A(((p258==1)&&(...268
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E((!(EX(!(((p213==1)&&(p288==1))))) + !((((p259==1)&&(p540==1))&&((p213==1)&&(p276==1)))...468
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 364/0/4
(forward)formula 0,0,0.260069,12464,1,0,15,45467,41,8,4767,8067,20
FORMULA DLCflexbar-PT-3a-CTLFireability-2024-07 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 : 308/308 places, 431/431 transitions.
Graph (trivial) has 417 edges and 308 vertex of which 210 / 308 are part of one of the 34 SCC in 5 ms
Free SCC test removed 176 places
Ensure Unique test removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Graph (complete) has 176 edges and 132 vertex of which 46 are kept as prefixes of interest. Removing 86 places using SCC suffix rule.0 ms
Discarding 86 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 46 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 52
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 36 place count 13 transition count 19
Iterating global reduction 2 with 32 rules applied. Total rules applied 68 place count 13 transition count 19
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 2 with 2 rules applied. Total rules applied 70 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 12 transition count 16
Applied a total of 72 rules in 18 ms. Remains 12 /308 variables (removed 296) and now considering 16/431 (removed 415) transitions.
[2026-05-24 07:45:00] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14466304070177068360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9372505849234249680.kers'
[2026-05-24 07:45:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14466304070177068360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9372505849234249680.kers]
Normalized transition count is 9 out of 10 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 9 rows 8 cols 20 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-24 07:45:00] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9372505849234249680.kers
Total runtime 0 ms.
[2026-05-24 07:45:00] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-24 07:45:00] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
[2026-05-24 07:45:00] [INFO ] Invariant cache hit.
[2026-05-24 07:45:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:45:01] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2026-05-24 07:45:01] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2026-05-24 07:45:01] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
[2026-05-24 07:45:01] [INFO ] Invariant cache hit.
[2026-05-24 07:45:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 9/21 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/22 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 20 constraints, problems are : Problem set: 0 solved, 15 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 9/21 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 15/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/22 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/22 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 339ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 340ms
Starting structural reductions in SI_CTL mode, iteration 1 : 12/308 places, 16/431 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 408 ms. Remains : 12/308 places, 16/431 transitions.
[2026-05-24 07:45:01] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:45:01] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:45:01] [INFO ] Input system was already deterministic with 16 transitions.
[2026-05-24 07:45:01] [INFO ] Flatten gal took : 0 ms
[2026-05-24 07:45:01] [INFO ] Flatten gal took : 0 ms
[2026-05-24 07:45:01] [INFO ] Time to serialize gal into /tmp/CTLFireability12751466180435862482.gal : 0 ms
[2026-05-24 07:45:01] [INFO ] Time to serialize properties into /tmp/CTLFireability6586181290839295631.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12751466180435862482.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6586181290839295631.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,13,0.002995,3812,2,26,5,86,6,0,48,55,0


Converting to forward existential form...Done !
original formula: EG((((p109==0)||(p411==0)) + (EG(((p35==1)&&(p450==1))) * AF(((p18==1)&&(p505==1))))))
=> equivalent forward existential formula: [FwdG(Init,(((p109==0)||(p411==0)) + (EG(((p35==1)&&(p450==1))) * !(EG(!(((p18==1)&&(p505==1))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.006653,4360,1,0,19,334,31,12,237,411,20
FORMULA DLCflexbar-PT-3a-CTLFireability-2024-08 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 : 308/308 places, 431/431 transitions.
Graph (trivial) has 408 edges and 308 vertex of which 203 / 308 are part of one of the 33 SCC in 1 ms
Free SCC test removed 170 places
Ensure Unique test removed 366 transitions
Reduce isomorphic transitions removed 366 transitions.
Graph (complete) has 188 edges and 138 vertex of which 53 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.1 ms
Discarding 85 places :
Also discarding 0 output transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 53 transition count 62
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 50 transition count 62
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 39 place count 19 transition count 29
Iterating global reduction 2 with 31 rules applied. Total rules applied 70 place count 19 transition count 29
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 19 transition count 26
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 75 place count 18 transition count 25
Applied a total of 75 rules in 6 ms. Remains 18 /308 variables (removed 290) and now considering 25/431 (removed 406) transitions.
[2026-05-24 07:45:01] [INFO ] Flow matrix only has 16 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7491297572826921564.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7597632154706693595.kers'
[2026-05-24 07:45:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7491297572826921564.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7597632154706693595.kers]
Normalized transition count is 15 out of 16 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 15 rows 13 cols 34 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-24 07:45:01] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7597632154706693595.kers
Total runtime 0 ms.
[2026-05-24 07:45:01] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-24 07:45:01] [INFO ] Flow matrix only has 16 transitions (discarded 9 similar events)
[2026-05-24 07:45:01] [INFO ] Invariant cache hit.
[2026-05-24 07:45:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:45:01] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2026-05-24 07:45:01] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2026-05-24 07:45:01] [INFO ] Flow matrix only has 16 transitions (discarded 9 similar events)
[2026-05-24 07:45:01] [INFO ] Invariant cache hit.
[2026-05-24 07:45:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 4/18 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 15/33 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 1/34 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 0/34 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 29 constraints, problems are : Problem set: 0 solved, 24 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 4/18 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 15/33 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 24/52 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/34 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/34 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 53 constraints, problems are : Problem set: 0 solved, 24 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 615ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 615ms
Starting structural reductions in SI_CTL mode, iteration 1 : 18/308 places, 25/431 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 667 ms. Remains : 18/308 places, 25/431 transitions.
[2026-05-24 07:45:02] [INFO ] Flatten gal took : 2 ms
[2026-05-24 07:45:02] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:45:02] [INFO ] Input system was already deterministic with 25 transitions.
[2026-05-24 07:45:02] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:45:02] [INFO ] Flatten gal took : 0 ms
[2026-05-24 07:45:02] [INFO ] Time to serialize gal into /tmp/CTLFireability6096578157706968492.gal : 0 ms
[2026-05-24 07:45:02] [INFO ] Time to serialize properties into /tmp/CTLFireability3884687352656042894.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6096578157706968492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3884687352656042894.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,73,0.008552,3856,2,40,5,132,6,0,75,84,0


Converting to forward existential form...Done !
original formula: AF(E(((p234==1)&&(p410==1)) U (!((A(((p126==1)&&(p355==1)) U ((p257==1)&&(p524==1))) * AG((p168==1)))) * AG(EF(((p221==1)&&(p348==1))))))...156
=> equivalent forward existential formula: [FwdG(Init,!(E(((p234==1)&&(p410==1)) U (!((!((E(!(((p257==1)&&(p524==1))) U (!(((p126==1)&&(p355==1))) * !(((p2...304
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 21/4/4
(forward)formula 0,1,0.016511,4392,1,0,9,437,35,0,402,182,14
FORMULA DLCflexbar-PT-3a-CTLFireability-2024-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 : 308/308 places, 431/431 transitions.
Graph (trivial) has 427 edges and 308 vertex of which 217 / 308 are part of one of the 35 SCC in 1 ms
Free SCC test removed 182 places
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Graph (complete) has 162 edges and 126 vertex of which 38 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.0 ms
Discarding 88 places :
Also discarding 0 output transitions
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 35 place count 5 transition count 6
Iterating global reduction 0 with 33 rules applied. Total rules applied 68 place count 5 transition count 6
Applied a total of 68 rules in 3 ms. Remains 5 /308 variables (removed 303) and now considering 6/431 (removed 425) transitions.
[2026-05-24 07:45:02] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17023561631127881486.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17844952107656001742.kers'
[2026-05-24 07:45:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17023561631127881486.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17844952107656001742.kers]
Normalized transition count is 3 out of 4 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 3 rows 3 cols 6 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-24 07:45:02] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17844952107656001742.kers
Total runtime 0 ms.
[2026-05-24 07:45:02] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-24 07:45:02] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2026-05-24 07:45:02] [INFO ] Invariant cache hit.
[2026-05-24 07:45:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:45:02] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2026-05-24 07:45:02] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-24 07:45:02] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2026-05-24 07:45:02] [INFO ] Invariant cache hit.
[2026-05-24 07:45:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/9 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/5 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/9 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/9 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 117ms
Starting structural reductions in SI_CTL mode, iteration 1 : 5/308 places, 6/431 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 161 ms. Remains : 5/308 places, 6/431 transitions.
[2026-05-24 07:45:02] [INFO ] Flatten gal took : 0 ms
[2026-05-24 07:45:02] [INFO ] Flatten gal took : 0 ms
[2026-05-24 07:45:02] [INFO ] Input system was already deterministic with 6 transitions.
[2026-05-24 07:45:02] [INFO ] Flatten gal took : 0 ms
[2026-05-24 07:45:02] [INFO ] Flatten gal took : 0 ms
[2026-05-24 07:45:02] [INFO ] Time to serialize gal into /tmp/CTLFireability10146918232693193104.gal : 0 ms
[2026-05-24 07:45:02] [INFO ] Time to serialize properties into /tmp/CTLFireability13815972021166924571.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10146918232693193104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13815972021166924571.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,3,0.004367,3748,2,10,5,30,6,0,20,16,0


Converting to forward existential form...Done !
original formula: EG(AG(EF(((p57==1)&&(p457==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U ((p57==1)&&(p457==1)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.00649,4044,1,0,7,54,18,1,96,38,11
FORMULA DLCflexbar-PT-3a-CTLFireability-2024-10 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 : 308/308 places, 431/431 transitions.
Graph (trivial) has 417 edges and 308 vertex of which 210 / 308 are part of one of the 35 SCC in 1 ms
Free SCC test removed 175 places
Ensure Unique test removed 375 transitions
Reduce isomorphic transitions removed 375 transitions.
Graph (complete) has 179 edges and 133 vertex of which 46 are kept as prefixes of interest. Removing 87 places using SCC suffix rule.1 ms
Discarding 87 places :
Also discarding 0 output 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 0 with 1 rules applied. Total rules applied 3 place count 46 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 55
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 37 place count 12 transition count 21
Iterating global reduction 2 with 33 rules applied. Total rules applied 70 place count 12 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 12 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 12 transition count 19
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 11 transition count 18
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 11 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 11 transition count 17
Applied a total of 76 rules in 9 ms. Remains 11 /308 variables (removed 297) and now considering 17/431 (removed 414) transitions.
[2026-05-24 07:45:02] [INFO ] Flow matrix only has 11 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1657837032148636863.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-914426030705587926.kers'
[2026-05-24 07:45:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1657837032148636863.kers, --Pflows, --basisKERS=/tmp/petrispot-output-914426030705587926.kers]
Normalized transition count is 10 out of 11 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 10 rows 8 cols 21 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-24 07:45:02] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-914426030705587926.kers
Total runtime 0 ms.
[2026-05-24 07:45:02] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-24 07:45:02] [INFO ] Flow matrix only has 11 transitions (discarded 6 similar events)
[2026-05-24 07:45:02] [INFO ] Invariant cache hit.
[2026-05-24 07:45:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:45:02] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2026-05-24 07:45:02] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2026-05-24 07:45:02] [INFO ] Flow matrix only has 11 transitions (discarded 6 similar events)
[2026-05-24 07:45:02] [INFO ] Invariant cache hit.
[2026-05-24 07:45:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/22 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/22 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 17 constraints, problems are : Problem set: 0 solved, 16 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 1/22 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/22 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 33 constraints, problems are : Problem set: 0 solved, 16 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 355ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 356ms
Starting structural reductions in SI_CTL mode, iteration 1 : 11/308 places, 17/431 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 420 ms. Remains : 11/308 places, 17/431 transitions.
[2026-05-24 07:45:02] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:45:02] [INFO ] Flatten gal took : 1 ms
[2026-05-24 07:45:02] [INFO ] Input system was already deterministic with 17 transitions.
[2026-05-24 07:45:02] [INFO ] Flatten gal took : 0 ms
[2026-05-24 07:45:02] [INFO ] Flatten gal took : 0 ms
[2026-05-24 07:45:02] [INFO ] Time to serialize gal into /tmp/CTLFireability5888134688860919382.gal : 0 ms
[2026-05-24 07:45:02] [INFO ] Time to serialize properties into /tmp/CTLFireability1404815679453631944.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5888134688860919382.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1404815679453631944.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,11,0.006055,3812,2,22,5,83,6,0,48,53,0


Converting to forward existential form...Done !
original formula: A(EF(((p259==1)&&(p523==1))) U AF(((p213==1)&&(p294==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((p213==1)&&(p294==1))))))))) * !(E(!(!(EG(!(((p213==1)&&(p294==1)))))) U (!(E(TRUE U ((...229
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.009777,4352,1,0,10,260,29,2,249,201,11
FORMULA DLCflexbar-PT-3a-CTLFireability-2024-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 : 308/308 places, 431/431 transitions.
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 229 transition count 431
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 101 place count 207 transition count 387
Iterating global reduction 1 with 22 rules applied. Total rules applied 123 place count 207 transition count 387
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 135 place count 207 transition count 375
Applied a total of 135 rules in 9 ms. Remains 207 /308 variables (removed 101) and now considering 375/431 (removed 56) transitions.
[2026-05-24 07:45:02] [INFO ] Flow matrix only has 290 transitions (discarded 85 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1572553285302097491.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11338270043878315775.kers'
[2026-05-24 07:45:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1572553285302097491.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11338270043878315775.kers]
Normalized transition count is 289 out of 290 initially.
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 289 rows 197 cols 612 entries
Finished phase 1 with 162 SingleSign rule and 0 generalized
[2026-05-24 07:45:02] [INFO ] Computed 45 invariants in 1 ms
Computed 45 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11338270043878315775.kers
Total runtime 1 ms.
[2026-05-24 07:45:02] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-24 07:45:02] [INFO ] Flow matrix only has 290 transitions (discarded 85 similar events)
[2026-05-24 07:45:02] [INFO ] Invariant cache hit.
[2026-05-24 07:45:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:45:02] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 374 sub problems to find dead transitions.
[2026-05-24 07:45:02] [INFO ] Flow matrix only has 290 transitions (discarded 85 similar events)
[2026-05-24 07:45:02] [INFO ] Invariant cache hit.
[2026-05-24 07:45:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (OVERLAPS) 10/207 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (OVERLAPS) 289/496 variables, 207/252 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 7 (OVERLAPS) 1/497 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 9 (OVERLAPS) 0/497 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 374 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 253 constraints, problems are : Problem set: 0 solved, 374 unsolved in 28136 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 207/207 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (OVERLAPS) 10/207 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (OVERLAPS) 289/496 variables, 207/252 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 374/626 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 8 (OVERLAPS) 1/497 variables, 1/627 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 10 (OVERLAPS) 0/497 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 374 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 627 constraints, problems are : Problem set: 0 solved, 374 unsolved in 25239 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 207/207 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53396ms problems are : Problem set: 0 solved, 374 unsolved
Search for dead transitions found 0 dead transitions in 53396ms
Starting structural reductions in LTL mode, iteration 1 : 207/308 places, 375/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53560 ms. Remains : 207/308 places, 375/431 transitions.
[2026-05-24 07:45:56] [INFO ] Flatten gal took : 11 ms
[2026-05-24 07:45:56] [INFO ] Flatten gal took : 6 ms
[2026-05-24 07:45:56] [INFO ] Input system was already deterministic with 375 transitions.
[2026-05-24 07:45:56] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:45:56] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:45:56] [INFO ] Time to serialize gal into /tmp/CTLFireability8569778424092357594.gal : 1 ms
[2026-05-24 07:45:56] [INFO ] Time to serialize properties into /tmp/CTLFireability3971812815064671548.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8569778424092357594.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3971812815064671548.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,8.00903e+25,0.052425,5616,2,575,5,2217,6,0,1089,1513,0


Converting to forward existential form...Done !
original formula: E(!(AG(E(AX(((p151==1)&&(p423==1))) U (AG(((p123==1)&&(p475==1))) * (p9==1))))) U (A(EX(AX(((p248==1)&&(p500==1)))) U ((AG(EX(((p250==1)&...353
=> equivalent forward existential formula: ([(((FwdU((FwdU(Init,!(!(E(TRUE U !(E(!(EX(!(((p151==1)&&(p423==1))))) U (!(E(TRUE U !(((p123==1)&&(p475==1)))))...1126
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 371/0/4
Hit Full ! (commute/partial/dont) 372/3/3
(forward)formula 0,0,0.260988,13048,1,0,19,42967,49,2,4898,3949,29
FORMULA DLCflexbar-PT-3a-CTLFireability-2024-12 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 : 308/308 places, 431/431 transitions.
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 225 transition count 431
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 109 place count 199 transition count 379
Iterating global reduction 1 with 26 rules applied. Total rules applied 135 place count 199 transition count 379
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 148 place count 199 transition count 366
Applied a total of 148 rules in 9 ms. Remains 199 /308 variables (removed 109) and now considering 366/431 (removed 65) transitions.
[2026-05-24 07:45:56] [INFO ] Flow matrix only has 285 transitions (discarded 81 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12765331251554113384.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8914461807870702869.kers'
[2026-05-24 07:45:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12765331251554113384.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8914461807870702869.kers]
Normalized transition count is 284 out of 285 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 284 rows 193 cols 602 entries
Finished phase 1 with 158 SingleSign rule and 0 generalized
[2026-05-24 07:45:56] [INFO ] Computed 41 invariants in 1 ms
Computed 41 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8914461807870702869.kers
Total runtime 2 ms.
[2026-05-24 07:45:56] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 07:45:56] [INFO ] Flow matrix only has 285 transitions (discarded 81 similar events)
[2026-05-24 07:45:56] [INFO ] Invariant cache hit.
[2026-05-24 07:45:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:45:56] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2026-05-24 07:45:56] [INFO ] Flow matrix only has 285 transitions (discarded 81 similar events)
[2026-05-24 07:45:56] [INFO ] Invariant cache hit.
[2026-05-24 07:45:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (OVERLAPS) 6/199 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 284/483 variables, 199/240 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (OVERLAPS) 1/484 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 9 (OVERLAPS) 0/484 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 365 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 241 constraints, problems are : Problem set: 0 solved, 365 unsolved in 26485 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 199/199 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/193 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (OVERLAPS) 6/199 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 284/483 variables, 199/240 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 365/605 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (OVERLAPS) 1/484 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 10 (OVERLAPS) 0/484 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 365 unsolved
No progress, stopping.
After SMT solving in domain Int declared 484/484 variables, and 606 constraints, problems are : Problem set: 0 solved, 365 unsolved in 24024 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 199/199 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50532ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 50532ms
Starting structural reductions in LTL mode, iteration 1 : 199/308 places, 366/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50675 ms. Remains : 199/308 places, 366/431 transitions.
[2026-05-24 07:46:47] [INFO ] Flatten gal took : 7 ms
[2026-05-24 07:46:47] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:46:47] [INFO ] Input system was already deterministic with 366 transitions.
[2026-05-24 07:46:47] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:46:47] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:46:47] [INFO ] Time to serialize gal into /tmp/CTLFireability7308180396372558946.gal : 1 ms
[2026-05-24 07:46:47] [INFO ] Time to serialize properties into /tmp/CTLFireability14304953030031034726.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7308180396372558946.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14304953030031034726.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,4.11987e+25,0.051725,5568,2,555,5,2132,6,0,1064,1466,0


Converting to forward existential form...Done !
original formula: AX(AG((AG(EF(((p235==1)&&(p434==1)))) + ((A((((p98==1)&&(p408==1))&&((p236==1)&&(p388==1))) U (((p99==1)&&(p469==1))&&((p259==1)&&(p556==...189
=> equivalent forward existential formula: [(FwdU((FwdU(EY(Init),TRUE) * !(((!((E(!((((p99==1)&&(p469==1))&&((p259==1)&&(p556==1)))) U (!((((p98==1)&&(p408...382
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.193336,11188,1,0,6,39235,14,0,4466,2348,5
FORMULA DLCflexbar-PT-3a-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 431/431 transitions.
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 220 transition count 431
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 115 place count 193 transition count 377
Iterating global reduction 1 with 27 rules applied. Total rules applied 142 place count 193 transition count 377
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 156 place count 193 transition count 363
Applied a total of 156 rules in 4 ms. Remains 193 /308 variables (removed 115) and now considering 363/431 (removed 68) transitions.
[2026-05-24 07:46:47] [INFO ] Flow matrix only has 283 transitions (discarded 80 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13900362476482283702.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6883459873445281332.kers'
[2026-05-24 07:46:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13900362476482283702.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6883459873445281332.kers]
Normalized transition count is 282 out of 283 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 282 rows 192 cols 598 entries
Finished phase 1 with 157 SingleSign rule and 0 generalized
[2026-05-24 07:46:47] [INFO ] Computed 36 invariants in 3 ms
Computed 36 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6883459873445281332.kers
Total runtime 4 ms.
[2026-05-24 07:46:47] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-24 07:46:47] [INFO ] Flow matrix only has 283 transitions (discarded 80 similar events)
[2026-05-24 07:46:47] [INFO ] Invariant cache hit.
[2026-05-24 07:46:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:46:47] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 362 sub problems to find dead transitions.
[2026-05-24 07:46:47] [INFO ] Flow matrix only has 283 transitions (discarded 80 similar events)
[2026-05-24 07:46:47] [INFO ] Invariant cache hit.
[2026-05-24 07:46:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (OVERLAPS) 1/193 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (OVERLAPS) 282/475 variables, 193/229 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (OVERLAPS) 1/476 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 9 (OVERLAPS) 0/476 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 362 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 230 constraints, problems are : Problem set: 0 solved, 362 unsolved in 25928 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 193/193 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (OVERLAPS) 1/193 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (OVERLAPS) 282/475 variables, 193/229 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 362/591 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 8 (OVERLAPS) 1/476 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 10 (OVERLAPS) 0/476 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 362 unsolved
No progress, stopping.
After SMT solving in domain Int declared 476/476 variables, and 592 constraints, problems are : Problem set: 0 solved, 362 unsolved in 23797 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 193/193 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49750ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 49751ms
Starting structural reductions in LTL mode, iteration 1 : 193/308 places, 363/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49897 ms. Remains : 193/308 places, 363/431 transitions.
[2026-05-24 07:47:37] [INFO ] Flatten gal took : 8 ms
[2026-05-24 07:47:37] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:47:37] [INFO ] Input system was already deterministic with 363 transitions.
[2026-05-24 07:47:37] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:47:37] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:47:37] [INFO ] Time to serialize gal into /tmp/CTLFireability14569542371310984891.gal : 1 ms
[2026-05-24 07:47:37] [INFO ] Time to serialize properties into /tmp/CTLFireability3313722813226285925.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14569542371310984891.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3313722813226285925.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,3.66211e+25,0.048755,5544,2,542,5,2086,6,0,1053,1438,0


Converting to forward existential form...Done !
original formula: EF(((AX((p60==0)) * (p229==1)) * (p341==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (p341==1)) * (p229==1)) * !(EX(!((p60==0)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.169197,11204,1,0,11,40242,13,4,4085,4542,6
FORMULA DLCflexbar-PT-3a-CTLFireability-2024-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 : 308/308 places, 431/431 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 238 transition count 431
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 93 place count 215 transition count 385
Iterating global reduction 1 with 23 rules applied. Total rules applied 116 place count 215 transition count 385
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 127 place count 215 transition count 374
Applied a total of 127 rules in 3 ms. Remains 215 /308 variables (removed 93) and now considering 374/431 (removed 57) transitions.
[2026-05-24 07:47:37] [INFO ] Flow matrix only has 290 transitions (discarded 84 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9867275146404056362.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11582714497406930569.kers'
[2026-05-24 07:47:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9867275146404056362.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11582714497406930569.kers]
Normalized transition count is 289 out of 290 initially.
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 289 rows 196 cols 612 entries
Finished phase 1 with 161 SingleSign rule and 0 generalized
[2026-05-24 07:47:37] [INFO ] Computed 54 invariants in 0 ms
Computed 54 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11582714497406930569.kers
Total runtime 2 ms.
[2026-05-24 07:47:37] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-24 07:47:37] [INFO ] Flow matrix only has 290 transitions (discarded 84 similar events)
[2026-05-24 07:47:37] [INFO ] Invariant cache hit.
[2026-05-24 07:47:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 07:47:37] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2026-05-24 07:47:37] [INFO ] Flow matrix only has 290 transitions (discarded 84 similar events)
[2026-05-24 07:47:37] [INFO ] Invariant cache hit.
[2026-05-24 07:47:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (OVERLAPS) 19/215 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (OVERLAPS) 289/504 variables, 215/269 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 7 (OVERLAPS) 1/505 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 9 (OVERLAPS) 0/505 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 270 constraints, problems are : Problem set: 0 solved, 373 unsolved in 28721 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 215/215 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (OVERLAPS) 19/215 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (OVERLAPS) 289/504 variables, 215/269 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 373/642 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 8 (OVERLAPS) 1/505 variables, 1/643 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 10 (OVERLAPS) 0/505 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/505 variables, and 643 constraints, problems are : Problem set: 0 solved, 373 unsolved in 26687 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 215/215 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55427ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 55427ms
Starting structural reductions in LTL mode, iteration 1 : 215/308 places, 374/431 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55575 ms. Remains : 215/308 places, 374/431 transitions.
[2026-05-24 07:48:33] [INFO ] Flatten gal took : 8 ms
[2026-05-24 07:48:33] [INFO ] Flatten gal took : 5 ms
[2026-05-24 07:48:33] [INFO ] Input system was already deterministic with 374 transitions.
[2026-05-24 07:48:33] [INFO ] Flatten gal took : 3 ms
[2026-05-24 07:48:33] [INFO ] Flatten gal took : 4 ms
[2026-05-24 07:48:33] [INFO ] Time to serialize gal into /tmp/CTLFireability12663692495455204100.gal : 2 ms
[2026-05-24 07:48:33] [INFO ] Time to serialize properties into /tmp/CTLFireability12480474615354107469.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12663692495455204100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12480474615354107469.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,6.5918e+25,0.05517,5632,2,590,5,2257,6,0,1094,1532,0


Converting to forward existential form...Done !
original formula: AG((((EX(((p98==1)&&(p468==1))) + (p7==0)) + ((p262==0) + (AF((EX(((p244==1)&&(p466==1))) + (((p220==1)&&(p308==1))&&((p228==1)&&(p380==1...560
=> equivalent forward existential formula: ([FwdG((((FwdU(Init,TRUE) * !(((!((E(!(((p205==1)&&(p499==1))) U (!(((p217==1)&&(p564==1))) * !(((p205==1)&&(p49...1281
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 368/0/6
Hit Full ! (commute/partial/dont) 370/0/4
(forward)formula 0,0,0.343867,15764,1,0,41,63716,59,21,5082,33138,30
FORMULA DLCflexbar-PT-3a-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 07:48:33] [INFO ] Flatten gal took : 14 ms
[2026-05-24 07:48:33] [INFO ] Flatten gal took : 9 ms
Total runtime 689300 ms.

BK_STOP 1779608913647

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="DLCflexbar-PT-3a"
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-5973"
echo " Executing tool itstools"
echo " Input is DLCflexbar-PT-3a, 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 r098-tall-177955695500410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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