About the Execution of ITS-Tools for GPUForwardProgress-PT-32b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 3600000.00 | 0.00 | 0.00 | ?F?FT?TT???T???? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008000498.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is GPUForwardProgress-PT-32b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008000498
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 160K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2023-12
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2023-13
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2023-14
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2023-15
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2025-00
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2025-01
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2025-02
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2025-03
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2025-04
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2025-05
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2025-06
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2025-07
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2025-08
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2025-09
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2025-10
FORMULA_NAME GPUForwardProgress-PT-32b-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748976420237
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-32b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-03 18:47:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 18:47:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 18:47:03] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2025-06-03 18:47:03] [INFO ] Transformed 644 places.
[2025-06-03 18:47:03] [INFO ] Transformed 677 transitions.
[2025-06-03 18:47:03] [INFO ] Found NUPN structural information;
[2025-06-03 18:47:03] [INFO ] Parsed PT model containing 644 places and 677 transitions and 1677 arcs in 483 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Support contains 160 out of 644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 644/644 places, 677/677 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 595 transition count 628
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 595 transition count 628
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 114 place count 579 transition count 612
Iterating global reduction 0 with 16 rules applied. Total rules applied 130 place count 579 transition count 612
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 145 place count 579 transition count 597
Applied a total of 145 rules in 274 ms. Remains 579 /644 variables (removed 65) and now considering 597/677 (removed 80) transitions.
// Phase 1: matrix 597 rows 579 cols
[2025-06-03 18:47:04] [INFO ] Computed 34 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:47:04] [INFO ] Implicit Places using invariants in 622 ms returned []
[2025-06-03 18:47:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:47:05] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1564 ms to find 0 implicit places.
Running 596 sub problems to find dead transitions.
[2025-06-03 18:47:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (OVERLAPS) 597/1175 variables, 578/612 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1175/1176 variables, and 612 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30075 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 578/579 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (OVERLAPS) 597/1175 variables, 578/612 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1175 variables, 596/1208 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1175/1176 variables, and 1208 constraints, problems are : Problem set: 0 solved, 596 unsolved in 30047 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 578/579 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60465ms problems are : Problem set: 0 solved, 596 unsolved
Search for dead transitions found 0 dead transitions in 60493ms
Starting structural reductions in LTL mode, iteration 1 : 579/644 places, 597/677 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62374 ms. Remains : 579/644 places, 597/677 transitions.
Support contains 160 out of 579 places after structural reductions.
[2025-06-03 18:48:06] [INFO ] Flatten gal took : 162 ms
[2025-06-03 18:48:06] [INFO ] Flatten gal took : 76 ms
[2025-06-03 18:48:06] [INFO ] Input system was already deterministic with 597 transitions.
Support contains 159 out of 579 places (down from 160) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 93 to 92
RANDOM walk for 40000 steps (145 resets) in 2327 ms. (17 steps per ms) remains 33/92 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 31/31 properties
[2025-06-03 18:48:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 493/578 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 597/1175 variables, 578/612 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1175 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp86 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/1176 variables, 1/613 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1176 variables, 0/613 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/1176 variables, 0/613 constraints. Problems are: Problem set: 4 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1176/1176 variables, and 613 constraints, problems are : Problem set: 4 solved, 27 unsolved in 4219 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 579/579 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 27 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 534/577 variables, 33/33 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/577 variables, 0/33 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 1/578 variables, 1/34 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 0/34 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 597/1175 variables, 578/612 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1175 variables, 27/639 constraints. Problems are: Problem set: 4 solved, 27 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1175/1176 variables, and 639 constraints, problems are : Problem set: 4 solved, 27 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 34/34 constraints, State Equation: 578/579 constraints, PredecessorRefiner: 27/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9272ms problems are : Problem set: 4 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 579 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 579/579 places, 597/597 transitions.
Graph (trivial) has 429 edges and 579 vertex of which 6 / 579 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 889 edges and 574 vertex of which 537 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.4 ms
Discarding 37 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 244 transitions
Trivial Post-agglo rules discarded 244 transitions
Performed 244 trivial Post agglomeration. Transition count delta: 244
Iterating post reduction 0 with 245 rules applied. Total rules applied 247 place count 537 transition count 342
Reduce places removed 244 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 257 rules applied. Total rules applied 504 place count 293 transition count 329
Reduce places removed 5 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 14 rules applied. Total rules applied 518 place count 288 transition count 320
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 528 place count 279 transition count 319
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 528 place count 279 transition count 263
Deduced a syphon composed of 56 places in 6 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 640 place count 223 transition count 263
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 666 place count 197 transition count 237
Iterating global reduction 4 with 26 rules applied. Total rules applied 692 place count 197 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 693 place count 197 transition count 236
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 693 place count 197 transition count 235
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 695 place count 196 transition count 235
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 696 place count 195 transition count 234
Iterating global reduction 5 with 1 rules applied. Total rules applied 697 place count 195 transition count 234
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 5 with 166 rules applied. Total rules applied 863 place count 112 transition count 151
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 872 place count 103 transition count 133
Iterating global reduction 5 with 9 rules applied. Total rules applied 881 place count 103 transition count 133
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 889 place count 99 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 896 place count 99 transition count 126
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 897 place count 99 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 898 place count 98 transition count 125
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 904 place count 98 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 905 place count 97 transition count 124
Applied a total of 905 rules in 216 ms. Remains 97 /579 variables (removed 482) and now considering 124/597 (removed 473) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 97/579 places, 124/597 transitions.
RANDOM walk for 40000 steps (1571 resets) in 1231 ms. (32 steps per ms) remains 3/27 properties
BEST_FIRST walk for 40004 steps (188 resets) in 113 ms. (350 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (203 resets) in 110 ms. (360 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (138 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
[2025-06-03 18:48:17] [INFO ] Flow matrix only has 118 transitions (discarded 6 similar events)
// Phase 1: matrix 118 rows 97 cols
[2025-06-03 18:48:17] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/54 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 125/179 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/213 variables, 27/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/215 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/215 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 97/97 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
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/54 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 125/179 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp80 is UNSAT
After SMT solving in domain Int declared 213/215 variables, and 97 constraints, problems are : Problem set: 1 solved, 0 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 95/97 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 249ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2025-06-03 18:48:18] [INFO ] Flatten gal took : 77 ms
[2025-06-03 18:48:18] [INFO ] Flatten gal took : 60 ms
[2025-06-03 18:48:18] [INFO ] Input system was already deterministic with 597 transitions.
Computed a total of 115 stabilizing places and 115 stable transitions
Graph (complete) has 896 edges and 579 vertex of which 542 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.31 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 579/579 places, 597/597 transitions.
Graph (trivial) has 496 edges and 579 vertex of which 6 / 579 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 890 edges and 574 vertex of which 537 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.4 ms
Discarding 37 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 289 transitions
Trivial Post-agglo rules discarded 289 transitions
Performed 289 trivial Post agglomeration. Transition count delta: 289
Iterating post reduction 0 with 289 rules applied. Total rules applied 291 place count 536 transition count 298
Reduce places removed 289 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 315 rules applied. Total rules applied 606 place count 247 transition count 272
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 616 place count 238 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 617 place count 237 transition count 271
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 617 place count 237 transition count 204
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 751 place count 170 transition count 204
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 783 place count 138 transition count 172
Iterating global reduction 4 with 32 rules applied. Total rules applied 815 place count 138 transition count 172
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 943 place count 74 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 944 place count 74 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 945 place count 73 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 946 place count 73 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 948 place count 72 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 949 place count 71 transition count 104
Applied a total of 949 rules in 73 ms. Remains 71 /579 variables (removed 508) and now considering 104/597 (removed 493) transitions.
// Phase 1: matrix 104 rows 71 cols
[2025-06-03 18:48:18] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:48:18] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-03 18:48:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:48:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 18:48:18] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:48:18] [INFO ] Redundant transitions in 4 ms returned []
Running 71 sub problems to find dead transitions.
[2025-06-03 18:48:18] [INFO ] Invariant cache hit.
[2025-06-03 18:48:18] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 103/142 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 32/174 variables, 32/71 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 1/175 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/175 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 72 constraints, problems are : Problem set: 0 solved, 71 unsolved in 4159 ms.
Refiners :[State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 103/142 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 9/48 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 32/174 variables, 32/80 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 62/142 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 1/175 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/175 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 143 constraints, problems are : Problem set: 0 solved, 71 unsolved in 4213 ms.
Refiners :[State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8391ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 8392ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/579 places, 104/597 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8679 ms. Remains : 71/579 places, 104/597 transitions.
[2025-06-03 18:48:27] [INFO ] Flatten gal took : 6 ms
[2025-06-03 18:48:27] [INFO ] Flatten gal took : 5 ms
[2025-06-03 18:48:27] [INFO ] Input system was already deterministic with 104 transitions.
RANDOM walk for 23 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 18:48:27] [INFO ] Flatten gal took : 6 ms
[2025-06-03 18:48:27] [INFO ] Flatten gal took : 6 ms
[2025-06-03 18:48:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6661071178406672708.gal : 3 ms
[2025-06-03 18:48:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6650673296682618334.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6661071178406672708.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6650673296682618334.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 597/597 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 578 transition count 597
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 30 place count 549 transition count 568
Iterating global reduction 1 with 29 rules applied. Total rules applied 59 place count 549 transition count 568
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 67 place count 549 transition count 560
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 75 place count 541 transition count 552
Iterating global reduction 2 with 8 rules applied. Total rules applied 83 place count 541 transition count 552
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 90 place count 541 transition count 545
Applied a total of 90 rules in 94 ms. Remains 541 /579 variables (removed 38) and now considering 545/597 (removed 52) transitions.
// Phase 1: matrix 545 rows 541 cols
[2025-06-03 18:48:27] [INFO ] Computed 33 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:48:27] [INFO ] Implicit Places using invariants in 329 ms returned []
[2025-06-03 18:48:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:48:28] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
Running 544 sub problems to find dead transitions.
[2025-06-03 18:48:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 2 (OVERLAPS) 545/1085 variables, 540/573 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1085/1086 variables, and 573 constraints, problems are : Problem set: 0 solved, 544 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 540/541 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 544 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 2 (OVERLAPS) 545/1085 variables, 540/573 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1085 variables, 544/1117 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1085/1086 variables, and 1117 constraints, problems are : Problem set: 0 solved, 544 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 540/541 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 544 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in LTL mode, iteration 1 : 541/579 places, 545/597 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61360 ms. Remains : 541/579 places, 545/597 transitions.
[2025-06-03 18:49:28] [INFO ] Flatten gal took : 42 ms
[2025-06-03 18:49:28] [INFO ] Flatten gal took : 41 ms
[2025-06-03 18:49:28] [INFO ] Input system was already deterministic with 545 transitions.
[2025-06-03 18:49:28] [INFO ] Flatten gal took : 35 ms
[2025-06-03 18:49:28] [INFO ] Flatten gal took : 35 ms
[2025-06-03 18:49:28] [INFO ] Time to serialize gal into /tmp/CTLFireability7175612467313844272.gal : 18 ms
[2025-06-03 18:49:28] [INFO ] Time to serialize properties into /tmp/CTLFireability3815435879719072770.ctl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7175612467313844272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3815435879719072770.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 18:49:59] [INFO ] Flatten gal took : 34 ms
[2025-06-03 18:49:59] [INFO ] Applying decomposition
[2025-06-03 18:49:59] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9652557034916755384.txt' '-o' '/tmp/graph9652557034916755384.bin' '-w' '/tmp/graph9652557034916755384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9652557034916755384.bin' '-l' '-1' '-v' '-w' '/tmp/graph9652557034916755384.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:49:59] [INFO ] Decomposing Gal with order
[2025-06-03 18:49:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:49:59] [INFO ] Removed a total of 170 redundant transitions.
[2025-06-03 18:49:59] [INFO ] Flatten gal took : 133 ms
[2025-06-03 18:49:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2025-06-03 18:49:59] [INFO ] Time to serialize gal into /tmp/CTLFireability6688442309080015881.gal : 16 ms
[2025-06-03 18:49:59] [INFO ] Time to serialize properties into /tmp/CTLFireability1132687636612768966.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6688442309080015881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1132687636612768966.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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.52037e+39,1.04464,31012,2415,26,54678,298,748,66364,36,512,0
Converting to forward existential form...Done !
original formula: E(EG((((AG(AX((i33.u227.p627==1))) + !((((i26.u177.p489==1)||(((i22.u147.p398==1)&&(i33.u224.p625==1))&&(i33.u231.p640==1))) * EX((((i8.u...480
=> equivalent forward existential formula: [(FwdU(Init,EG((((!(E(TRUE U !(!(EX(!((i33.u227.p627==1))))))) + !((((i26.u177.p489==1)||(((i22.u147.p398==1)&&(...562
Reverse transition relation is NOT exact ! Due to transitions t479, i0.t162, i0.u163.t155, i2.t474, i2.u20.t467, i3.t461, i3.u21.t451, i4.t444, i4.t437, i5...933
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 579/579 places, 597/597 transitions.
Graph (trivial) has 496 edges and 579 vertex of which 6 / 579 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 890 edges and 574 vertex of which 537 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.4 ms
Discarding 37 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 288 transitions
Trivial Post-agglo rules discarded 288 transitions
Performed 288 trivial Post agglomeration. Transition count delta: 288
Iterating post reduction 0 with 288 rules applied. Total rules applied 290 place count 536 transition count 299
Reduce places removed 288 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 314 rules applied. Total rules applied 604 place count 248 transition count 273
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 614 place count 239 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 615 place count 238 transition count 272
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 615 place count 238 transition count 205
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 749 place count 171 transition count 205
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 781 place count 139 transition count 173
Iterating global reduction 4 with 32 rules applied. Total rules applied 813 place count 139 transition count 173
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 943 place count 74 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 944 place count 74 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 945 place count 73 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 946 place count 73 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 948 place count 72 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 949 place count 71 transition count 104
Applied a total of 949 rules in 73 ms. Remains 71 /579 variables (removed 508) and now considering 104/597 (removed 493) transitions.
// Phase 1: matrix 104 rows 71 cols
[2025-06-03 18:50:29] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:50:29] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-03 18:50:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:50:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 18:50:30] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:50:30] [INFO ] Redundant transitions in 4 ms returned []
Running 71 sub problems to find dead transitions.
[2025-06-03 18:50:30] [INFO ] Invariant cache hit.
[2025-06-03 18:50:30] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 103/142 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 32/174 variables, 32/71 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 1/175 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/175 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 72 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2849 ms.
Refiners :[State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 103/142 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 32/174 variables, 32/78 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 64/142 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 1/175 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/175 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 143 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2975 ms.
Refiners :[State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5837ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 5838ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/579 places, 104/597 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6210 ms. Remains : 71/579 places, 104/597 transitions.
[2025-06-03 18:50:36] [INFO ] Flatten gal took : 5 ms
[2025-06-03 18:50:36] [INFO ] Flatten gal took : 3 ms
[2025-06-03 18:50:36] [INFO ] Input system was already deterministic with 104 transitions.
RANDOM walk for 20 steps (0 resets) in 8 ms. (2 steps per ms) remains 0/1 properties
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-03 18:50:36] [INFO ] Flatten gal took : 6 ms
[2025-06-03 18:50:36] [INFO ] Flatten gal took : 6 ms
[2025-06-03 18:50:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15135792861149712239.gal : 2 ms
[2025-06-03 18:50:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality492634006867080514.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15135792861149712239.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality492634006867080514.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 597/597 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 578 transition count 597
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 30 place count 549 transition count 568
Iterating global reduction 1 with 29 rules applied. Total rules applied 59 place count 549 transition count 568
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 66 place count 549 transition count 561
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 76 place count 539 transition count 551
Iterating global reduction 2 with 10 rules applied. Total rules applied 86 place count 539 transition count 551
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 94 place count 539 transition count 543
Applied a total of 94 rules in 68 ms. Remains 539 /579 variables (removed 40) and now considering 543/597 (removed 54) transitions.
// Phase 1: matrix 543 rows 539 cols
[2025-06-03 18:50:36] [INFO ] Computed 33 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:50:36] [INFO ] Implicit Places using invariants in 251 ms returned []
[2025-06-03 18:50:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:50:37] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
Running 542 sub problems to find dead transitions.
[2025-06-03 18:50:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 2 (OVERLAPS) 543/1081 variables, 538/571 constraints. Problems are: Problem set: 0 solved, 542 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1081/1082 variables, and 571 constraints, problems are : Problem set: 0 solved, 542 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/539 constraints, PredecessorRefiner: 542/542 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 542 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 2 (OVERLAPS) 543/1081 variables, 538/571 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1081 variables, 542/1113 constraints. Problems are: Problem set: 0 solved, 542 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1081/1082 variables, and 1113 constraints, problems are : Problem set: 0 solved, 542 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/539 constraints, PredecessorRefiner: 542/542 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 542 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 539/579 places, 543/597 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61065 ms. Remains : 539/579 places, 543/597 transitions.
[2025-06-03 18:51:37] [INFO ] Flatten gal took : 23 ms
[2025-06-03 18:51:37] [INFO ] Flatten gal took : 34 ms
[2025-06-03 18:51:37] [INFO ] Input system was already deterministic with 543 transitions.
[2025-06-03 18:51:37] [INFO ] Flatten gal took : 38 ms
[2025-06-03 18:51:37] [INFO ] Flatten gal took : 38 ms
[2025-06-03 18:51:37] [INFO ] Time to serialize gal into /tmp/CTLFireability11433123751397306193.gal : 8 ms
[2025-06-03 18:51:37] [INFO ] Time to serialize properties into /tmp/CTLFireability4807876438289800083.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11433123751397306193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4807876438289800083.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 18:52:07] [INFO ] Flatten gal took : 23 ms
[2025-06-03 18:52:07] [INFO ] Applying decomposition
[2025-06-03 18:52:07] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1842584305303817224.txt' '-o' '/tmp/graph1842584305303817224.bin' '-w' '/tmp/graph1842584305303817224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1842584305303817224.bin' '-l' '-1' '-v' '-w' '/tmp/graph1842584305303817224.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:52:07] [INFO ] Decomposing Gal with order
[2025-06-03 18:52:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:52:07] [INFO ] Removed a total of 167 redundant transitions.
[2025-06-03 18:52:07] [INFO ] Flatten gal took : 40 ms
[2025-06-03 18:52:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-03 18:52:07] [INFO ] Time to serialize gal into /tmp/CTLFireability11440720963803897663.gal : 7 ms
[2025-06-03 18:52:07] [INFO ] Time to serialize properties into /tmp/CTLFireability3775999577539571888.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11440720963803897663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3775999577539571888.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.53598e+39,0.985947,30120,1398,29,56244,312,737,67569,36,546,0
Converting to forward existential form...Done !
original formula: EX(EF(((EX((i20.u142.p377==1)) * (i2.u27.p72==1)) * ((i19.u132.p359==1)&&((i24.u168.p457==1)||(((i20.u141.p380==1)&&(i33.u227.p625==1))&&...179
=> equivalent forward existential formula: [(EY(((FwdU(EY(Init),TRUE) * ((i19.u132.p359==1)&&((i24.u168.p457==1)||(((i20.u141.p380==1)&&(i33.u227.p625==1))...231
(forward)formula 0,1,1.55888,31144,1,0,58077,312,1814,70928,63,546,133853
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 597/597 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 578 transition count 597
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 547 transition count 566
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 547 transition count 566
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 72 place count 547 transition count 557
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 537 transition count 547
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 537 transition count 547
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 100 place count 537 transition count 539
Applied a total of 100 rules in 47 ms. Remains 537 /579 variables (removed 42) and now considering 539/597 (removed 58) transitions.
// Phase 1: matrix 539 rows 537 cols
[2025-06-03 18:52:09] [INFO ] Computed 33 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:52:09] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-06-03 18:52:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:52:10] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
Running 538 sub problems to find dead transitions.
[2025-06-03 18:52:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 2 (OVERLAPS) 539/1075 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 538 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1075/1076 variables, and 569 constraints, problems are : Problem set: 0 solved, 538 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/537 constraints, PredecessorRefiner: 538/538 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 538 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 2 (OVERLAPS) 539/1075 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1075 variables, 538/1107 constraints. Problems are: Problem set: 0 solved, 538 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1075/1076 variables, and 1107 constraints, problems are : Problem set: 0 solved, 538 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/537 constraints, PredecessorRefiner: 538/538 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 538 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in LTL mode, iteration 1 : 537/579 places, 539/597 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61053 ms. Remains : 537/579 places, 539/597 transitions.
[2025-06-03 18:53:10] [INFO ] Flatten gal took : 21 ms
[2025-06-03 18:53:10] [INFO ] Flatten gal took : 21 ms
[2025-06-03 18:53:10] [INFO ] Input system was already deterministic with 539 transitions.
[2025-06-03 18:53:10] [INFO ] Flatten gal took : 20 ms
[2025-06-03 18:53:10] [INFO ] Flatten gal took : 22 ms
[2025-06-03 18:53:10] [INFO ] Time to serialize gal into /tmp/CTLFireability7844185660904549710.gal : 7 ms
[2025-06-03 18:53:10] [INFO ] Time to serialize properties into /tmp/CTLFireability16887643133936562353.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7844185660904549710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16887643133936562353.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 18:53:40] [INFO ] Flatten gal took : 13 ms
[2025-06-03 18:53:40] [INFO ] Applying decomposition
[2025-06-03 18:53:40] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5409180896730932602.txt' '-o' '/tmp/graph5409180896730932602.bin' '-w' '/tmp/graph5409180896730932602.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5409180896730932602.bin' '-l' '-1' '-v' '-w' '/tmp/graph5409180896730932602.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:53:40] [INFO ] Decomposing Gal with order
[2025-06-03 18:53:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:53:40] [INFO ] Removed a total of 169 redundant transitions.
[2025-06-03 18:53:40] [INFO ] Flatten gal took : 37 ms
[2025-06-03 18:53:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-06-03 18:53:40] [INFO ] Time to serialize gal into /tmp/CTLFireability12508870496882187438.gal : 8 ms
[2025-06-03 18:53:40] [INFO ] Time to serialize properties into /tmp/CTLFireability2006825249340609049.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12508870496882187438.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2006825249340609049.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.109e+39,0.620406,20704,1621,24,33218,291,762,45458,35,547,0
Converting to forward existential form...Done !
original formula: AF((EG(!(A((i13.u99.p265!=1) U EX((i3.i1.i1.u27.p68==1))))) + EG(AF(((i32.u0.p1==0)&&(i28.u192.p526==0))))))
=> equivalent forward existential formula: [FwdG(Init,!((EG(!(!((E(!(EX((i3.i1.i1.u27.p68==1))) U (!((i13.u99.p265!=1)) * !(EX((i3.i1.i1.u27.p68==1))))) + ...256
Reverse transition relation is NOT exact ! Due to transitions t473, i0.t62, i0.t55, i1.i1.t315, i1.i1.i1.t308, i2.t468, i2.t461, i3.i1.t455, i3.i1.i1.u27.t...950
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 597/597 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 578 transition count 597
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 550 transition count 569
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 550 transition count 569
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 65 place count 550 transition count 561
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 74 place count 541 transition count 552
Iterating global reduction 2 with 9 rules applied. Total rules applied 83 place count 541 transition count 552
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 90 place count 541 transition count 545
Applied a total of 90 rules in 78 ms. Remains 541 /579 variables (removed 38) and now considering 545/597 (removed 52) transitions.
// Phase 1: matrix 545 rows 541 cols
[2025-06-03 18:54:11] [INFO ] Computed 33 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:54:11] [INFO ] Implicit Places using invariants in 347 ms returned []
[2025-06-03 18:54:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:54:12] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
Running 544 sub problems to find dead transitions.
[2025-06-03 18:54:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 2 (OVERLAPS) 545/1085 variables, 540/573 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1085/1086 variables, and 573 constraints, problems are : Problem set: 0 solved, 544 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 540/541 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 544 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 2 (OVERLAPS) 545/1085 variables, 540/573 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1085 variables, 544/1117 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1085/1086 variables, and 1117 constraints, problems are : Problem set: 0 solved, 544 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 540/541 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60170ms problems are : Problem set: 0 solved, 544 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Starting structural reductions in LTL mode, iteration 1 : 541/579 places, 545/597 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61474 ms. Remains : 541/579 places, 545/597 transitions.
[2025-06-03 18:55:12] [INFO ] Flatten gal took : 21 ms
[2025-06-03 18:55:12] [INFO ] Flatten gal took : 20 ms
[2025-06-03 18:55:12] [INFO ] Input system was already deterministic with 545 transitions.
[2025-06-03 18:55:12] [INFO ] Flatten gal took : 19 ms
[2025-06-03 18:55:12] [INFO ] Flatten gal took : 22 ms
[2025-06-03 18:55:12] [INFO ] Time to serialize gal into /tmp/CTLFireability13472923791163762540.gal : 5 ms
[2025-06-03 18:55:12] [INFO ] Time to serialize properties into /tmp/CTLFireability8896397282651310998.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13472923791163762540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8896397282651310998.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 18:55:42] [INFO ] Flatten gal took : 20 ms
[2025-06-03 18:55:42] [INFO ] Applying decomposition
[2025-06-03 18:55:42] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11884966497565944683.txt' '-o' '/tmp/graph11884966497565944683.bin' '-w' '/tmp/graph11884966497565944683.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11884966497565944683.bin' '-l' '-1' '-v' '-w' '/tmp/graph11884966497565944683.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:55:42] [INFO ] Decomposing Gal with order
[2025-06-03 18:55:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:55:42] [INFO ] Removed a total of 167 redundant transitions.
[2025-06-03 18:55:42] [INFO ] Flatten gal took : 52 ms
[2025-06-03 18:55:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2025-06-03 18:55:42] [INFO ] Time to serialize gal into /tmp/CTLFireability13398609435143548187.gal : 11 ms
[2025-06-03 18:55:42] [INFO ] Time to serialize properties into /tmp/CTLFireability9950827406894408071.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13398609435143548187.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9950827406894408071.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.02175e+39,0.773761,16912,1434,28,26203,301,781,35797,36,580,0
Converting to forward existential form...Done !
original formula: (EG((((!(A((i28.u205.p554==1) U (i17.u122.p324==1))) + EG((i10.u70.p180==0))) + (((i5.u35.p87==1)&&(i9.u61.p161==1)) + EG((i19.u134.p364=...482
=> equivalent forward existential formula: ([(FwdU((Init * !(EG((((!(!((E(!((i17.u122.p324==1)) U (!((i28.u205.p554==1)) * !((i17.u122.p324==1)))) + EG(!((...3109
Reverse transition relation is NOT exact ! Due to transitions t479, i0.i1.t149, i0.i1.i1.u172.t142, i1.i1.t276, i1.i1.i1.u113.t269, i2.i1.t474, i2.i1.i2.t4...953
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 597/597 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 578 transition count 597
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 546 transition count 565
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 546 transition count 565
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 74 place count 546 transition count 556
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 84 place count 536 transition count 546
Iterating global reduction 2 with 10 rules applied. Total rules applied 94 place count 536 transition count 546
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 102 place count 536 transition count 538
Applied a total of 102 rules in 87 ms. Remains 536 /579 variables (removed 43) and now considering 538/597 (removed 59) transitions.
// Phase 1: matrix 538 rows 536 cols
[2025-06-03 18:56:13] [INFO ] Computed 33 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:56:13] [INFO ] Implicit Places using invariants in 341 ms returned []
[2025-06-03 18:56:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:56:14] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1199 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2025-06-03 18:56:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1073/1074 variables, and 568 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 535/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 537/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 1)
(s34 0)
(s35 0)
(s36 1)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 0)
(s80 0)
(s81 1)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 1)
(s88 4)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 1)
(s103 5)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 1)
(s110 1)
(s111 0)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 0)
(s140 0)
(s141 1)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 3)
(s168 1)
(s169 0)
(s170 0)
(s171 1)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 3)
(s182 1)
(s183 1)
(s184 0)
(s185 0)
(s186 1)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 1)
(s193 4)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 0)
(s200 0)
(s201 1)
(s202 1)
(s203 0)
(s204 0)
(s205 0)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 5)
(s212 1)
(s213 1)
(s214 0)
(s215 0)
(s216 1)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 6)
(s227 1)
(s228 8)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 9)
(s257 1)
(s258 1)
(s259 0)
(s260 0)
(s261 1)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 10)
(s273 10)
(s274 0)
(s275 0)
(s276 1)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1073/1074 variables, and 1105 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 535/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60183ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Starting structural reductions in LTL mode, iteration 1 : 536/579 places, 538/597 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61476 ms. Remains : 536/579 places, 538/597 transitions.
[2025-06-03 18:57:14] [INFO ] Flatten gal took : 19 ms
[2025-06-03 18:57:14] [INFO ] Flatten gal took : 18 ms
[2025-06-03 18:57:14] [INFO ] Input system was already deterministic with 538 transitions.
[2025-06-03 18:57:14] [INFO ] Flatten gal took : 17 ms
[2025-06-03 18:57:14] [INFO ] Flatten gal took : 18 ms
[2025-06-03 18:57:14] [INFO ] Time to serialize gal into /tmp/CTLFireability15443247393882796861.gal : 6 ms
[2025-06-03 18:57:14] [INFO ] Time to serialize properties into /tmp/CTLFireability830823285962279660.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15443247393882796861.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability830823285962279660.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 18:57:44] [INFO ] Flatten gal took : 11 ms
[2025-06-03 18:57:44] [INFO ] Applying decomposition
[2025-06-03 18:57:44] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12206639635132177854.txt' '-o' '/tmp/graph12206639635132177854.bin' '-w' '/tmp/graph12206639635132177854.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12206639635132177854.bin' '-l' '-1' '-v' '-w' '/tmp/graph12206639635132177854.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:57:44] [INFO ] Decomposing Gal with order
[2025-06-03 18:57:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:57:44] [INFO ] Removed a total of 171 redundant transitions.
[2025-06-03 18:57:44] [INFO ] Flatten gal took : 46 ms
[2025-06-03 18:57:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-03 18:57:44] [INFO ] Time to serialize gal into /tmp/CTLFireability18176437652193770031.gal : 20 ms
[2025-06-03 18:57:44] [INFO ] Time to serialize properties into /tmp/CTLFireability253561045995823509.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18176437652193770031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability253561045995823509.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,2.91522e+39,0.453746,16932,1121,27,25536,303,743,28966,36,579,0
Converting to forward existential form...Done !
original formula: AX(AF(EG((i4.i0.u37.p93==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EG((i4.i0.u37.p93==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t472, i1.t467, i1.i2.t460, i2.t454, i2.i2.t447, i3.t440, i3.i3.t433, i4.t426, i4.i1.u35.t419,...1032
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 579/579 places, 597/597 transitions.
Graph (trivial) has 493 edges and 579 vertex of which 6 / 579 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 890 edges and 574 vertex of which 537 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.2 ms
Discarding 37 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 289 transitions
Trivial Post-agglo rules discarded 289 transitions
Performed 289 trivial Post agglomeration. Transition count delta: 289
Iterating post reduction 0 with 289 rules applied. Total rules applied 291 place count 536 transition count 298
Reduce places removed 289 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 315 rules applied. Total rules applied 606 place count 247 transition count 272
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 615 place count 238 transition count 272
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 615 place count 238 transition count 206
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 747 place count 172 transition count 206
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 780 place count 139 transition count 173
Iterating global reduction 3 with 33 rules applied. Total rules applied 813 place count 139 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 814 place count 139 transition count 172
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 815 place count 138 transition count 171
Iterating global reduction 4 with 1 rules applied. Total rules applied 816 place count 138 transition count 171
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 944 place count 74 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 946 place count 73 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 947 place count 72 transition count 105
Applied a total of 947 rules in 63 ms. Remains 72 /579 variables (removed 507) and now considering 105/597 (removed 492) transitions.
// Phase 1: matrix 105 rows 72 cols
[2025-06-03 18:58:14] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:58:15] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-03 18:58:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:58:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 18:58:15] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:58:15] [INFO ] Redundant transitions in 2 ms returned []
Running 102 sub problems to find dead transitions.
[2025-06-03 18:58:15] [INFO ] Invariant cache hit.
[2025-06-03 18:58:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 104/173 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 3/176 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 1/177 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 73 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5927 ms.
Refiners :[State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 104/173 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 3/176 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 102/174 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/177 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 175 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5129 ms.
Refiners :[State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11108ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 11109ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/579 places, 105/597 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11455 ms. Remains : 72/579 places, 105/597 transitions.
[2025-06-03 18:58:26] [INFO ] Flatten gal took : 2 ms
[2025-06-03 18:58:26] [INFO ] Flatten gal took : 2 ms
[2025-06-03 18:58:26] [INFO ] Input system was already deterministic with 105 transitions.
[2025-06-03 18:58:26] [INFO ] Flatten gal took : 4 ms
[2025-06-03 18:58:26] [INFO ] Flatten gal took : 4 ms
[2025-06-03 18:58:26] [INFO ] Time to serialize gal into /tmp/CTLFireability18360787940494449521.gal : 1 ms
[2025-06-03 18:58:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6963438092797856659.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18360787940494449521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6963438092797856659.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.8584e+17,6.95608,137108,2,1824,5,957399,6,0,393,558270,0
Converting to forward existential form...Done !
original formula: EG((((p98==0)||(p625==0))||(p640==0)))
=> equivalent forward existential formula: [FwdG(Init,(((p98==0)||(p625==0))||(p640==0)))] != FALSE
Hit Full ! (commute/partial/dont) 68/0/37
(forward)formula 0,1,17.6841,284808,1,0,10,1.44194e+06,19,4,2212,1.75562e+06,8
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 579/579 places, 597/597 transitions.
Graph (trivial) has 487 edges and 579 vertex of which 6 / 579 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 890 edges and 574 vertex of which 537 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.3 ms
Discarding 37 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 282 transitions
Trivial Post-agglo rules discarded 282 transitions
Performed 282 trivial Post agglomeration. Transition count delta: 282
Iterating post reduction 0 with 282 rules applied. Total rules applied 284 place count 536 transition count 305
Reduce places removed 282 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 307 rules applied. Total rules applied 591 place count 254 transition count 280
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 601 place count 245 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 602 place count 244 transition count 279
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 65 Pre rules applied. Total rules applied 602 place count 244 transition count 214
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 732 place count 179 transition count 214
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 763 place count 148 transition count 183
Iterating global reduction 4 with 31 rules applied. Total rules applied 794 place count 148 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 795 place count 148 transition count 182
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 796 place count 147 transition count 181
Iterating global reduction 5 with 1 rules applied. Total rules applied 797 place count 147 transition count 181
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 925 place count 83 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 927 place count 82 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 928 place count 81 transition count 115
Applied a total of 928 rules in 46 ms. Remains 81 /579 variables (removed 498) and now considering 115/597 (removed 482) transitions.
// Phase 1: matrix 115 rows 81 cols
[2025-06-03 18:58:44] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:58:44] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-03 18:58:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 18:58:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 18:58:44] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 18:58:44] [INFO ] Redundant transitions in 3 ms returned []
Running 111 sub problems to find dead transitions.
[2025-06-03 18:58:44] [INFO ] Invariant cache hit.
[2025-06-03 18:58:44] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 114/191 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 4/195 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 1/196 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 82 constraints, problems are : Problem set: 0 solved, 111 unsolved in 7164 ms.
Refiners :[State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 114/191 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 4/195 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 104/192 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 1/196 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 193 constraints, problems are : Problem set: 0 solved, 111 unsolved in 8314 ms.
Refiners :[State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15506ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 15507ms
Starting structural reductions in SI_CTL mode, iteration 1 : 81/579 places, 115/597 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15719 ms. Remains : 81/579 places, 115/597 transitions.
[2025-06-03 18:58:59] [INFO ] Flatten gal took : 4 ms
[2025-06-03 18:58:59] [INFO ] Flatten gal took : 4 ms
[2025-06-03 18:58:59] [INFO ] Input system was already deterministic with 115 transitions.
[2025-06-03 18:58:59] [INFO ] Flatten gal took : 8 ms
[2025-06-03 18:58:59] [INFO ] Flatten gal took : 4 ms
[2025-06-03 18:58:59] [INFO ] Time to serialize gal into /tmp/CTLFireability3997870355424441886.gal : 1 ms
[2025-06-03 18:58:59] [INFO ] Time to serialize properties into /tmp/CTLFireability9446912541318016639.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3997870355424441886.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9446912541318016639.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 18:59:29] [INFO ] Flatten gal took : 3 ms
[2025-06-03 18:59:29] [INFO ] Applying decomposition
[2025-06-03 18:59:29] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5370065898359209501.txt' '-o' '/tmp/graph5370065898359209501.bin' '-w' '/tmp/graph5370065898359209501.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5370065898359209501.bin' '-l' '-1' '-v' '-w' '/tmp/graph5370065898359209501.weights' '-q' '0' '-e' '0.001'
[2025-06-03 18:59:30] [INFO ] Decomposing Gal with order
[2025-06-03 18:59:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 18:59:30] [INFO ] Removed a total of 94 redundant transitions.
[2025-06-03 18:59:30] [INFO ] Flatten gal took : 17 ms
[2025-06-03 18:59:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2025-06-03 18:59:30] [INFO ] Time to serialize gal into /tmp/CTLFireability15464938062617145172.gal : 1 ms
[2025-06-03 18:59:30] [INFO ] Time to serialize properties into /tmp/CTLFireability2968618371018876113.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15464938062617145172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2968618371018876113.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.31241e+18,9.30084,200460,682,229,216214,8055,246,1.77971e+06,37,92826,0
Converting to forward existential form...Done !
original formula: AF((E((((i19.u27.p488==1)&&(i24.u35.p625==1))&&(i24.u36.p640==1)) U (u34.p604==1)) + !(A((((u0.p44==1)&&(i24.u35.p625==1))&&((i24.u36.p64...249
=> equivalent forward existential formula: [FwdG(Init,!((E((((i19.u27.p488==1)&&(i24.u35.p625==1))&&(i24.u36.p640==1)) U (u34.p604==1)) + !(!((E(!(E(TRUE U...467
Reverse transition relation is NOT exact ! Due to transitions t8, t14, t19, t21, t23, t29, t31, t35, t41, t47, t49, t51, t53, t55, t57, t59, t61, t69, t72,...405
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 597/597 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 578 transition count 597
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 548 transition count 567
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 548 transition count 567
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 70 place count 548 transition count 558
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 77 place count 541 transition count 551
Iterating global reduction 2 with 7 rules applied. Total rules applied 84 place count 541 transition count 551
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 91 place count 541 transition count 544
Applied a total of 91 rules in 55 ms. Remains 541 /579 variables (removed 38) and now considering 544/597 (removed 53) transitions.
// Phase 1: matrix 544 rows 541 cols
[2025-06-03 19:00:00] [INFO ] Computed 33 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:00:00] [INFO ] Implicit Places using invariants in 275 ms returned []
[2025-06-03 19:00:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:00:01] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
Running 543 sub problems to find dead transitions.
[2025-06-03 19:00:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (OVERLAPS) 544/1084 variables, 540/573 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1084/1085 variables, and 573 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 540/541 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 543 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (OVERLAPS) 544/1084 variables, 540/573 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1084 variables, 543/1116 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1084/1085 variables, and 1116 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 540/541 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 543 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Starting structural reductions in LTL mode, iteration 1 : 541/579 places, 544/597 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61347 ms. Remains : 541/579 places, 544/597 transitions.
[2025-06-03 19:01:01] [INFO ] Flatten gal took : 17 ms
[2025-06-03 19:01:01] [INFO ] Flatten gal took : 30 ms
[2025-06-03 19:01:01] [INFO ] Input system was already deterministic with 544 transitions.
[2025-06-03 19:01:01] [INFO ] Flatten gal took : 17 ms
[2025-06-03 19:01:01] [INFO ] Flatten gal took : 17 ms
[2025-06-03 19:01:01] [INFO ] Time to serialize gal into /tmp/CTLFireability13223905208771696201.gal : 4 ms
[2025-06-03 19:01:01] [INFO ] Time to serialize properties into /tmp/CTLFireability3352665655795097662.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13223905208771696201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3352665655795097662.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 19:01:31] [INFO ] Flatten gal took : 17 ms
[2025-06-03 19:01:31] [INFO ] Applying decomposition
[2025-06-03 19:01:31] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph300733210559001898.txt' '-o' '/tmp/graph300733210559001898.bin' '-w' '/tmp/graph300733210559001898.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph300733210559001898.bin' '-l' '-1' '-v' '-w' '/tmp/graph300733210559001898.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:01:31] [INFO ] Decomposing Gal with order
[2025-06-03 19:01:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:01:31] [INFO ] Removed a total of 73 redundant transitions.
[2025-06-03 19:01:31] [INFO ] Flatten gal took : 44 ms
[2025-06-03 19:01:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-03 19:01:31] [INFO ] Time to serialize gal into /tmp/CTLFireability7108776821547230436.gal : 9 ms
[2025-06-03 19:01:31] [INFO ] Time to serialize properties into /tmp/CTLFireability18341131982657356755.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7108776821547230436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18341131982657356755.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 597/597 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 578 transition count 597
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 546 transition count 565
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 546 transition count 565
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 74 place count 546 transition count 556
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 84 place count 536 transition count 546
Iterating global reduction 2 with 10 rules applied. Total rules applied 94 place count 536 transition count 546
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 102 place count 536 transition count 538
Applied a total of 102 rules in 45 ms. Remains 536 /579 variables (removed 43) and now considering 538/597 (removed 59) transitions.
// Phase 1: matrix 538 rows 536 cols
[2025-06-03 19:02:02] [INFO ] Computed 33 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:02:02] [INFO ] Implicit Places using invariants in 351 ms returned []
[2025-06-03 19:02:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:02:03] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1283 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2025-06-03 19:02:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1073/1074 variables, and 568 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 535/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 537/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 1)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 6)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 6)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 0)
(s113 1)
(s114 1)
(s115 1)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 1)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 1)
(s149 2)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 0)
(s155 0)
(s156 1)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 3)
(s168 1)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 3)
(s182 1)
(s183 1)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 6)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 6)
(s212 1)
(s213 1)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 7)
(s227 1)
(s228 8)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 9)
(s257 1)
(s258 1)
(s259 0)
(s260 0)
(s261 1)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 10)
(s273 11)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 12)
(s303 13)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 0)
(s320 0)
(s321 1)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 14)
(s333 15)
(s334 0)
(s335 0)
(s336 1)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 16)
(s362 1)
(s363 1)
(s364 0)
(s365 0)
(s366 1)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 17)
(s378 18)
(s379 0)
(s380 0)
(s381 1)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 0)
(s395 0)
(s396 1)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 19)
(s408 1)
(s409 0)
(s410 0)
(s411 1)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 20)
(s422 1)
(s423 1)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 1)
(s433 1)
(s434 1)
(s435 21)
(s436 1)
(s437 1)
(s438 22)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 0)
(s455 0)
(s456 1)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 23)
(s467 1)
(s468 1)
(s469 0)
(s470 0)
(s471 1)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 24)
(s482 1)
(s483 1)
(s484 0)
(s485 0)
(s486 1)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 25)
(s497 1)
(s498 1)
(s499 0)
(s500 0)
(s501 1)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 26)
(s512 1)
(s513 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1073/1074 variables, and 1105 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 535/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Starting structural reductions in LTL mode, iteration 1 : 536/579 places, 538/597 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61497 ms. Remains : 536/579 places, 538/597 transitions.
[2025-06-03 19:03:03] [INFO ] Flatten gal took : 16 ms
[2025-06-03 19:03:03] [INFO ] Flatten gal took : 17 ms
[2025-06-03 19:03:03] [INFO ] Input system was already deterministic with 538 transitions.
[2025-06-03 19:03:03] [INFO ] Flatten gal took : 16 ms
[2025-06-03 19:03:03] [INFO ] Flatten gal took : 16 ms
[2025-06-03 19:03:03] [INFO ] Time to serialize gal into /tmp/CTLFireability14718034805696440548.gal : 4 ms
[2025-06-03 19:03:03] [INFO ] Time to serialize properties into /tmp/CTLFireability12172475993676556923.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14718034805696440548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12172475993676556923.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 19:03:33] [INFO ] Flatten gal took : 10 ms
[2025-06-03 19:03:33] [INFO ] Applying decomposition
[2025-06-03 19:03:33] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1800691045893303516.txt' '-o' '/tmp/graph1800691045893303516.bin' '-w' '/tmp/graph1800691045893303516.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1800691045893303516.bin' '-l' '-1' '-v' '-w' '/tmp/graph1800691045893303516.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:03:33] [INFO ] Decomposing Gal with order
[2025-06-03 19:03:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:03:33] [INFO ] Removed a total of 162 redundant transitions.
[2025-06-03 19:03:33] [INFO ] Flatten gal took : 28 ms
[2025-06-03 19:03:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 19:03:33] [INFO ] Time to serialize gal into /tmp/CTLFireability12962712923793768705.gal : 9 ms
[2025-06-03 19:03:33] [INFO ] Time to serialize properties into /tmp/CTLFireability14044207340388238743.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12962712923793768705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14044207340388238743.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.91522e+39,0.4527,16944,1436,28,26310,317,766,32518,36,615,0
Converting to forward existential form...Done !
original formula: AF(EX((i11.i2.u77.p208==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EX((i11.i2.u77.p208==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t472, i2.i1.t460, i2.i1.u20.t467, i3.t454, i3.i1.u27.t447, i4.t440, i4.i1.u28.t433, i5.t426, ...1059
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 597/597 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 578 transition count 597
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 555 transition count 574
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 555 transition count 574
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 53 place count 555 transition count 568
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 59 place count 549 transition count 562
Iterating global reduction 2 with 6 rules applied. Total rules applied 65 place count 549 transition count 562
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 69 place count 549 transition count 558
Applied a total of 69 rules in 61 ms. Remains 549 /579 variables (removed 30) and now considering 558/597 (removed 39) transitions.
// Phase 1: matrix 558 rows 549 cols
[2025-06-03 19:04:03] [INFO ] Computed 33 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:04:04] [INFO ] Implicit Places using invariants in 281 ms returned []
[2025-06-03 19:04:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:04:04] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
Running 557 sub problems to find dead transitions.
[2025-06-03 19:04:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 548/1107 variables, and 33 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 0/549 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 557 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/548 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (OVERLAPS) 558/1106 variables, 548/581 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1106 variables, 557/1138 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1106/1107 variables, and 1138 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 548/549 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 557 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 549/579 places, 558/597 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61063 ms. Remains : 549/579 places, 558/597 transitions.
[2025-06-03 19:05:04] [INFO ] Flatten gal took : 14 ms
[2025-06-03 19:05:05] [INFO ] Flatten gal took : 13 ms
[2025-06-03 19:05:05] [INFO ] Input system was already deterministic with 558 transitions.
[2025-06-03 19:05:05] [INFO ] Flatten gal took : 13 ms
[2025-06-03 19:05:05] [INFO ] Flatten gal took : 13 ms
[2025-06-03 19:05:05] [INFO ] Time to serialize gal into /tmp/CTLFireability11140428264485438802.gal : 4 ms
[2025-06-03 19:05:05] [INFO ] Time to serialize properties into /tmp/CTLFireability12357723702620740025.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11140428264485438802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12357723702620740025.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 19:05:35] [INFO ] Flatten gal took : 10 ms
[2025-06-03 19:05:35] [INFO ] Applying decomposition
[2025-06-03 19:05:35] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11111107333389751560.txt' '-o' '/tmp/graph11111107333389751560.bin' '-w' '/tmp/graph11111107333389751560.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11111107333389751560.bin' '-l' '-1' '-v' '-w' '/tmp/graph11111107333389751560.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:05:35] [INFO ] Decomposing Gal with order
[2025-06-03 19:05:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:05:35] [INFO ] Removed a total of 152 redundant transitions.
[2025-06-03 19:05:35] [INFO ] Flatten gal took : 34 ms
[2025-06-03 19:05:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 19:05:35] [INFO ] Time to serialize gal into /tmp/CTLFireability14166297696329173389.gal : 6 ms
[2025-06-03 19:05:35] [INFO ] Time to serialize properties into /tmp/CTLFireability14447221347786430258.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14166297696329173389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14447221347786430258.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.62537e+39,0.707682,23316,1748,30,39751,321,774,51590,36,592,0
Converting to forward existential form...Done !
original formula: A((((E(A((i19.u132.p371==1) U (i24.u165.p459==1)) U !(((i2.u24.p64==1)||(((i22.u150.p416==1)&&(i32.u221.p625==1))&&(i32.u224.p640==1)))))...1009
=> equivalent forward existential formula: [((Init * !(EG(!(E((((i15.u107.p285==1) + (!(((i31.u216.p606==1)||(i3.u28.p78==1))) * ((i23.u159.p443!=1) + EX((...2952
Reverse transition relation is NOT exact ! Due to transitions t492, i1.t480, i1.u16.t487, i2.t474, i2.u20.t467, i3.t460, i3.u31.t450, i4.t443, i4.t436, i5....957
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 32
Fast SCC detection found an SCC at level 33
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 597/597 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 578 transition count 597
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 552 transition count 571
Iterating global reduction 1 with 26 rules applied. Total rules applied 53 place count 552 transition count 571
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 60 place count 552 transition count 564
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 69 place count 543 transition count 555
Iterating global reduction 2 with 9 rules applied. Total rules applied 78 place count 543 transition count 555
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 85 place count 543 transition count 548
Applied a total of 85 rules in 41 ms. Remains 543 /579 variables (removed 36) and now considering 548/597 (removed 49) transitions.
// Phase 1: matrix 548 rows 543 cols
[2025-06-03 19:06:05] [INFO ] Computed 33 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:06:05] [INFO ] Implicit Places using invariants in 295 ms returned []
[2025-06-03 19:06:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:06:06] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 952 ms to find 0 implicit places.
Running 547 sub problems to find dead transitions.
[2025-06-03 19:06:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/542 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/542 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 2 (OVERLAPS) 548/1090 variables, 542/575 constraints. Problems are: Problem set: 0 solved, 547 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 2.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 3.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 4.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 5.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 6.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 7.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 7.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 9.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 10.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 11.0)
(s336 11.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1090/1091 variables, and 575 constraints, problems are : Problem set: 0 solved, 547 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 542/543 constraints, PredecessorRefiner: 547/547 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 547 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/542 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/542 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 2 (OVERLAPS) 548/1090 variables, 542/575 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1090 variables, 547/1122 constraints. Problems are: Problem set: 0 solved, 547 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1090/1091 variables, and 1122 constraints, problems are : Problem set: 0 solved, 547 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 542/543 constraints, PredecessorRefiner: 547/547 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 547 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Starting structural reductions in LTL mode, iteration 1 : 543/579 places, 548/597 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61139 ms. Remains : 543/579 places, 548/597 transitions.
[2025-06-03 19:07:06] [INFO ] Flatten gal took : 10 ms
[2025-06-03 19:07:06] [INFO ] Flatten gal took : 9 ms
[2025-06-03 19:07:06] [INFO ] Input system was already deterministic with 548 transitions.
[2025-06-03 19:07:06] [INFO ] Flatten gal took : 10 ms
[2025-06-03 19:07:06] [INFO ] Flatten gal took : 10 ms
[2025-06-03 19:07:06] [INFO ] Time to serialize gal into /tmp/CTLFireability14652691254824780153.gal : 2 ms
[2025-06-03 19:07:06] [INFO ] Time to serialize properties into /tmp/CTLFireability8995078836271076218.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14652691254824780153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8995078836271076218.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 19:07:36] [INFO ] Flatten gal took : 13 ms
[2025-06-03 19:07:36] [INFO ] Applying decomposition
[2025-06-03 19:07:36] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16801323666068250389.txt' '-o' '/tmp/graph16801323666068250389.bin' '-w' '/tmp/graph16801323666068250389.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16801323666068250389.bin' '-l' '-1' '-v' '-w' '/tmp/graph16801323666068250389.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:07:36] [INFO ] Decomposing Gal with order
[2025-06-03 19:07:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:07:36] [INFO ] Removed a total of 162 redundant transitions.
[2025-06-03 19:07:36] [INFO ] Flatten gal took : 25 ms
[2025-06-03 19:07:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 19:07:36] [INFO ] Time to serialize gal into /tmp/CTLFireability3846173237338064565.gal : 6 ms
[2025-06-03 19:07:36] [INFO ] Time to serialize properties into /tmp/CTLFireability10865713615590910312.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3846173237338064565.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10865713615590910312.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.5728e+39,0.503228,16532,1654,26,25291,339,834,31253,36,665,0
Converting to forward existential form...Done !
original formula: (AG((((((E((i8.i0.u56.p147==1) U (i5.i0.u36.p93==1)) * (i24.u122.p337==1)) * (EF((i2.i1.u18.p47==0)) * (i8.i1.u53.p157==1))) + (AG((i30.i...497
=> equivalent forward existential formula: (([FwdG((FwdU(Init,TRUE) * !((((E((i8.i0.u56.p147==1) U (i5.i0.u36.p93==1)) * (i24.u122.p337==1)) * (E(TRUE U (i...756
Reverse transition relation is NOT exact ! Due to transitions t482, i2.t477, i2.i1.u19.t470, i3.i2.t457, i3.i2.u26.t465, i4.t449, i4.i2.t442, i5.t435, i5.i...1064
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 579/579 places, 597/597 transitions.
Graph (trivial) has 496 edges and 579 vertex of which 6 / 579 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 890 edges and 574 vertex of which 537 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 289 transitions
Trivial Post-agglo rules discarded 289 transitions
Performed 289 trivial Post agglomeration. Transition count delta: 289
Iterating post reduction 0 with 289 rules applied. Total rules applied 291 place count 536 transition count 298
Reduce places removed 289 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 315 rules applied. Total rules applied 606 place count 247 transition count 272
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 616 place count 238 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 617 place count 237 transition count 271
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 617 place count 237 transition count 204
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 751 place count 170 transition count 204
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 783 place count 138 transition count 172
Iterating global reduction 4 with 32 rules applied. Total rules applied 815 place count 138 transition count 172
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 945 place count 73 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 946 place count 73 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 948 place count 72 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 949 place count 71 transition count 104
Applied a total of 949 rules in 29 ms. Remains 71 /579 variables (removed 508) and now considering 104/597 (removed 493) transitions.
// Phase 1: matrix 104 rows 71 cols
[2025-06-03 19:08:06] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:08:06] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-03 19:08:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:08:06] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-03 19:08:07] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:08:07] [INFO ] Redundant transitions in 2 ms returned []
Running 102 sub problems to find dead transitions.
[2025-06-03 19:08:07] [INFO ] Invariant cache hit.
[2025-06-03 19:08:07] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 103/173 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 32/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 1/174 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/175 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/175 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 104 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6555 ms.
Refiners :[State Equation: 71/71 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 103/173 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 32/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 102/204 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 1/174 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/175 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/175 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 206 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6862 ms.
Refiners :[State Equation: 71/71 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13433ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 13433ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/579 places, 104/597 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13628 ms. Remains : 71/579 places, 104/597 transitions.
[2025-06-03 19:08:20] [INFO ] Flatten gal took : 4 ms
[2025-06-03 19:08:20] [INFO ] Flatten gal took : 4 ms
[2025-06-03 19:08:20] [INFO ] Input system was already deterministic with 104 transitions.
[2025-06-03 19:08:20] [INFO ] Flatten gal took : 4 ms
[2025-06-03 19:08:20] [INFO ] Flatten gal took : 3 ms
[2025-06-03 19:08:20] [INFO ] Time to serialize gal into /tmp/CTLFireability16069765694851599481.gal : 1 ms
[2025-06-03 19:08:20] [INFO ] Time to serialize properties into /tmp/CTLFireability14551599009952471709.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16069765694851599481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14551599009952471709.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.43918e+17,11.373,199012,2,1827,5,1.5937e+06,6,0,387,720901,0
Converting to forward existential form...Done !
original formula: AG(AF((p643==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p643==1)))] = FALSE
Hit Full ! (commute/partial/dont) 102/0/2
(forward)formula 0,0,11.6158,199012,1,0,11,1.5937e+06,20,3,2058,720901,11
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 597/597 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 578 transition count 597
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 548 transition count 567
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 548 transition count 567
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 70 place count 548 transition count 558
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 540 transition count 550
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 540 transition count 550
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 92 place count 540 transition count 544
Applied a total of 92 rules in 73 ms. Remains 540 /579 variables (removed 39) and now considering 544/597 (removed 53) transitions.
// Phase 1: matrix 544 rows 540 cols
[2025-06-03 19:08:32] [INFO ] Computed 33 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:08:32] [INFO ] Implicit Places using invariants in 264 ms returned []
[2025-06-03 19:08:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:08:33] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
Running 543 sub problems to find dead transitions.
[2025-06-03 19:08:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (OVERLAPS) 544/1083 variables, 539/572 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1083/1084 variables, and 572 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 539/540 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 543 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (OVERLAPS) 544/1083 variables, 539/572 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1083 variables, 543/1115 constraints. Problems are: Problem set: 0 solved, 543 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 Int declared 1083/1084 variables, and 1115 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 539/540 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 543 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in LTL mode, iteration 1 : 540/579 places, 544/597 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61289 ms. Remains : 540/579 places, 544/597 transitions.
[2025-06-03 19:09:33] [INFO ] Flatten gal took : 17 ms
[2025-06-03 19:09:33] [INFO ] Flatten gal took : 16 ms
[2025-06-03 19:09:33] [INFO ] Input system was already deterministic with 544 transitions.
[2025-06-03 19:09:33] [INFO ] Flatten gal took : 16 ms
[2025-06-03 19:09:33] [INFO ] Flatten gal took : 25 ms
[2025-06-03 19:09:33] [INFO ] Time to serialize gal into /tmp/CTLFireability8365999210779944706.gal : 4 ms
[2025-06-03 19:09:33] [INFO ] Time to serialize properties into /tmp/CTLFireability7845898353376563913.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8365999210779944706.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7845898353376563913.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 19:10:03] [INFO ] Flatten gal took : 26 ms
[2025-06-03 19:10:03] [INFO ] Applying decomposition
[2025-06-03 19:10:03] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9237677153716247002.txt' '-o' '/tmp/graph9237677153716247002.bin' '-w' '/tmp/graph9237677153716247002.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9237677153716247002.bin' '-l' '-1' '-v' '-w' '/tmp/graph9237677153716247002.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:10:03] [INFO ] Decomposing Gal with order
[2025-06-03 19:10:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:10:03] [INFO ] Removed a total of 72 redundant transitions.
[2025-06-03 19:10:03] [INFO ] Flatten gal took : 26 ms
[2025-06-03 19:10:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 19:10:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13022410306471798380.gal : 5 ms
[2025-06-03 19:10:03] [INFO ] Time to serialize properties into /tmp/CTLFireability14066811819777831543.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13022410306471798380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14066811819777831543.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 579/579 places, 597/597 transitions.
Graph (trivial) has 493 edges and 579 vertex of which 6 / 579 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 890 edges and 574 vertex of which 537 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.2 ms
Discarding 37 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 289 transitions
Trivial Post-agglo rules discarded 289 transitions
Performed 289 trivial Post agglomeration. Transition count delta: 289
Iterating post reduction 0 with 289 rules applied. Total rules applied 291 place count 536 transition count 298
Reduce places removed 289 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 315 rules applied. Total rules applied 606 place count 247 transition count 272
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 615 place count 238 transition count 272
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 615 place count 238 transition count 206
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 747 place count 172 transition count 206
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 780 place count 139 transition count 173
Iterating global reduction 3 with 33 rules applied. Total rules applied 813 place count 139 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 814 place count 139 transition count 172
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 815 place count 138 transition count 171
Iterating global reduction 4 with 1 rules applied. Total rules applied 816 place count 138 transition count 171
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 944 place count 74 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 946 place count 73 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 947 place count 72 transition count 105
Applied a total of 947 rules in 28 ms. Remains 72 /579 variables (removed 507) and now considering 105/597 (removed 492) transitions.
// Phase 1: matrix 105 rows 72 cols
[2025-06-03 19:10:33] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:10:33] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-03 19:10:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 19:10:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 19:10:34] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 19:10:34] [INFO ] Redundant transitions in 2 ms returned []
Running 102 sub problems to find dead transitions.
[2025-06-03 19:10:34] [INFO ] Invariant cache hit.
[2025-06-03 19:10:34] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 104/173 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 3/176 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 1/177 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/177 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 73 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5897 ms.
Refiners :[State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 104/173 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 3/176 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 102/174 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/177 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 175 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6858 ms.
Refiners :[State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12793ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 12793ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/579 places, 105/597 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12998 ms. Remains : 72/579 places, 105/597 transitions.
[2025-06-03 19:10:46] [INFO ] Flatten gal took : 5 ms
[2025-06-03 19:10:46] [INFO ] Flatten gal took : 4 ms
[2025-06-03 19:10:46] [INFO ] Input system was already deterministic with 105 transitions.
[2025-06-03 19:10:46] [INFO ] Flatten gal took : 3 ms
[2025-06-03 19:10:46] [INFO ] Flatten gal took : 3 ms
[2025-06-03 19:10:46] [INFO ] Time to serialize gal into /tmp/CTLFireability4155725044637646841.gal : 1 ms
[2025-06-03 19:10:46] [INFO ] Time to serialize properties into /tmp/CTLFireability4189103444281797348.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4155725044637646841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4189103444281797348.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.8584e+17,7.02965,137724,2,1788,5,973860,6,0,393,557496,0
Converting to forward existential form...Done !
original formula: AG(AF((((p422==1)&&(p625==1))&&(p640==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((p422==1)&&(p625==1))&&(p640==1))))] = FALSE
Hit Full ! (commute/partial/dont) 68/0/37
(forward)formula 0,0,7.29869,137724,1,0,8,973860,20,3,2174,557496,8
FORMULA GPUForwardProgress-PT-32b-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2025-06-03 19:10:54] [INFO ] Flatten gal took : 23 ms
[2025-06-03 19:10:54] [INFO ] Flatten gal took : 26 ms
[2025-06-03 19:10:54] [INFO ] Applying decomposition
[2025-06-03 19:10:54] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1490246855347288626.txt' '-o' '/tmp/graph1490246855347288626.bin' '-w' '/tmp/graph1490246855347288626.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1490246855347288626.bin' '-l' '-1' '-v' '-w' '/tmp/graph1490246855347288626.weights' '-q' '0' '-e' '0.001'
[2025-06-03 19:10:54] [INFO ] Decomposing Gal with order
[2025-06-03 19:10:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:10:54] [INFO ] Removed a total of 69 redundant transitions.
[2025-06-03 19:10:54] [INFO ] Flatten gal took : 42 ms
[2025-06-03 19:10:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 19:10:54] [INFO ] Time to serialize gal into /tmp/CTLFireability14578364087213592493.gal : 7 ms
[2025-06-03 19:10:54] [INFO ] Time to serialize properties into /tmp/CTLFireability5006921227967504511.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14578364087213592493.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5006921227967504511.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Detected timeout of ITS tools.
[2025-06-03 19:38:56] [INFO ] Applying decomposition
[2025-06-03 19:38:57] [INFO ] Flatten gal took : 395 ms
[2025-06-03 19:38:57] [INFO ] Decomposing Gal with order
[2025-06-03 19:38:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 19:38:59] [INFO ] Removed a total of 124 redundant transitions.
[2025-06-03 19:38:59] [INFO ] Flatten gal took : 392 ms
[2025-06-03 19:39:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 1116 labels/synchronizations in 1391 ms.
[2025-06-03 19:39:01] [INFO ] Time to serialize gal into /tmp/CTLFireability13252940789678711581.gal : 67 ms
[2025-06-03 19:39:01] [INFO ] Time to serialize properties into /tmp/CTLFireability9487806077755547051.ctl : 48 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13252940789678711581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9487806077755547051.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 10 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.58587e+40,2.33621,59500,544,332,104282,1685,615,366938,169,10531,0
Converting to forward existential form...Done !
original formula: E(EG((((AG(AX((i0.u65.p627==1))) + !((((i0.i0.i0.i0.i0.i0.i0.i0.u58.p489==1)||(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u53.p398==1)&&(i0...1114
=> equivalent forward existential formula: [(FwdU(Init,EG((((!(E(TRUE U !(!(EX(!((i0.u65.p627==1))))))) + !((((i0.i0.i0.i0.i0.i0.i0.i0.u58.p489==1)||(((i0....1196
Reverse transition relation is NOT exact ! Due to transitions t531, u66.t3, u66.t7, u66.t8, u66.t12, i0.u65.t16, i0.u65.t24, i0.u65.t26, i0.i0.u64.t31, i0....4222
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-32b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-32b, 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 r100-smll-174867008000498"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-32b.tgz
mv GPUForwardProgress-PT-32b 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 '
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 ;