Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r175-smll-171636280300253.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is FamilyReunion-COL-L00050M0005C002P002G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636280300253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 6.8K Apr 11 20:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 11 20:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 20:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 20:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 21:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 11 21:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 11 21:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 11 21:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 137K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-00
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-01
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-02
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-03
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-04
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-05
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-07
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-08
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-09
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-10
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-12
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-13
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-14
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716588759863

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00050M0005C002P002G001
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-24 22:12:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 22:12:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 22:12:42] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-24 22:12:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 22:12:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1176 ms
[2024-05-24 22:12:43] [INFO ] Detected 5 constant HL places corresponding to 17 PT places.
[2024-05-24 22:12:43] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 12245 PT places and 10611.0 transition bindings in 52 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-24 22:12:43] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 9 ms.
[2024-05-24 22:12:43] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10005 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 23) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 66 rows 99 cols
[2024-05-24 22:12:44] [INFO ] Computed 33 invariants in 19 ms
[2024-05-24 22:12:44] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2024-05-24 22:12:44] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 20 ms returned sat
[2024-05-24 22:12:44] [INFO ] After 99ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-24 22:12:44] [INFO ] After 178ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 22:12:44] [INFO ] After 474ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 22:12:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-24 22:12:44] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 18 ms returned sat
[2024-05-24 22:12:45] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 22:12:45] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-24 22:12:45] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 167 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=18 )
Parikh walk visited 2 properties in 11 ms.
[2024-05-24 22:12:45] [INFO ] Flatten gal took : 60 ms
[2024-05-24 22:12:45] [INFO ] Flatten gal took : 14 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 3
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
[2024-05-24 22:12:45] [INFO ] Unfolded HLPN to a Petri net with 11467 places and 9336 transitions 26832 arcs in 156 ms.
[2024-05-24 22:12:45] [INFO ] Unfolded 14 HLPN properties in 4 ms.
[2024-05-24 22:12:45] [INFO ] Reduced 255 identical enabling conditions.
[2024-05-24 22:12:45] [INFO ] Reduced 102 identical enabling conditions.
Deduced a syphon composed of 51 places in 80 ms
Reduce places removed 64 places and 0 transitions.
Support contains 4090 out of 11403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11403/11403 places, 9336/9336 transitions.
Reduce places removed 168 places and 0 transitions.
Discarding 1122 places :
Implicit places reduction removed 1122 places
Iterating post reduction 0 with 1290 rules applied. Total rules applied 1290 place count 10113 transition count 9336
Discarding 305 places :
Symmetric choice reduction at 1 with 305 rule applications. Total rules 1595 place count 9808 transition count 9031
Iterating global reduction 1 with 305 rules applied. Total rules applied 1900 place count 9808 transition count 9031
Discarding 255 places :
Symmetric choice reduction at 1 with 255 rule applications. Total rules 2155 place count 9553 transition count 8776
Iterating global reduction 1 with 255 rules applied. Total rules applied 2410 place count 9553 transition count 8776
Applied a total of 2410 rules in 4394 ms. Remains 9553 /11403 variables (removed 1850) and now considering 8776/9336 (removed 560) transitions.
// Phase 1: matrix 8776 rows 9553 cols
[2024-05-24 22:12:50] [INFO ] Computed 1535 invariants in 574 ms
[2024-05-24 22:12:52] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:12:52] [INFO ] Implicit Places using invariants in 2197 ms returned []
[2024-05-24 22:12:52] [INFO ] Invariant cache hit.
[2024-05-24 22:12:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:12:53] [INFO ] Implicit Places using invariants and state equation in 1395 ms returned []
Implicit Place search using SMT with State Equation took 3599 ms to find 0 implicit places.
[2024-05-24 22:12:53] [INFO ] Invariant cache hit.
[2024-05-24 22:12:55] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:12:55] [INFO ] Dead Transitions using invariants and state equation in 1383 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9553/11403 places, 8776/9336 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9380 ms. Remains : 9553/11403 places, 8776/9336 transitions.
Support contains 4090 out of 9553 places after structural reductions.
[2024-05-24 22:12:56] [INFO ] Flatten gal took : 794 ms
[2024-05-24 22:12:56] [INFO ] Flatten gal took : 432 ms
[2024-05-24 22:12:57] [INFO ] Input system was already deterministic with 8776 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 693 ms. (steps per millisecond=14 ) properties (out of 27) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 22:12:58] [INFO ] Invariant cache hit.
[2024-05-24 22:13:01] [INFO ] [Real]Absence check using 0 positive and 1535 generalized place invariants in 847 ms returned sat
[2024-05-24 22:13:19] [INFO ] After 20759ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 22:13:22] [INFO ] [Nat]Absence check using 0 positive and 1535 generalized place invariants in 991 ms returned sat
[2024-05-24 22:13:44] [INFO ] After 25064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 102 out of 9553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9553/9553 places, 8776/8776 transitions.
Graph (complete) has 13413 edges and 9553 vertex of which 9498 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.25 ms
Discarding 55 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 969 places :
Implicit places reduction removed 969 places
Drop transitions removed 5049 transitions
Trivial Post-agglo rules discarded 5049 transitions
Performed 5049 trivial Post agglomeration. Transition count delta: 5049
Iterating post reduction 0 with 6120 rules applied. Total rules applied 6121 place count 8529 transition count 3621
Reduce places removed 5049 places and 0 transitions.
Performed 306 Post agglomeration using F-continuation condition.Transition count delta: 306
Iterating post reduction 1 with 5355 rules applied. Total rules applied 11476 place count 3480 transition count 3315
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 2 with 306 rules applied. Total rules applied 11782 place count 3174 transition count 3315
Performed 765 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 765 Pre rules applied. Total rules applied 11782 place count 3174 transition count 2550
Deduced a syphon composed of 765 places in 1 ms
Ensure Unique test removed 306 places
Reduce places removed 1071 places and 0 transitions.
Iterating global reduction 3 with 1836 rules applied. Total rules applied 13618 place count 2103 transition count 2550
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 3 with 204 rules applied. Total rules applied 13822 place count 2103 transition count 2346
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 4 with 204 rules applied. Total rules applied 14026 place count 1899 transition count 2346
Discarding 464 places :
Symmetric choice reduction at 5 with 464 rule applications. Total rules 14490 place count 1435 transition count 1632
Iterating global reduction 5 with 464 rules applied. Total rules applied 14954 place count 1435 transition count 1632
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 5 with 204 rules applied. Total rules applied 15158 place count 1384 transition count 1479
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 6 with 153 rules applied. Total rules applied 15311 place count 1231 transition count 1479
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 15311 place count 1231 transition count 1428
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 15413 place count 1180 transition count 1428
Discarding 257 places :
Symmetric choice reduction at 7 with 257 rule applications. Total rules 15670 place count 923 transition count 1071
Iterating global reduction 7 with 257 rules applied. Total rules applied 15927 place count 923 transition count 1071
Ensure Unique test removed 357 transitions
Reduce isomorphic transitions removed 357 transitions.
Discarding 153 places :
Implicit places reduction removed 153 places
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 7 with 612 rules applied. Total rules applied 16539 place count 770 transition count 612
Reduce places removed 102 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 8 with 153 rules applied. Total rules applied 16692 place count 668 transition count 561
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 9 with 51 rules applied. Total rules applied 16743 place count 617 transition count 561
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 51 Pre rules applied. Total rules applied 16743 place count 617 transition count 510
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 10 with 102 rules applied. Total rules applied 16845 place count 566 transition count 510
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 10 with 102 rules applied. Total rules applied 16947 place count 515 transition count 459
Free-agglomeration rule (complex) applied 102 times.
Iterating global reduction 10 with 102 rules applied. Total rules applied 17049 place count 515 transition count 357
Ensure Unique test removed 51 places
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 10 with 153 rules applied. Total rules applied 17202 place count 362 transition count 357
Applied a total of 17202 rules in 1015 ms. Remains 362 /9553 variables (removed 9191) and now considering 357/8776 (removed 8419) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1015 ms. Remains : 362/9553 places, 357/8776 transitions.
Finished random walk after 105 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=35 )
Parikh walk visited 0 properties in 0 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 9553 stabilizing places and 8776 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9553 transition count 8776
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((!p0||X(F((F(p0)&&p1))))))))))'
Support contains 51 out of 9553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9553/9553 places, 8776/8776 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Iterating post reduction 0 with 918 rules applied. Total rules applied 918 place count 8635 transition count 8776
Discarding 768 places :
Symmetric choice reduction at 1 with 768 rule applications. Total rules 1686 place count 7867 transition count 8008
Iterating global reduction 1 with 768 rules applied. Total rules applied 2454 place count 7867 transition count 8008
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 2511 place count 7810 transition count 7601
Iterating global reduction 1 with 57 rules applied. Total rules applied 2568 place count 7810 transition count 7601
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 102 rules applied. Total rules applied 2670 place count 7708 transition count 7601
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 3027 place count 7351 transition count 7244
Iterating global reduction 2 with 357 rules applied. Total rules applied 3384 place count 7351 transition count 7244
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 3741 place count 6994 transition count 6887
Iterating global reduction 2 with 357 rules applied. Total rules applied 4098 place count 6994 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4353 place count 6739 transition count 6632
Iterating global reduction 2 with 255 rules applied. Total rules applied 4608 place count 6739 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4863 place count 6484 transition count 6377
Iterating global reduction 2 with 255 rules applied. Total rules applied 5118 place count 6484 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5373 place count 6229 transition count 6122
Iterating global reduction 2 with 255 rules applied. Total rules applied 5628 place count 6229 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5883 place count 5974 transition count 5867
Iterating global reduction 2 with 255 rules applied. Total rules applied 6138 place count 5974 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6393 place count 5719 transition count 5612
Iterating global reduction 2 with 255 rules applied. Total rules applied 6648 place count 5719 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6903 place count 5464 transition count 5357
Iterating global reduction 2 with 255 rules applied. Total rules applied 7158 place count 5464 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7413 place count 5209 transition count 5102
Iterating global reduction 2 with 255 rules applied. Total rules applied 7668 place count 5209 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7923 place count 4954 transition count 4847
Iterating global reduction 2 with 255 rules applied. Total rules applied 8178 place count 4954 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8433 place count 4699 transition count 4592
Iterating global reduction 2 with 255 rules applied. Total rules applied 8688 place count 4699 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8943 place count 4444 transition count 4337
Iterating global reduction 2 with 255 rules applied. Total rules applied 9198 place count 4444 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 9453 place count 4189 transition count 4082
Iterating global reduction 2 with 255 rules applied. Total rules applied 9708 place count 4189 transition count 4082
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 306 rules applied. Total rules applied 10014 place count 4138 transition count 3827
Applied a total of 10014 rules in 19495 ms. Remains 4138 /9553 variables (removed 5415) and now considering 3827/8776 (removed 4949) transitions.
// Phase 1: matrix 3827 rows 4138 cols
[2024-05-24 22:14:06] [INFO ] Computed 464 invariants in 91 ms
[2024-05-24 22:14:06] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:14:07] [INFO ] Implicit Places using invariants in 1972 ms returned [1711, 1717, 1723, 2536]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1978 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4134/9553 places, 3827/8776 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 4129 transition count 3822
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 4129 transition count 3822
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 4127 transition count 3818
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 4127 transition count 3818
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 4125 transition count 3816
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 4125 transition count 3816
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 4123 transition count 3814
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 4123 transition count 3814
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 4121 transition count 3812
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 4121 transition count 3812
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 4119 transition count 3810
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 4119 transition count 3810
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 4117 transition count 3808
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 4117 transition count 3808
Applied a total of 34 rules in 4185 ms. Remains 4117 /4134 variables (removed 17) and now considering 3808/3827 (removed 19) transitions.
// Phase 1: matrix 3808 rows 4117 cols
[2024-05-24 22:14:12] [INFO ] Computed 460 invariants in 116 ms
[2024-05-24 22:14:12] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:14:14] [INFO ] Implicit Places using invariants in 2172 ms returned [2513]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2175 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4116/9553 places, 3808/8776 transitions.
Applied a total of 0 rules in 521 ms. Remains 4116 /4116 variables (removed 0) and now considering 3808/3808 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 28357 ms. Remains : 4116/9553 places, 3808/8776 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 472 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(OR (GEQ s1039 1) (GEQ s1041 1) (GEQ s1035 1) (GEQ s1037 1) (GEQ s1031 1) (GEQ s1033 1) (GEQ s1027 1) (GEQ s1029 1) (GEQ s1023 1) (GEQ s1025 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 2264 ms.
Product exploration explored 100000 steps with 20000 reset in 2115 ms.
Computed a total of 4116 stabilizing places and 3808 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4116 transition count 3808
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), true, (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 23 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-00 finished in 34900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(G(p0))) U (F(p1)&&(F(!p3)||p2))))))'
Support contains 669 out of 9553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9553/9553 places, 8776/8776 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Iterating post reduction 0 with 918 rules applied. Total rules applied 918 place count 8635 transition count 8776
Discarding 768 places :
Symmetric choice reduction at 1 with 768 rule applications. Total rules 1686 place count 7867 transition count 8008
Iterating global reduction 1 with 768 rules applied. Total rules applied 2454 place count 7867 transition count 8008
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 2506 place count 7815 transition count 7856
Iterating global reduction 1 with 52 rules applied. Total rules applied 2558 place count 7815 transition count 7856
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2609 place count 7764 transition count 7856
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 2711 place count 7662 transition count 7754
Iterating global reduction 2 with 102 rules applied. Total rules applied 2813 place count 7662 transition count 7754
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 2915 place count 7560 transition count 7652
Iterating global reduction 2 with 102 rules applied. Total rules applied 3017 place count 7560 transition count 7652
Applied a total of 3017 rules in 8423 ms. Remains 7560 /9553 variables (removed 1993) and now considering 7652/8776 (removed 1124) transitions.
// Phase 1: matrix 7652 rows 7560 cols
[2024-05-24 22:14:29] [INFO ] Computed 566 invariants in 129 ms
[2024-05-24 22:14:30] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:14:30] [INFO ] Implicit Places using invariants in 1191 ms returned []
[2024-05-24 22:14:30] [INFO ] Invariant cache hit.
[2024-05-24 22:14:31] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:14:31] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 2257 ms to find 0 implicit places.
[2024-05-24 22:14:31] [INFO ] Invariant cache hit.
[2024-05-24 22:14:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:14:33] [INFO ] Dead Transitions using invariants and state equation in 1067 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7560/9553 places, 7652/8776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11758 ms. Remains : 7560/9553 places, 7652/8776 transitions.
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p1) (AND (NOT p2) p3)), (OR (NOT p1) (AND (NOT p2) p3)), (NOT p1), (OR (AND (NOT p1) p3) (AND (NOT p2) p3) (AND (NOT p0) p3)), (AND p3 (NOT p0)), (AND (NOT p1) p3), p3]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p3), acceptance={0} source=3 dest: 3}, { cond=p3, acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p2 p3), acceptance={0} source=3 dest: 5}], [{ cond=(AND p3 p0), acceptance={} source=4 dest: 4}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) p3), acceptance={0} source=5 dest: 5}], [{ cond=p3, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (GEQ s6306 1) (GEQ s6241 1) (GEQ s6302 1) (GEQ s6237 1) (GEQ s6233 1) (GEQ s6298 1) (GEQ s6294 1) (GEQ s6229 1) (GEQ s6257 1) (GEQ s6192 1) (GEQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 96 reset in 1571 ms.
Product exploration explored 100000 steps with 96 reset in 1582 ms.
Computed a total of 7560 stabilizing places and 7652 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7560 transition count 7652
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p2) p3))), true, (X (X (NOT p1))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 125 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Finished random walk after 1051 steps, including 0 resets, run visited all 1 properties in 20 ms. (steps per millisecond=52 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p2) p3))), true, (X (X (NOT p1))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p3))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 12 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-01 finished in 19276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 210 out of 9553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9553/9553 places, 8776/8776 transitions.
Graph (complete) has 13413 edges and 9553 vertex of which 6738 are kept as prefixes of interest. Removing 2815 places using SCC suffix rule.28 ms
Discarding 2815 places :
Also discarding 2452 output transitions
Drop transitions removed 2452 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Drop transitions removed 3774 transitions
Trivial Post-agglo rules discarded 3774 transitions
Performed 3774 trivial Post agglomeration. Transition count delta: 3774
Iterating post reduction 0 with 4692 rules applied. Total rules applied 4693 place count 5769 transition count 2499
Reduce places removed 3774 places and 0 transitions.
Performed 306 Post agglomeration using F-continuation condition.Transition count delta: 306
Iterating post reduction 1 with 4080 rules applied. Total rules applied 8773 place count 1995 transition count 2193
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 2 with 306 rules applied. Total rules applied 9079 place count 1689 transition count 2193
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 204 Pre rules applied. Total rules applied 9079 place count 1689 transition count 1989
Deduced a syphon composed of 204 places in 1 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 3 with 408 rules applied. Total rules applied 9487 place count 1485 transition count 1989
Discarding 255 places :
Symmetric choice reduction at 3 with 255 rule applications. Total rules 9742 place count 1230 transition count 1734
Iterating global reduction 3 with 255 rules applied. Total rules applied 9997 place count 1230 transition count 1734
Applied a total of 9997 rules in 851 ms. Remains 1230 /9553 variables (removed 8323) and now considering 1734/8776 (removed 7042) transitions.
// Phase 1: matrix 1734 rows 1230 cols
[2024-05-24 22:14:41] [INFO ] Computed 103 invariants in 21 ms
[2024-05-24 22:14:42] [INFO ] Implicit Places using invariants in 1235 ms returned [357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 873, 874, 875, 876, 877, 878, 879, 880, 881, 882, 883, 884, 885, 886, 887, 888, 889, 890, 891, 892, 893, 894, 895, 896, 897, 898, 899, 900, 901, 902, 903, 904, 905, 906, 907, 908, 909, 910, 911, 912, 913, 914, 915, 916, 917, 918, 919, 920, 921, 922, 923]
Discarding 102 places :
Implicit Place search using SMT only with invariants took 1240 ms to find 102 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1128/9553 places, 1734/8776 transitions.
Drop transitions removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 0 with 306 rules applied. Total rules applied 306 place count 1128 transition count 1428
Reduce places removed 306 places and 0 transitions.
Iterating post reduction 1 with 306 rules applied. Total rules applied 612 place count 822 transition count 1428
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: -459
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 714 place count 771 transition count 1887
Applied a total of 714 rules in 114 ms. Remains 771 /1128 variables (removed 357) and now considering 1887/1734 (removed -153) transitions.
// Phase 1: matrix 1887 rows 771 cols
[2024-05-24 22:14:42] [INFO ] Computed 1 invariants in 33 ms
[2024-05-24 22:14:42] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-24 22:14:42] [INFO ] Invariant cache hit.
[2024-05-24 22:14:43] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 771/9553 places, 1887/8776 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3131 ms. Remains : 771/9553 places, 1887/8776 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s654 1) (LT s719 1) (LT s723 1) (LT s658 1) (LT s727 1) (LT s662 1) (LT s666 1) (LT s731 1) (LT s703 1) (LT s638 1) (LT s768 1) (LT s642 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1038 reset in 2012 ms.
Product exploration explored 100000 steps with 1038 reset in 2015 ms.
Computed a total of 771 stabilizing places and 1887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 771 transition count 1887
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-02 finished in 10173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(G(p1)))))'
Support contains 663 out of 9553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9553/9553 places, 8776/8776 transitions.
Graph (complete) has 13413 edges and 9553 vertex of which 9191 are kept as prefixes of interest. Removing 362 places using SCC suffix rule.12 ms
Discarding 362 places :
Also discarding 361 output transitions
Drop transitions removed 361 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Drop transitions removed 4284 transitions
Trivial Post-agglo rules discarded 4284 transitions
Performed 4284 trivial Post agglomeration. Transition count delta: 4284
Iterating post reduction 0 with 4896 rules applied. Total rules applied 4897 place count 8528 transition count 4080
Reduce places removed 4284 places and 0 transitions.
Iterating post reduction 1 with 4284 rules applied. Total rules applied 9181 place count 4244 transition count 4080
Performed 969 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 969 Pre rules applied. Total rules applied 9181 place count 4244 transition count 3111
Deduced a syphon composed of 969 places in 1 ms
Ensure Unique test removed 306 places
Reduce places removed 1275 places and 0 transitions.
Iterating global reduction 2 with 2244 rules applied. Total rules applied 11425 place count 2969 transition count 3111
Drop transitions removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 2 with 204 rules applied. Total rules applied 11629 place count 2969 transition count 2907
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 3 with 204 rules applied. Total rules applied 11833 place count 2765 transition count 2907
Discarding 209 places :
Symmetric choice reduction at 4 with 209 rule applications. Total rules 12042 place count 2556 transition count 2448
Iterating global reduction 4 with 209 rules applied. Total rules applied 12251 place count 2556 transition count 2448
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 4 with 204 rules applied. Total rules applied 12455 place count 2505 transition count 2295
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 5 with 153 rules applied. Total rules applied 12608 place count 2352 transition count 2295
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 51 Pre rules applied. Total rules applied 12608 place count 2352 transition count 2244
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 12710 place count 2301 transition count 2244
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 12712 place count 2299 transition count 2142
Iterating global reduction 6 with 2 rules applied. Total rules applied 12714 place count 2299 transition count 2142
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 6 with 306 rules applied. Total rules applied 13020 place count 2197 transition count 1938
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 7 with 102 rules applied. Total rules applied 13122 place count 2095 transition count 1938
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 51 Pre rules applied. Total rules applied 13122 place count 2095 transition count 1887
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 13224 place count 2044 transition count 1887
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 13326 place count 1993 transition count 1836
Applied a total of 13326 rules in 772 ms. Remains 1993 /9553 variables (removed 7560) and now considering 1836/8776 (removed 6940) transitions.
// Phase 1: matrix 1836 rows 1993 cols
[2024-05-24 22:14:51] [INFO ] Computed 412 invariants in 32 ms
[2024-05-24 22:14:52] [INFO ] Implicit Places using invariants in 1303 ms returned [357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 459, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520, 521, 522, 523, 524, 525, 526, 527, 528, 529, 530, 531, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 1992]
Discarding 104 places :
Implicit Place search using SMT only with invariants took 1310 ms to find 104 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1889/9553 places, 1836/8776 transitions.
Drop transitions removed 408 transitions
Trivial Post-agglo rules discarded 408 transitions
Performed 408 trivial Post agglomeration. Transition count delta: 408
Iterating post reduction 0 with 408 rules applied. Total rules applied 408 place count 1889 transition count 1428
Reduce places removed 408 places and 0 transitions.
Iterating post reduction 1 with 408 rules applied. Total rules applied 816 place count 1481 transition count 1428
Applied a total of 816 rules in 54 ms. Remains 1481 /1889 variables (removed 408) and now considering 1428/1836 (removed 408) transitions.
// Phase 1: matrix 1428 rows 1481 cols
[2024-05-24 22:14:52] [INFO ] Computed 308 invariants in 20 ms
[2024-05-24 22:14:53] [INFO ] Implicit Places using invariants in 564 ms returned []
[2024-05-24 22:14:53] [INFO ] Invariant cache hit.
[2024-05-24 22:14:54] [INFO ] Implicit Places using invariants and state equation in 1337 ms returned []
Implicit Place search using SMT with State Equation took 1905 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1481/9553 places, 1428/8776 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4043 ms. Remains : 1481/9553 places, 1428/8776 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s1075 1) (LT s1381 1)) (OR (LT s927 1) (LT s1233 1)) (OR (LT s1070 1) (LT s1376 1)) (OR (LT s922 1) (LT s1228 1)) (OR (LT s932 1) (LT s123...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 389 reset in 1768 ms.
Product exploration explored 100000 steps with 389 reset in 1806 ms.
Computed a total of 1481 stabilizing places and 1428 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1481 transition count 1428
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-03 finished in 11887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Support contains 357 out of 9553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9553/9553 places, 8776/8776 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Iterating post reduction 0 with 918 rules applied. Total rules applied 918 place count 8635 transition count 8776
Discarding 666 places :
Symmetric choice reduction at 1 with 666 rule applications. Total rules 1584 place count 7969 transition count 8110
Iterating global reduction 1 with 666 rules applied. Total rules applied 2250 place count 7969 transition count 8110
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 2305 place count 7914 transition count 7805
Iterating global reduction 1 with 55 rules applied. Total rules applied 2360 place count 7914 transition count 7805
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2411 place count 7863 transition count 7805
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 2666 place count 7608 transition count 7550
Iterating global reduction 2 with 255 rules applied. Total rules applied 2921 place count 7608 transition count 7550
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3176 place count 7353 transition count 7295
Iterating global reduction 2 with 255 rules applied. Total rules applied 3431 place count 7353 transition count 7295
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3686 place count 7098 transition count 7040
Iterating global reduction 2 with 255 rules applied. Total rules applied 3941 place count 7098 transition count 7040
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4196 place count 6843 transition count 6785
Iterating global reduction 2 with 255 rules applied. Total rules applied 4451 place count 6843 transition count 6785
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4706 place count 6588 transition count 6530
Iterating global reduction 2 with 255 rules applied. Total rules applied 4961 place count 6588 transition count 6530
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5216 place count 6333 transition count 6275
Iterating global reduction 2 with 255 rules applied. Total rules applied 5471 place count 6333 transition count 6275
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5726 place count 6078 transition count 6020
Iterating global reduction 2 with 255 rules applied. Total rules applied 5981 place count 6078 transition count 6020
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6236 place count 5823 transition count 5765
Iterating global reduction 2 with 255 rules applied. Total rules applied 6491 place count 5823 transition count 5765
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6746 place count 5568 transition count 5510
Iterating global reduction 2 with 255 rules applied. Total rules applied 7001 place count 5568 transition count 5510
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7256 place count 5313 transition count 5255
Iterating global reduction 2 with 255 rules applied. Total rules applied 7511 place count 5313 transition count 5255
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7766 place count 5058 transition count 5000
Iterating global reduction 2 with 255 rules applied. Total rules applied 8021 place count 5058 transition count 5000
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8276 place count 4803 transition count 4745
Iterating global reduction 2 with 255 rules applied. Total rules applied 8531 place count 4803 transition count 4745
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8786 place count 4548 transition count 4490
Iterating global reduction 2 with 255 rules applied. Total rules applied 9041 place count 4548 transition count 4490
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 306 rules applied. Total rules applied 9347 place count 4497 transition count 4235
Applied a total of 9347 rules in 21247 ms. Remains 4497 /9553 variables (removed 5056) and now considering 4235/8776 (removed 4541) transitions.
// Phase 1: matrix 4235 rows 4497 cols
[2024-05-24 22:15:23] [INFO ] Computed 515 invariants in 88 ms
[2024-05-24 22:15:24] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:15:26] [INFO ] Implicit Places using invariants in 2304 ms returned [1711, 1717, 1723, 2523]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2309 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4493/9553 places, 4235/8776 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 4488 transition count 4230
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 4488 transition count 4230
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 4486 transition count 4226
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 4486 transition count 4226
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 4484 transition count 4224
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 4484 transition count 4224
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 4482 transition count 4222
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 4482 transition count 4222
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 4480 transition count 4220
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 4480 transition count 4220
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 4478 transition count 4218
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 4478 transition count 4218
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 4476 transition count 4216
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 4476 transition count 4216
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 4474 transition count 4214
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 4474 transition count 4214
Applied a total of 38 rules in 5359 ms. Remains 4474 /4493 variables (removed 19) and now considering 4214/4235 (removed 21) transitions.
// Phase 1: matrix 4214 rows 4474 cols
[2024-05-24 22:15:31] [INFO ] Computed 511 invariants in 79 ms
[2024-05-24 22:15:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:15:33] [INFO ] Implicit Places using invariants in 2340 ms returned [2503]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2344 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4473/9553 places, 4214/8776 transitions.
Applied a total of 0 rules in 574 ms. Remains 4473 /4473 variables (removed 0) and now considering 4214/4214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31836 ms. Remains : 4473/9553 places, 4214/8776 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s3844 1) (GEQ s3965 1)) (AND (GEQ s3825 1) (GEQ s3906 1)) (AND (GEQ s3838 1) (GEQ s3946 1)) (AND (GEQ s3831 1) (GEQ s3925 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 34 reset in 2152 ms.
Product exploration explored 100000 steps with 34 reset in 2181 ms.
Computed a total of 4473 stabilizing places and 4214 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4473 transition count 4214
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (X p1)), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 123 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Finished random walk after 1940 steps, including 0 resets, run visited all 3 properties in 127 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (X p1)), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 220 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
// Phase 1: matrix 4214 rows 4473 cols
[2024-05-24 22:15:41] [INFO ] Computed 510 invariants in 82 ms
[2024-05-24 22:15:52] [INFO ] [Real]Absence check using 0 positive and 510 generalized place invariants in 1407 ms returned sat
[2024-05-24 22:15:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 22:15:56] [INFO ] [Real]Absence check using state equation in 4766 ms returned unknown
Could not prove EG (NOT p0)
Support contains 357 out of 4473 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4473/4473 places, 4214/4214 transitions.
Graph (complete) has 6081 edges and 4473 vertex of which 3062 are kept as prefixes of interest. Removing 1411 places using SCC suffix rule.5 ms
Discarding 1411 places :
Also discarding 1205 output transitions
Drop transitions removed 1205 transitions
Reduce places removed 51 places and 51 transitions.
Drop transitions removed 1479 transitions
Trivial Post-agglo rules discarded 1479 transitions
Performed 1479 trivial Post agglomeration. Transition count delta: 1479
Iterating post reduction 0 with 1479 rules applied. Total rules applied 1480 place count 3011 transition count 1479
Reduce places removed 1479 places and 0 transitions.
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Iterating post reduction 1 with 1632 rules applied. Total rules applied 3112 place count 1532 transition count 1326
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 2 with 153 rules applied. Total rules applied 3265 place count 1379 transition count 1326
Performed 408 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 408 Pre rules applied. Total rules applied 3265 place count 1379 transition count 918
Deduced a syphon composed of 408 places in 0 ms
Ensure Unique test removed 153 places
Reduce places removed 561 places and 0 transitions.
Iterating global reduction 3 with 969 rules applied. Total rules applied 4234 place count 818 transition count 918
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 4336 place count 767 transition count 867
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 3 with 51 rules applied. Total rules applied 4387 place count 716 transition count 816
Applied a total of 4387 rules in 205 ms. Remains 716 /4473 variables (removed 3757) and now considering 816/4214 (removed 3398) transitions.
// Phase 1: matrix 816 rows 716 cols
[2024-05-24 22:15:57] [INFO ] Computed 102 invariants in 11 ms
[2024-05-24 22:15:57] [INFO ] Implicit Places using invariants in 651 ms returned [51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 653 ms to find 50 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 666/4473 places, 816/4214 transitions.
Applied a total of 0 rules in 11 ms. Remains 666 /666 variables (removed 0) and now considering 816/816 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 869 ms. Remains : 666/4473 places, 816/4214 transitions.
Computed a total of 666 stabilizing places and 816 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 666 transition count 816
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 175 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Finished random walk after 286 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (AND p0 p1)), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 365 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
// Phase 1: matrix 816 rows 666 cols
[2024-05-24 22:15:59] [INFO ] Computed 52 invariants in 6 ms
[2024-05-24 22:16:01] [INFO ] [Real]Absence check using 0 positive and 52 generalized place invariants in 55 ms returned sat
[2024-05-24 22:16:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 22:16:02] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2024-05-24 22:16:02] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 62 ms.
[2024-05-24 22:16:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 22:16:06] [INFO ] [Nat]Absence check using 0 positive and 52 generalized place invariants in 35 ms returned sat
[2024-05-24 22:16:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 22:16:07] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2024-05-24 22:16:07] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 71 ms.
[2024-05-24 22:16:09] [INFO ] Added : 191 causal constraints over 39 iterations in 2384 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Product exploration explored 100000 steps with 325 reset in 1539 ms.
Product exploration explored 100000 steps with 325 reset in 1586 ms.
Built C files in :
/tmp/ltsmin9959785447888785880
[2024-05-24 22:16:12] [INFO ] Computing symmetric may disable matrix : 816 transitions.
[2024-05-24 22:16:12] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 22:16:12] [INFO ] Computing symmetric may enable matrix : 816 transitions.
[2024-05-24 22:16:12] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 22:16:12] [INFO ] Computing Do-Not-Accords matrix : 816 transitions.
[2024-05-24 22:16:12] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 22:16:12] [INFO ] Built C files in 226ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9959785447888785880
Running compilation step : cd /tmp/ltsmin9959785447888785880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9959785447888785880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9959785447888785880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 357 out of 666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 816/816 transitions.
Applied a total of 0 rules in 12 ms. Remains 666 /666 variables (removed 0) and now considering 816/816 (removed 0) transitions.
[2024-05-24 22:16:16] [INFO ] Invariant cache hit.
[2024-05-24 22:16:16] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-24 22:16:16] [INFO ] Invariant cache hit.
[2024-05-24 22:16:17] [INFO ] Implicit Places using invariants and state equation in 1257 ms returned []
Implicit Place search using SMT with State Equation took 1452 ms to find 0 implicit places.
[2024-05-24 22:16:17] [INFO ] Redundant transitions in 68 ms returned []
[2024-05-24 22:16:17] [INFO ] Invariant cache hit.
[2024-05-24 22:16:18] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2204 ms. Remains : 666/666 places, 816/816 transitions.
Built C files in :
/tmp/ltsmin5245484922046394844
[2024-05-24 22:16:18] [INFO ] Computing symmetric may disable matrix : 816 transitions.
[2024-05-24 22:16:18] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 22:16:18] [INFO ] Computing symmetric may enable matrix : 816 transitions.
[2024-05-24 22:16:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 22:16:18] [INFO ] Computing Do-Not-Accords matrix : 816 transitions.
[2024-05-24 22:16:18] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 22:16:18] [INFO ] Built C files in 170ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5245484922046394844
Running compilation step : cd /tmp/ltsmin5245484922046394844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5245484922046394844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5245484922046394844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 22:16:21] [INFO ] Flatten gal took : 34 ms
[2024-05-24 22:16:21] [INFO ] Flatten gal took : 33 ms
[2024-05-24 22:16:21] [INFO ] Time to serialize gal into /tmp/LTL8633078414822353246.gal : 11 ms
[2024-05-24 22:16:21] [INFO ] Time to serialize properties into /tmp/LTL7184146353380506567.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8633078414822353246.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4835350170379892918.hoa' '-atoms' '/tmp/LTL7184146353380506567.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7184146353380506567.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4835350170379892918.hoa
Detected timeout of ITS tools.
[2024-05-24 22:16:37] [INFO ] Flatten gal took : 27 ms
[2024-05-24 22:16:37] [INFO ] Flatten gal took : 27 ms
[2024-05-24 22:16:37] [INFO ] Time to serialize gal into /tmp/LTL10348710426501238529.gal : 5 ms
[2024-05-24 22:16:37] [INFO ] Time to serialize properties into /tmp/LTL15085287814966799221.ltl : 5 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10348710426501238529.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15085287814966799221.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((((((((p6_32<1)&&(p6_93<1))&&((p6_28<1)&&(p6_89<1)))&&(((p6_40<1)&&(p6_101<1))&&((p6_36<1)&&(p6_97<1))))&&((((p6_16<1)&&(...6672
Formula 0 simplified : XG(!"((((((((((l20_34>=1)&&(pl1_104>=1))||((l20_15>=1)&&(pl1_45>=1)))||(((l20_28>=1)&&(pl1_85>=1))||((l20_21>=1)&&(pl1_64>=1))))||((...6664
Detected timeout of ITS tools.
[2024-05-24 22:16:52] [INFO ] Flatten gal took : 26 ms
[2024-05-24 22:16:52] [INFO ] Applying decomposition
[2024-05-24 22:16:52] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16745376329745903117.txt' '-o' '/tmp/graph16745376329745903117.bin' '-w' '/tmp/graph16745376329745903117.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16745376329745903117.bin' '-l' '-1' '-v' '-w' '/tmp/graph16745376329745903117.weights' '-q' '0' '-e' '0.001'
[2024-05-24 22:16:52] [INFO ] Decomposing Gal with order
[2024-05-24 22:16:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 22:16:52] [INFO ] Removed a total of 530 redundant transitions.
[2024-05-24 22:16:52] [INFO ] Flatten gal took : 144 ms
[2024-05-24 22:16:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 22 ms.
[2024-05-24 22:16:52] [INFO ] Time to serialize gal into /tmp/LTL551528090167448613.gal : 20 ms
[2024-05-24 22:16:52] [INFO ] Time to serialize properties into /tmp/LTL18180987313929313521.ltl : 3 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL551528090167448613.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18180987313929313521.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((((((((i31.u78.p6_32<1)&&(i41.u41.p6_93<1))&&((i30.u74.p6_28<1)&&(i12.u39.p6_89<1)))&&(((i33.u17.p6_40<1)&&(i14.u44.p6_10...10563
Formula 0 simplified : XG(!"((((((((((i15.u158.l20_34>=1)&&(i15.u194.pl1_104>=1))||((i4.u210.l20_15>=1)&&(i4.u179.pl1_45>=1)))||(((i11.u154.l20_28>=1)&&(i1...10555
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13594424554393543241
[2024-05-24 22:17:07] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13594424554393543241
Running compilation step : cd /tmp/ltsmin13594424554393543241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2117 ms.
Running link step : cd /tmp/ltsmin13594424554393543241;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin13594424554393543241;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([]((LTLAPp0==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-04 finished in 140472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 663 out of 9553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9553/9553 places, 8776/8776 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 612 rules applied. Total rules applied 612 place count 8941 transition count 8776
Discarding 768 places :
Symmetric choice reduction at 1 with 768 rule applications. Total rules 1380 place count 8173 transition count 8008
Iterating global reduction 1 with 768 rules applied. Total rules applied 2148 place count 8173 transition count 8008
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 2205 place count 8116 transition count 7601
Iterating global reduction 1 with 57 rules applied. Total rules applied 2262 place count 8116 transition count 7601
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 102 rules applied. Total rules applied 2364 place count 8014 transition count 7601
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 2721 place count 7657 transition count 7244
Iterating global reduction 2 with 357 rules applied. Total rules applied 3078 place count 7657 transition count 7244
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 3435 place count 7300 transition count 6887
Iterating global reduction 2 with 357 rules applied. Total rules applied 3792 place count 7300 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4047 place count 7045 transition count 6632
Iterating global reduction 2 with 255 rules applied. Total rules applied 4302 place count 7045 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4557 place count 6790 transition count 6377
Iterating global reduction 2 with 255 rules applied. Total rules applied 4812 place count 6790 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5067 place count 6535 transition count 6122
Iterating global reduction 2 with 255 rules applied. Total rules applied 5322 place count 6535 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5577 place count 6280 transition count 5867
Iterating global reduction 2 with 255 rules applied. Total rules applied 5832 place count 6280 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6087 place count 6025 transition count 5612
Iterating global reduction 2 with 255 rules applied. Total rules applied 6342 place count 6025 transition count 5612
Applied a total of 6342 rules in 15303 ms. Remains 6025 /9553 variables (removed 3528) and now considering 5612/8776 (removed 3164) transitions.
// Phase 1: matrix 5612 rows 6025 cols
[2024-05-24 22:17:38] [INFO ] Computed 821 invariants in 111 ms
[2024-05-24 22:17:39] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:17:39] [INFO ] Implicit Places using invariants in 1022 ms returned []
[2024-05-24 22:17:39] [INFO ] Invariant cache hit.
[2024-05-24 22:17:40] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:17:40] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1914 ms to find 0 implicit places.
[2024-05-24 22:17:40] [INFO ] Invariant cache hit.
[2024-05-24 22:17:41] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:17:41] [INFO ] Dead Transitions using invariants and state equation in 870 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6025/9553 places, 5612/8776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18097 ms. Remains : 6025/9553 places, 5612/8776 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s1899 1) (LT s2512 1)) (OR (LT s1751 1) (LT s2364 1)) (OR (LT s1746 1) (LT s2359 1)) (OR (LT s1894 1) (LT s2507 1)) (OR (LT s1756 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 7184 ms.
Product exploration explored 100000 steps with 50000 reset in 7202 ms.
Computed a total of 6025 stabilizing places and 5612 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6025 transition count 5612
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-05 finished in 35624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 103 out of 9553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9553/9553 places, 8776/8776 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Iterating post reduction 0 with 918 rules applied. Total rules applied 918 place count 8635 transition count 8776
Discarding 768 places :
Symmetric choice reduction at 1 with 768 rule applications. Total rules 1686 place count 7867 transition count 8008
Iterating global reduction 1 with 768 rules applied. Total rules applied 2454 place count 7867 transition count 8008
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 2511 place count 7810 transition count 7601
Iterating global reduction 1 with 57 rules applied. Total rules applied 2568 place count 7810 transition count 7601
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 102 rules applied. Total rules applied 2670 place count 7708 transition count 7601
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 3027 place count 7351 transition count 7244
Iterating global reduction 2 with 357 rules applied. Total rules applied 3384 place count 7351 transition count 7244
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 3741 place count 6994 transition count 6887
Iterating global reduction 2 with 357 rules applied. Total rules applied 4098 place count 6994 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4353 place count 6739 transition count 6632
Iterating global reduction 2 with 255 rules applied. Total rules applied 4608 place count 6739 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4863 place count 6484 transition count 6377
Iterating global reduction 2 with 255 rules applied. Total rules applied 5118 place count 6484 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5373 place count 6229 transition count 6122
Iterating global reduction 2 with 255 rules applied. Total rules applied 5628 place count 6229 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5883 place count 5974 transition count 5867
Iterating global reduction 2 with 255 rules applied. Total rules applied 6138 place count 5974 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6393 place count 5719 transition count 5612
Iterating global reduction 2 with 255 rules applied. Total rules applied 6648 place count 5719 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6903 place count 5464 transition count 5357
Iterating global reduction 2 with 255 rules applied. Total rules applied 7158 place count 5464 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7413 place count 5209 transition count 5102
Iterating global reduction 2 with 255 rules applied. Total rules applied 7668 place count 5209 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7923 place count 4954 transition count 4847
Iterating global reduction 2 with 255 rules applied. Total rules applied 8178 place count 4954 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8433 place count 4699 transition count 4592
Iterating global reduction 2 with 255 rules applied. Total rules applied 8688 place count 4699 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8943 place count 4444 transition count 4337
Iterating global reduction 2 with 255 rules applied. Total rules applied 9198 place count 4444 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 9453 place count 4189 transition count 4082
Iterating global reduction 2 with 255 rules applied. Total rules applied 9708 place count 4189 transition count 4082
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 306 rules applied. Total rules applied 10014 place count 4138 transition count 3827
Applied a total of 10014 rules in 21300 ms. Remains 4138 /9553 variables (removed 5415) and now considering 3827/8776 (removed 4949) transitions.
// Phase 1: matrix 3827 rows 4138 cols
[2024-05-24 22:18:20] [INFO ] Computed 464 invariants in 60 ms
[2024-05-24 22:18:20] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:18:22] [INFO ] Implicit Places using invariants in 2088 ms returned [1711, 1717, 1723, 2536]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2092 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4134/9553 places, 3827/8776 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 4129 transition count 3822
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 4129 transition count 3822
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 4127 transition count 3818
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 4127 transition count 3818
Applied a total of 14 rules in 1831 ms. Remains 4127 /4134 variables (removed 7) and now considering 3818/3827 (removed 9) transitions.
// Phase 1: matrix 3818 rows 4127 cols
[2024-05-24 22:18:23] [INFO ] Computed 460 invariants in 59 ms
[2024-05-24 22:18:24] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:18:26] [INFO ] Implicit Places using invariants in 2181 ms returned [1689, 1695, 2509]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 2184 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4124/9553 places, 3818/8776 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 4120 transition count 3814
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 4120 transition count 3814
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 4118 transition count 3810
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 4118 transition count 3810
Applied a total of 12 rules in 1737 ms. Remains 4118 /4124 variables (removed 6) and now considering 3810/3818 (removed 8) transitions.
// Phase 1: matrix 3810 rows 4118 cols
[2024-05-24 22:18:27] [INFO ] Computed 457 invariants in 62 ms
[2024-05-24 22:18:28] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:18:29] [INFO ] Implicit Places using invariants in 2157 ms returned [2506]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2160 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 4117/9553 places, 3810/8776 transitions.
Applied a total of 0 rules in 574 ms. Remains 4117 /4117 variables (removed 0) and now considering 3810/3810 (removed 0) transitions.
Finished structural reductions in LTL mode , in 4 iterations and 31880 ms. Remains : 4117/9553 places, 3810/8776 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (GEQ s3823 1) (GEQ s3825 1) (GEQ s3819 1) (GEQ s3821 1) (GEQ s3831 1) (GEQ s3833 1) (GEQ s3827 1) (GEQ s3829 1) (GEQ s3839 1) (GEQ s3841 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-06 finished in 31994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)||p0))))'
Support contains 255 out of 9553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9553/9553 places, 8776/8776 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Iterating post reduction 0 with 918 rules applied. Total rules applied 918 place count 8635 transition count 8776
Discarding 666 places :
Symmetric choice reduction at 1 with 666 rule applications. Total rules 1584 place count 7969 transition count 8110
Iterating global reduction 1 with 666 rules applied. Total rules applied 2250 place count 7969 transition count 8110
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 2307 place count 7912 transition count 7703
Iterating global reduction 1 with 57 rules applied. Total rules applied 2364 place count 7912 transition count 7703
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 102 rules applied. Total rules applied 2466 place count 7810 transition count 7703
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 2721 place count 7555 transition count 7448
Iterating global reduction 2 with 255 rules applied. Total rules applied 2976 place count 7555 transition count 7448
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3231 place count 7300 transition count 7193
Iterating global reduction 2 with 255 rules applied. Total rules applied 3486 place count 7300 transition count 7193
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3741 place count 7045 transition count 6938
Iterating global reduction 2 with 255 rules applied. Total rules applied 3996 place count 7045 transition count 6938
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4251 place count 6790 transition count 6683
Iterating global reduction 2 with 255 rules applied. Total rules applied 4506 place count 6790 transition count 6683
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4761 place count 6535 transition count 6428
Iterating global reduction 2 with 255 rules applied. Total rules applied 5016 place count 6535 transition count 6428
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5271 place count 6280 transition count 6173
Iterating global reduction 2 with 255 rules applied. Total rules applied 5526 place count 6280 transition count 6173
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5781 place count 6025 transition count 5918
Iterating global reduction 2 with 255 rules applied. Total rules applied 6036 place count 6025 transition count 5918
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6291 place count 5770 transition count 5663
Iterating global reduction 2 with 255 rules applied. Total rules applied 6546 place count 5770 transition count 5663
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6801 place count 5515 transition count 5408
Iterating global reduction 2 with 255 rules applied. Total rules applied 7056 place count 5515 transition count 5408
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7311 place count 5260 transition count 5153
Iterating global reduction 2 with 255 rules applied. Total rules applied 7566 place count 5260 transition count 5153
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7821 place count 5005 transition count 4898
Iterating global reduction 2 with 255 rules applied. Total rules applied 8076 place count 5005 transition count 4898
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8331 place count 4750 transition count 4643
Iterating global reduction 2 with 255 rules applied. Total rules applied 8586 place count 4750 transition count 4643
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8841 place count 4495 transition count 4388
Iterating global reduction 2 with 255 rules applied. Total rules applied 9096 place count 4495 transition count 4388
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 306 rules applied. Total rules applied 9402 place count 4444 transition count 4133
Applied a total of 9402 rules in 21666 ms. Remains 4444 /9553 variables (removed 5109) and now considering 4133/8776 (removed 4643) transitions.
// Phase 1: matrix 4133 rows 4444 cols
[2024-05-24 22:18:52] [INFO ] Computed 464 invariants in 68 ms
[2024-05-24 22:18:53] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:18:54] [INFO ] Implicit Places using invariants in 2071 ms returned [1711, 1717, 1723]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 2074 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4441/9553 places, 4133/8776 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 4436 transition count 4128
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 4436 transition count 4128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 4434 transition count 4124
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 4434 transition count 4124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 4432 transition count 4122
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 4432 transition count 4122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 4430 transition count 4120
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 4430 transition count 4120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 4428 transition count 4118
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 4428 transition count 4118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 4426 transition count 4116
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 4426 transition count 4116
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 4424 transition count 4114
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 4424 transition count 4114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 4422 transition count 4112
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 4422 transition count 4112
Applied a total of 38 rules in 5492 ms. Remains 4422 /4441 variables (removed 19) and now considering 4112/4133 (removed 21) transitions.
// Phase 1: matrix 4112 rows 4422 cols
[2024-05-24 22:18:59] [INFO ] Computed 461 invariants in 65 ms
[2024-05-24 22:19:00] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:19:02] [INFO ] Implicit Places using invariants in 2168 ms returned []
[2024-05-24 22:19:02] [INFO ] Invariant cache hit.
[2024-05-24 22:19:02] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:19:04] [INFO ] Implicit Places using invariants and state equation in 2128 ms returned []
Implicit Place search using SMT with State Equation took 4298 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4422/9553 places, 4112/8776 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33530 ms. Remains : 4422/9553 places, 4112/8776 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (AND (GEQ s2509 1) (GEQ s3735 1)) (AND (GEQ s2484 1) (GEQ s3661 1)) (AND (GEQ s2503 1) (GEQ s3716 1)) (AND (GEQ s2496 1) (GEQ s3695 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3286 ms.
Product exploration explored 100000 steps with 33333 reset in 3158 ms.
Computed a total of 4422 stabilizing places and 4112 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4422 transition count 4112
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-07 finished in 41887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X(G((X(!p0) U p1)))))))'
Support contains 765 out of 9553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9553/9553 places, 8776/8776 transitions.
Discarding 612 places :
Implicit places reduction removed 612 places
Iterating post reduction 0 with 612 rules applied. Total rules applied 612 place count 8941 transition count 8776
Discarding 768 places :
Symmetric choice reduction at 1 with 768 rule applications. Total rules 1380 place count 8173 transition count 8008
Iterating global reduction 1 with 768 rules applied. Total rules applied 2148 place count 8173 transition count 8008
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 2205 place count 8116 transition count 7601
Iterating global reduction 1 with 57 rules applied. Total rules applied 2262 place count 8116 transition count 7601
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 102 rules applied. Total rules applied 2364 place count 8014 transition count 7601
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 2721 place count 7657 transition count 7244
Iterating global reduction 2 with 357 rules applied. Total rules applied 3078 place count 7657 transition count 7244
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 3435 place count 7300 transition count 6887
Iterating global reduction 2 with 357 rules applied. Total rules applied 3792 place count 7300 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4047 place count 7045 transition count 6632
Iterating global reduction 2 with 255 rules applied. Total rules applied 4302 place count 7045 transition count 6632
Applied a total of 4302 rules in 10515 ms. Remains 7045 /9553 variables (removed 2508) and now considering 6632/8776 (removed 2144) transitions.
// Phase 1: matrix 6632 rows 7045 cols
[2024-05-24 22:19:23] [INFO ] Computed 821 invariants in 121 ms
[2024-05-24 22:19:24] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:19:24] [INFO ] Implicit Places using invariants in 1114 ms returned []
[2024-05-24 22:19:24] [INFO ] Invariant cache hit.
[2024-05-24 22:19:25] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:19:25] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
[2024-05-24 22:19:25] [INFO ] Invariant cache hit.
[2024-05-24 22:19:26] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:19:26] [INFO ] Dead Transitions using invariants and state equation in 996 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7045/9553 places, 6632/8776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13634 ms. Remains : 7045/9553 places, 6632/8776 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s3753 1) (GEQ s4111 1)) (AND (GEQ s3605 1) (GEQ s3963 1)) (AND (GEQ s3595 1) (GEQ s3953 1)) (AND (GEQ s3738 1) (GEQ s4096 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 371 reset in 3159 ms.
Product exploration explored 100000 steps with 371 reset in 3196 ms.
Computed a total of 7045 stabilizing places and 6632 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7045 transition count 6632
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), true, (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 123 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Finished random walk after 909 steps, including 0 resets, run visited all 4 properties in 131 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), true, (X (X (NOT p1))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (AND p0 p1))
Knowledge based reduction with 8 factoid took 183 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-09 finished in 24149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(X(G(X(p0))) U p1)||!(p2 U p3)||F(!p2))))'
Support contains 412 out of 9553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9553/9553 places, 8776/8776 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Iterating post reduction 0 with 918 rules applied. Total rules applied 918 place count 8635 transition count 8776
Discarding 510 places :
Symmetric choice reduction at 1 with 510 rule applications. Total rules 1428 place count 8125 transition count 8266
Iterating global reduction 1 with 510 rules applied. Total rules applied 1938 place count 8125 transition count 8266
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 1990 place count 8073 transition count 8114
Iterating global reduction 1 with 52 rules applied. Total rules applied 2042 place count 8073 transition count 8114
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 1 with 51 rules applied. Total rules applied 2093 place count 8022 transition count 8114
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 2195 place count 7920 transition count 8012
Iterating global reduction 2 with 102 rules applied. Total rules applied 2297 place count 7920 transition count 8012
Applied a total of 2297 rules in 8597 ms. Remains 7920 /9553 variables (removed 1633) and now considering 8012/8776 (removed 764) transitions.
// Phase 1: matrix 8012 rows 7920 cols
[2024-05-24 22:19:45] [INFO ] Computed 566 invariants in 135 ms
[2024-05-24 22:19:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:19:46] [INFO ] Implicit Places using invariants in 1229 ms returned []
[2024-05-24 22:19:46] [INFO ] Invariant cache hit.
[2024-05-24 22:19:47] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:19:47] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned []
Implicit Place search using SMT with State Equation took 2321 ms to find 0 implicit places.
[2024-05-24 22:19:47] [INFO ] Invariant cache hit.
[2024-05-24 22:19:48] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:19:48] [INFO ] Dead Transitions using invariants and state equation in 1089 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7920/9553 places, 8012/8776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12010 ms. Remains : 7920/9553 places, 8012/8776 transitions.
Stuttering acceptance computed with spot in 298 ms :[(AND p1 p2 p3), p2, (AND p2 p3 (NOT p1)), (AND p2 p0 p1), (AND p2 p0 p1), (AND p2 p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 p3 p1), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=0 dest: 2}, { cond=(AND p2 p3 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p3 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=4 dest: 5}], [{ cond=(AND p2 p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (GEQ s5584 1) (GEQ s5454 1) (GEQ s5649 1) (GEQ s5389 1) (GEQ s5519 1) (GEQ s5462 1) (GEQ s5592 1) (GEQ s5397 1) (GEQ s5657 1) (GEQ s5527 1) (GEQ s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 36 reset in 4019 ms.
Product exploration explored 100000 steps with 35 reset in 3973 ms.
Computed a total of 7920 stabilizing places and 8012 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7920 transition count 8012
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 p3 (NOT p1)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 p3 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 p1 p0)))), (F (G (NOT p2))), (F (G (NOT p3))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 20 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-11 finished in 24038 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((G(!p1) U (!p2&&G(!p1))))||p0) U p3))'
Support contains 255 out of 9553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9553/9553 places, 8776/8776 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Iterating post reduction 0 with 918 rules applied. Total rules applied 918 place count 8635 transition count 8776
Discarding 717 places :
Symmetric choice reduction at 1 with 717 rule applications. Total rules 1635 place count 7918 transition count 8059
Iterating global reduction 1 with 717 rules applied. Total rules applied 2352 place count 7918 transition count 8059
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 2359 place count 7911 transition count 7702
Iterating global reduction 1 with 7 rules applied. Total rules applied 2366 place count 7911 transition count 7702
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 102 rules applied. Total rules applied 2468 place count 7809 transition count 7702
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 2825 place count 7452 transition count 7345
Iterating global reduction 2 with 357 rules applied. Total rules applied 3182 place count 7452 transition count 7345
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3437 place count 7197 transition count 7090
Iterating global reduction 2 with 255 rules applied. Total rules applied 3692 place count 7197 transition count 7090
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 3947 place count 6942 transition count 6835
Iterating global reduction 2 with 255 rules applied. Total rules applied 4202 place count 6942 transition count 6835
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4457 place count 6687 transition count 6580
Iterating global reduction 2 with 255 rules applied. Total rules applied 4712 place count 6687 transition count 6580
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4967 place count 6432 transition count 6325
Iterating global reduction 2 with 255 rules applied. Total rules applied 5222 place count 6432 transition count 6325
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5477 place count 6177 transition count 6070
Iterating global reduction 2 with 255 rules applied. Total rules applied 5732 place count 6177 transition count 6070
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5987 place count 5922 transition count 5815
Iterating global reduction 2 with 255 rules applied. Total rules applied 6242 place count 5922 transition count 5815
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6497 place count 5667 transition count 5560
Iterating global reduction 2 with 255 rules applied. Total rules applied 6752 place count 5667 transition count 5560
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7007 place count 5412 transition count 5305
Iterating global reduction 2 with 255 rules applied. Total rules applied 7262 place count 5412 transition count 5305
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7517 place count 5157 transition count 5050
Iterating global reduction 2 with 255 rules applied. Total rules applied 7772 place count 5157 transition count 5050
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8027 place count 4902 transition count 4795
Iterating global reduction 2 with 255 rules applied. Total rules applied 8282 place count 4902 transition count 4795
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8537 place count 4647 transition count 4540
Iterating global reduction 2 with 255 rules applied. Total rules applied 8792 place count 4647 transition count 4540
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 9047 place count 4392 transition count 4285
Iterating global reduction 2 with 255 rules applied. Total rules applied 9302 place count 4392 transition count 4285
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 306 rules applied. Total rules applied 9608 place count 4341 transition count 4030
Applied a total of 9608 rules in 21557 ms. Remains 4341 /9553 variables (removed 5212) and now considering 4030/8776 (removed 4746) transitions.
// Phase 1: matrix 4030 rows 4341 cols
[2024-05-24 22:20:22] [INFO ] Computed 464 invariants in 64 ms
[2024-05-24 22:20:23] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:20:24] [INFO ] Implicit Places using invariants in 2008 ms returned [1711, 1717, 1723, 2609]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2011 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4337/9553 places, 4030/8776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 4335 transition count 4028
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 4335 transition count 4028
Applied a total of 4 rules in 1176 ms. Remains 4335 /4337 variables (removed 2) and now considering 4028/4030 (removed 2) transitions.
// Phase 1: matrix 4028 rows 4335 cols
[2024-05-24 22:20:25] [INFO ] Computed 460 invariants in 69 ms
[2024-05-24 22:20:26] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:20:27] [INFO ] Implicit Places using invariants in 1960 ms returned [2615, 3722]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1963 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4333/9553 places, 4028/8776 transitions.
Applied a total of 0 rules in 587 ms. Remains 4333 /4333 variables (removed 0) and now considering 4028/4028 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 27295 ms. Remains : 4333/9553 places, 4028/8776 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p3), (OR p2 p1), true, p1]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(AND (OR (GEQ s1 1) (GEQ s3 1) (GEQ s5 1) (GEQ s7 1) (GEQ s9 1) (GEQ s11 1) (GEQ s13 1) (GEQ s15 1) (GEQ s17 1) (GEQ s19 1) (GEQ s21 1) (GEQ s23 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-12 finished in 27462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 51 out of 9553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9553/9553 places, 8776/8776 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Iterating post reduction 0 with 918 rules applied. Total rules applied 918 place count 8635 transition count 8776
Discarding 768 places :
Symmetric choice reduction at 1 with 768 rule applications. Total rules 1686 place count 7867 transition count 8008
Iterating global reduction 1 with 768 rules applied. Total rules applied 2454 place count 7867 transition count 8008
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 2511 place count 7810 transition count 7601
Iterating global reduction 1 with 57 rules applied. Total rules applied 2568 place count 7810 transition count 7601
Discarding 102 places :
Implicit places reduction removed 102 places
Iterating post reduction 1 with 102 rules applied. Total rules applied 2670 place count 7708 transition count 7601
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 3027 place count 7351 transition count 7244
Iterating global reduction 2 with 357 rules applied. Total rules applied 3384 place count 7351 transition count 7244
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 3741 place count 6994 transition count 6887
Iterating global reduction 2 with 357 rules applied. Total rules applied 4098 place count 6994 transition count 6887
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4353 place count 6739 transition count 6632
Iterating global reduction 2 with 255 rules applied. Total rules applied 4608 place count 6739 transition count 6632
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 4863 place count 6484 transition count 6377
Iterating global reduction 2 with 255 rules applied. Total rules applied 5118 place count 6484 transition count 6377
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5373 place count 6229 transition count 6122
Iterating global reduction 2 with 255 rules applied. Total rules applied 5628 place count 6229 transition count 6122
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 5883 place count 5974 transition count 5867
Iterating global reduction 2 with 255 rules applied. Total rules applied 6138 place count 5974 transition count 5867
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6393 place count 5719 transition count 5612
Iterating global reduction 2 with 255 rules applied. Total rules applied 6648 place count 5719 transition count 5612
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 6903 place count 5464 transition count 5357
Iterating global reduction 2 with 255 rules applied. Total rules applied 7158 place count 5464 transition count 5357
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7413 place count 5209 transition count 5102
Iterating global reduction 2 with 255 rules applied. Total rules applied 7668 place count 5209 transition count 5102
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 7923 place count 4954 transition count 4847
Iterating global reduction 2 with 255 rules applied. Total rules applied 8178 place count 4954 transition count 4847
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8433 place count 4699 transition count 4592
Iterating global reduction 2 with 255 rules applied. Total rules applied 8688 place count 4699 transition count 4592
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 8943 place count 4444 transition count 4337
Iterating global reduction 2 with 255 rules applied. Total rules applied 9198 place count 4444 transition count 4337
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 9453 place count 4189 transition count 4082
Iterating global reduction 2 with 255 rules applied. Total rules applied 9708 place count 4189 transition count 4082
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 2 with 306 rules applied. Total rules applied 10014 place count 4138 transition count 3827
Applied a total of 10014 rules in 21745 ms. Remains 4138 /9553 variables (removed 5415) and now considering 3827/8776 (removed 4949) transitions.
// Phase 1: matrix 3827 rows 4138 cols
[2024-05-24 22:20:50] [INFO ] Computed 464 invariants in 57 ms
[2024-05-24 22:20:50] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:20:51] [INFO ] Implicit Places using invariants in 2012 ms returned [1711, 1717, 1723, 2536]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2015 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4134/9553 places, 3827/8776 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 4129 transition count 3822
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 4129 transition count 3822
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 4127 transition count 3818
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 4127 transition count 3818
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 4125 transition count 3816
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 4125 transition count 3816
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 4123 transition count 3814
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 4123 transition count 3814
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 4121 transition count 3812
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 4121 transition count 3812
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 4119 transition count 3810
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 4119 transition count 3810
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 4117 transition count 3808
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 4117 transition count 3808
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 4115 transition count 3806
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 4115 transition count 3806
Applied a total of 38 rules in 5288 ms. Remains 4115 /4134 variables (removed 19) and now considering 3806/3827 (removed 21) transitions.
// Phase 1: matrix 3806 rows 4115 cols
[2024-05-24 22:20:57] [INFO ] Computed 460 invariants in 62 ms
[2024-05-24 22:20:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 22:20:59] [INFO ] Implicit Places using invariants in 2189 ms returned [2490, 2520]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2192 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4113/9553 places, 3806/8776 transitions.
Applied a total of 0 rules in 575 ms. Remains 4113 /4113 variables (removed 0) and now considering 3806/3806 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31818 ms. Remains : 4113/9553 places, 3806/8776 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s3752 1) (GEQ s3750 1) (GEQ s3754 1) (GEQ s3705 1) (GEQ s3709 1) (GEQ s3707 1) (GEQ s3713 1) (GEQ s3711 1) (GEQ s3717 1) (GEQ s3715 1) (GEQ s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 68 reset in 873 ms.
Product exploration explored 100000 steps with 68 reset in 926 ms.
Computed a total of 4113 stabilizing places and 3806 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4113 transition count 3806
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 1600 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=84 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 3806 rows 4113 cols
[2024-05-24 22:21:03] [INFO ] Computed 458 invariants in 59 ms
[2024-05-24 22:21:10] [INFO ] [Real]Absence check using 0 positive and 458 generalized place invariants in 1001 ms returned sat
[2024-05-24 22:21:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 22:21:18] [INFO ] [Real]Absence check using state equation in 8255 ms returned unknown
Could not prove EG (NOT p0)
Support contains 51 out of 4113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4113/4113 places, 3806/3806 transitions.
Graph (complete) has 5263 edges and 4113 vertex of which 2804 are kept as prefixes of interest. Removing 1309 places using SCC suffix rule.4 ms
Discarding 1309 places :
Also discarding 1103 output transitions
Drop transitions removed 1103 transitions
Reduce places removed 51 places and 51 transitions.
Drop transitions removed 1632 transitions
Trivial Post-agglo rules discarded 1632 transitions
Performed 1632 trivial Post agglomeration. Transition count delta: 1632
Iterating post reduction 0 with 1632 rules applied. Total rules applied 1633 place count 2753 transition count 1020
Reduce places removed 1632 places and 0 transitions.
Iterating post reduction 1 with 1632 rules applied. Total rules applied 3265 place count 1121 transition count 1020
Performed 459 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 459 Pre rules applied. Total rules applied 3265 place count 1121 transition count 561
Deduced a syphon composed of 459 places in 0 ms
Ensure Unique test removed 153 places
Reduce places removed 612 places and 0 transitions.
Iterating global reduction 2 with 1071 rules applied. Total rules applied 4336 place count 509 transition count 561
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 2 with 153 rules applied. Total rules applied 4489 place count 509 transition count 408
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 258 rules applied. Total rules applied 4747 place count 356 transition count 303
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 4750 place count 353 transition count 303
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 48 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 4894 place count 257 transition count 255
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 5 with 51 rules applied. Total rules applied 4945 place count 206 transition count 204
Applied a total of 4945 rules in 134 ms. Remains 206 /4113 variables (removed 3907) and now considering 204/3806 (removed 3602) transitions.
// Phase 1: matrix 204 rows 206 cols
[2024-05-24 22:21:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 22:21:19] [INFO ] Implicit Places using invariants in 194 ms returned [51, 103]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 196 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 204/4113 places, 204/3806 transitions.
Reduce places removed 51 places and 51 transitions.
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 51 Pre rules applied. Total rules applied 0 place count 153 transition count 102
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 0 with 102 rules applied. Total rules applied 102 place count 102 transition count 102
Applied a total of 102 rules in 4 ms. Remains 102 /204 variables (removed 102) and now considering 102/204 (removed 102) transitions.
// Phase 1: matrix 102 rows 102 cols
[2024-05-24 22:21:19] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 22:21:19] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-24 22:21:19] [INFO ] Invariant cache hit.
[2024-05-24 22:21:19] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/4113 places, 102/3806 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 467 ms. Remains : 102/4113 places, 102/3806 transitions.
Computed a total of 102 stabilizing places and 102 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 102 transition count 102
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-14 finished in 51130 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0)&&F(!p1)) U p2))'
Support contains 306 out of 9553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9553/9553 places, 8776/8776 transitions.
Graph (complete) has 13413 edges and 9553 vertex of which 8986 are kept as prefixes of interest. Removing 567 places using SCC suffix rule.10 ms
Discarding 567 places :
Also discarding 565 output transitions
Drop transitions removed 565 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Drop transitions removed 4743 transitions
Trivial Post-agglo rules discarded 4743 transitions
Performed 4743 trivial Post agglomeration. Transition count delta: 4743
Iterating post reduction 0 with 5661 rules applied. Total rules applied 5662 place count 8017 transition count 3417
Reduce places removed 4743 places and 0 transitions.
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Iterating post reduction 1 with 4896 rules applied. Total rules applied 10558 place count 3274 transition count 3264
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 2 with 153 rules applied. Total rules applied 10711 place count 3121 transition count 3264
Performed 867 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 867 Pre rules applied. Total rules applied 10711 place count 3121 transition count 2397
Deduced a syphon composed of 867 places in 1 ms
Ensure Unique test removed 306 places
Reduce places removed 1173 places and 0 transitions.
Iterating global reduction 3 with 2040 rules applied. Total rules applied 12751 place count 1948 transition count 2397
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 3 with 102 rules applied. Total rules applied 12853 place count 1897 transition count 2346
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 12904 place count 1846 transition count 2346
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 51 Pre rules applied. Total rules applied 12904 place count 1846 transition count 2295
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 13006 place count 1795 transition count 2295
Discarding 362 places :
Symmetric choice reduction at 5 with 362 rule applications. Total rules 13368 place count 1433 transition count 1683
Iterating global reduction 5 with 362 rules applied. Total rules applied 13730 place count 1433 transition count 1683
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 5 with 102 rules applied. Total rules applied 13832 place count 1382 transition count 1632
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 6 with 51 rules applied. Total rules applied 13883 place count 1331 transition count 1632
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 51 Pre rules applied. Total rules applied 13883 place count 1331 transition count 1581
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 13985 place count 1280 transition count 1581
Discarding 257 places :
Symmetric choice reduction at 7 with 257 rule applications. Total rules 14242 place count 1023 transition count 1224
Iterating global reduction 7 with 257 rules applied. Total rules applied 14499 place count 1023 transition count 1224
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 7 with 357 rules applied. Total rules applied 14856 place count 972 transition count 918
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 8 with 51 rules applied. Total rules applied 14907 place count 921 transition count 918
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 102 Pre rules applied. Total rules applied 14907 place count 921 transition count 816
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 9 with 255 rules applied. Total rules applied 15162 place count 768 transition count 816
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 9 with 51 rules applied. Total rules applied 15213 place count 717 transition count 765
Applied a total of 15213 rules in 524 ms. Remains 717 /9553 variables (removed 8836) and now considering 765/8776 (removed 8011) transitions.
// Phase 1: matrix 765 rows 717 cols
[2024-05-24 22:21:19] [INFO ] Computed 54 invariants in 5 ms
[2024-05-24 22:21:20] [INFO ] Implicit Places using invariants in 351 ms returned [51, 205, 665]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 353 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 714/9553 places, 765/8776 transitions.
Reduce places removed 51 places and 51 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 663 transition count 663
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 612 transition count 663
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 612 transition count 612
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 561 transition count 612
Applied a total of 204 rules in 19 ms. Remains 561 /714 variables (removed 153) and now considering 612/765 (removed 153) transitions.
// Phase 1: matrix 612 rows 561 cols
[2024-05-24 22:21:20] [INFO ] Computed 51 invariants in 1 ms
[2024-05-24 22:21:20] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-24 22:21:20] [INFO ] Invariant cache hit.
[2024-05-24 22:21:20] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 561/9553 places, 612/8776 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1380 ms. Remains : 561/9553 places, 612/8776 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p2), true, p0, p1]
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (GEQ s128 1) (GEQ s436 1)) (AND (GEQ s103 1) (GEQ s362 1)) (AND (GEQ s122 1) (GEQ s417 1)) (AND (GEQ s115 1) (GEQ s396 1)) (AND (GEQ s121 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 61 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-15 finished in 1528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Found a Shortening insensitive property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-04
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 357 out of 9553 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 9553/9553 places, 8776/8776 transitions.
Graph (complete) has 13413 edges and 9553 vertex of which 8016 are kept as prefixes of interest. Removing 1537 places using SCC suffix rule.11 ms
Discarding 1537 places :
Also discarding 1330 output transitions
Drop transitions removed 1330 transitions
Reduce places removed 51 places and 51 transitions.
Discarding 918 places :
Implicit places reduction removed 918 places
Drop transitions removed 4590 transitions
Trivial Post-agglo rules discarded 4590 transitions
Performed 4590 trivial Post agglomeration. Transition count delta: 4590
Iterating post reduction 0 with 5508 rules applied. Total rules applied 5509 place count 7047 transition count 2805
Reduce places removed 4590 places and 0 transitions.
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Iterating post reduction 1 with 4743 rules applied. Total rules applied 10252 place count 2457 transition count 2652
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 2 with 153 rules applied. Total rules applied 10405 place count 2304 transition count 2652
Performed 408 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 408 Pre rules applied. Total rules applied 10405 place count 2304 transition count 2244
Deduced a syphon composed of 408 places in 1 ms
Ensure Unique test removed 153 places
Reduce places removed 561 places and 0 transitions.
Iterating global reduction 3 with 969 rules applied. Total rules applied 11374 place count 1743 transition count 2244
Discarding 362 places :
Symmetric choice reduction at 3 with 362 rule applications. Total rules 11736 place count 1381 transition count 1632
Iterating global reduction 3 with 362 rules applied. Total rules applied 12098 place count 1381 transition count 1632
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 3 with 102 rules applied. Total rules applied 12200 place count 1330 transition count 1581
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 12251 place count 1279 transition count 1581
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 102 Pre rules applied. Total rules applied 12251 place count 1279 transition count 1479
Deduced a syphon composed of 102 places in 0 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 5 with 204 rules applied. Total rules applied 12455 place count 1177 transition count 1479
Discarding 255 places :
Symmetric choice reduction at 5 with 255 rule applications. Total rules 12710 place count 922 transition count 1224
Iterating global reduction 5 with 255 rules applied. Total rules applied 12965 place count 922 transition count 1224
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 5 with 255 rules applied. Total rules applied 13220 place count 922 transition count 969
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 51 Pre rules applied. Total rules applied 13220 place count 922 transition count 918
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 6 with 153 rules applied. Total rules applied 13373 place count 820 transition count 918
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 13475 place count 769 transition count 867
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 6 with 51 rules applied. Total rules applied 13526 place count 718 transition count 816
Applied a total of 13526 rules in 379 ms. Remains 718 /9553 variables (removed 8835) and now considering 816/8776 (removed 7960) transitions.
// Phase 1: matrix 816 rows 718 cols
[2024-05-24 22:21:21] [INFO ] Computed 104 invariants in 5 ms
[2024-05-24 22:21:22] [INFO ] Implicit Places using invariants in 486 ms returned [51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 489 ms to find 52 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 666/9553 places, 816/8776 transitions.
Applied a total of 0 rules in 7 ms. Remains 666 /666 variables (removed 0) and now considering 816/816 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 876 ms. Remains : 666/9553 places, 816/8776 transitions.
Running random walk in product with property : FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s496 1) (GEQ s617 1)) (AND (GEQ s477 1) (GEQ s558 1)) (AND (GEQ s490 1) (GEQ s598 1)) (AND (GEQ s483 1) (GEQ s577 1)) (AND (GEQ s484 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 325 reset in 1536 ms.
Product exploration explored 100000 steps with 325 reset in 1589 ms.
Computed a total of 666 stabilizing places and 816 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 666 transition count 816
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 247 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Finished random walk after 285 steps, including 0 resets, run visited all 3 properties in 12 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (AND p0 p1)), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 267 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
// Phase 1: matrix 816 rows 666 cols
[2024-05-24 22:21:26] [INFO ] Computed 52 invariants in 5 ms
[2024-05-24 22:21:29] [INFO ] [Real]Absence check using 0 positive and 52 generalized place invariants in 58 ms returned sat
[2024-05-24 22:21:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 22:21:30] [INFO ] [Real]Absence check using state equation in 737 ms returned sat
[2024-05-24 22:21:30] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 70 ms.
[2024-05-24 22:21:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 22:21:33] [INFO ] [Nat]Absence check using 0 positive and 52 generalized place invariants in 32 ms returned sat
[2024-05-24 22:21:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 22:21:34] [INFO ] [Nat]Absence check using state equation in 676 ms returned sat
[2024-05-24 22:21:34] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 57 ms.
[2024-05-24 22:21:37] [INFO ] Added : 191 causal constraints over 39 iterations in 2441 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 357 out of 666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 816/816 transitions.
Applied a total of 0 rules in 8 ms. Remains 666 /666 variables (removed 0) and now considering 816/816 (removed 0) transitions.
[2024-05-24 22:21:37] [INFO ] Invariant cache hit.
[2024-05-24 22:21:37] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-24 22:21:37] [INFO ] Invariant cache hit.
[2024-05-24 22:21:37] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
[2024-05-24 22:21:38] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-24 22:21:38] [INFO ] Invariant cache hit.
[2024-05-24 22:21:38] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1597 ms. Remains : 666/666 places, 816/816 transitions.
Computed a total of 666 stabilizing places and 816 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 666 transition count 816
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 169 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Finished random walk after 289 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (AND p0 p1)), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 267 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
[2024-05-24 22:21:40] [INFO ] Invariant cache hit.
[2024-05-24 22:21:42] [INFO ] [Real]Absence check using 0 positive and 52 generalized place invariants in 60 ms returned sat
[2024-05-24 22:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 22:21:43] [INFO ] [Real]Absence check using state equation in 672 ms returned sat
[2024-05-24 22:21:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 22:21:45] [INFO ] [Nat]Absence check using 0 positive and 52 generalized place invariants in 32 ms returned sat
[2024-05-24 22:21:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 22:21:46] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2024-05-24 22:21:46] [INFO ] Computed and/alt/rep : 510/765/510 causal constraints (skipped 153 transitions) in 56 ms.
[2024-05-24 22:21:48] [INFO ] Added : 187 causal constraints over 38 iterations in 2430 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Product exploration explored 100000 steps with 325 reset in 1561 ms.
Product exploration explored 100000 steps with 325 reset in 1584 ms.
Built C files in :
/tmp/ltsmin14554531761959739324
[2024-05-24 22:21:52] [INFO ] Computing symmetric may disable matrix : 816 transitions.
[2024-05-24 22:21:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 22:21:52] [INFO ] Computing symmetric may enable matrix : 816 transitions.
[2024-05-24 22:21:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 22:21:52] [INFO ] Computing Do-Not-Accords matrix : 816 transitions.
[2024-05-24 22:21:52] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 22:21:52] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14554531761959739324
Running compilation step : cd /tmp/ltsmin14554531761959739324;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14554531761959739324;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14554531761959739324;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 357 out of 666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 666/666 places, 816/816 transitions.
Applied a total of 0 rules in 9 ms. Remains 666 /666 variables (removed 0) and now considering 816/816 (removed 0) transitions.
[2024-05-24 22:21:55] [INFO ] Invariant cache hit.
[2024-05-24 22:21:55] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-24 22:21:55] [INFO ] Invariant cache hit.
[2024-05-24 22:21:56] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
[2024-05-24 22:21:56] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-24 22:21:56] [INFO ] Invariant cache hit.
[2024-05-24 22:21:56] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1493 ms. Remains : 666/666 places, 816/816 transitions.
Built C files in :
/tmp/ltsmin11009719179005926250
[2024-05-24 22:21:56] [INFO ] Computing symmetric may disable matrix : 816 transitions.
[2024-05-24 22:21:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 22:21:56] [INFO ] Computing symmetric may enable matrix : 816 transitions.
[2024-05-24 22:21:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 22:21:56] [INFO ] Computing Do-Not-Accords matrix : 816 transitions.
[2024-05-24 22:21:56] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 22:21:56] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11009719179005926250
Running compilation step : cd /tmp/ltsmin11009719179005926250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11009719179005926250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11009719179005926250;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-24 22:22:00] [INFO ] Flatten gal took : 28 ms
[2024-05-24 22:22:00] [INFO ] Flatten gal took : 28 ms
[2024-05-24 22:22:00] [INFO ] Time to serialize gal into /tmp/LTL55566658537152679.gal : 5 ms
[2024-05-24 22:22:00] [INFO ] Time to serialize properties into /tmp/LTL7026834909493818522.prop : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL55566658537152679.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14452550267850098917.hoa' '-atoms' '/tmp/LTL7026834909493818522.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL7026834909493818522.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14452550267850098917.hoa
Detected timeout of ITS tools.
[2024-05-24 22:22:15] [INFO ] Flatten gal took : 24 ms
[2024-05-24 22:22:15] [INFO ] Flatten gal took : 25 ms
[2024-05-24 22:22:15] [INFO ] Time to serialize gal into /tmp/LTL6892511090723054047.gal : 6 ms
[2024-05-24 22:22:15] [INFO ] Time to serialize properties into /tmp/LTL12405796672030053165.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6892511090723054047.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12405796672030053165.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((((((((p6_32<1)&&(p6_93<1))&&((p6_28<1)&&(p6_89<1)))&&(((p6_40<1)&&(p6_101<1))&&((p6_36<1)&&(p6_97<1))))&&((((p6_16<1)&&(...6672
Formula 0 simplified : XG(!"((((((((((l20_34>=1)&&(pl1_104>=1))||((l20_15>=1)&&(pl1_45>=1)))||(((l20_28>=1)&&(pl1_85>=1))||((l20_21>=1)&&(pl1_64>=1))))||((...6664
Detected timeout of ITS tools.
[2024-05-24 22:22:30] [INFO ] Flatten gal took : 26 ms
[2024-05-24 22:22:30] [INFO ] Applying decomposition
[2024-05-24 22:22:30] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16207447856237948376.txt' '-o' '/tmp/graph16207447856237948376.bin' '-w' '/tmp/graph16207447856237948376.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16207447856237948376.bin' '-l' '-1' '-v' '-w' '/tmp/graph16207447856237948376.weights' '-q' '0' '-e' '0.001'
[2024-05-24 22:22:30] [INFO ] Decomposing Gal with order
[2024-05-24 22:22:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 22:22:30] [INFO ] Removed a total of 508 redundant transitions.
[2024-05-24 22:22:30] [INFO ] Flatten gal took : 66 ms
[2024-05-24 22:22:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 135 labels/synchronizations in 8 ms.
[2024-05-24 22:22:30] [INFO ] Time to serialize gal into /tmp/LTL1120122221278340543.gal : 10 ms
[2024-05-24 22:22:30] [INFO ] Time to serialize properties into /tmp/LTL4645351837975373037.ltl : 3 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1120122221278340543.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4645351837975373037.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(((((((((i35.u79.p6_32<1)&&(i20.u39.p6_93<1))&&((i34.u77.p6_28<1)&&(i42.u37.p6_89<1)))&&(((i37.u14.p6_40<1)&&(i22.u44.p6_10...10380
Formula 0 simplified : XG(!"((((((((((i23.u147.l20_34>=1)&&(i23.u215.pl1_104>=1))||((i8.u139.l20_15>=1)&&(i8.u164.pl1_45>=1)))||(((i19.u195.l20_28>=1)&&(i1...10372
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14744593084294490204
[2024-05-24 22:22:45] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14744593084294490204
Running compilation step : cd /tmp/ltsmin14744593084294490204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2044 ms.
Running link step : cd /tmp/ltsmin14744593084294490204;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14744593084294490204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([]((LTLAPp0==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FamilyReunion-COL-L00050M0005C002P002G001-LTLFireability-04 finished in 100040 ms.
[2024-05-24 22:23:01] [INFO ] Flatten gal took : 242 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16671922255225653340
[2024-05-24 22:23:01] [INFO ] Too many transitions (8776) to apply POR reductions. Disabling POR matrices.
[2024-05-24 22:23:01] [INFO ] Applying decomposition
[2024-05-24 22:23:01] [INFO ] Built C files in 127ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16671922255225653340
Running compilation step : cd /tmp/ltsmin16671922255225653340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 22:23:01] [INFO ] Flatten gal took : 254 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15101227831632801328.txt' '-o' '/tmp/graph15101227831632801328.bin' '-w' '/tmp/graph15101227831632801328.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15101227831632801328.bin' '-l' '-1' '-v' '-w' '/tmp/graph15101227831632801328.weights' '-q' '0' '-e' '0.001'
[2024-05-24 22:23:02] [INFO ] Decomposing Gal with order
[2024-05-24 22:23:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 22:23:09] [INFO ] Removed a total of 2240 redundant transitions.
[2024-05-24 22:23:09] [INFO ] Flatten gal took : 647 ms
[2024-05-24 22:23:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 157 labels/synchronizations in 96 ms.
[2024-05-24 22:23:11] [INFO ] Time to serialize gal into /tmp/LTLFireability5641560935255790440.gal : 113 ms
[2024-05-24 22:23:11] [INFO ] Time to serialize properties into /tmp/LTLFireability7664132458797533837.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5641560935255790440.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7664132458797533837.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("((((((((((i61.u3415.l20_34>=1)&&(i61.u3349.pl1_104>=1))||((i69.u3371.l20_15>=1)&&(i69.u3335.pl1_45>=1)))||(((i58.u3411.l20_28...12574
Formula 0 simplified : XG(!"((((((((((i61.u3415.l20_34>=1)&&(i61.u3349.pl1_104>=1))||((i69.u3371.l20_15>=1)&&(i69.u3335.pl1_45>=1)))||(((i58.u3411.l20_28>=...12566
Compilation finished in 88886 ms.
Running link step : cd /tmp/ltsmin16671922255225653340;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 105 ms.
Running LTSmin : cd /tmp/ltsmin16671922255225653340;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&[]((LTLAPp1==true)))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-24 22:41:47] [INFO ] Applying decomposition
[2024-05-24 22:41:50] [INFO ] Flatten gal took : 2540 ms
[2024-05-24 22:41:50] [INFO ] Decomposing Gal with order
[2024-05-24 22:41:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 22:41:58] [INFO ] Removed a total of 3083 redundant transitions.
[2024-05-24 22:41:58] [INFO ] Flatten gal took : 591 ms
[2024-05-24 22:41:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 83 ms.
[2024-05-24 22:41:58] [INFO ] Time to serialize gal into /tmp/LTLFireability5647769639538627931.gal : 168 ms
[2024-05-24 22:41:58] [INFO ] Time to serialize properties into /tmp/LTLFireability13277131340800320610.ltl : 7 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5647769639538627931.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13277131340800320610.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F(("((((((((((LegalResident34.l20_34>=1)&&(LegalResidentPublicAdminOffice104.pl1_104>=1))||((LegalResident15.l20_15>=1)&&(LegalRe...19274
Formula 0 simplified : XG(!"((((((((((LegalResident34.l20_34>=1)&&(LegalResidentPublicAdminOffice104.pl1_104>=1))||((LegalResident15.l20_15>=1)&&(LegalResi...19266
Detected timeout of ITS tools.
[2024-05-24 23:05:26] [INFO ] Flatten gal took : 594 ms
[2024-05-24 23:05:28] [INFO ] Input system was already deterministic with 8776 transitions.
[2024-05-24 23:05:28] [INFO ] Transformed 9553 places.
[2024-05-24 23:05:28] [INFO ] Transformed 8776 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 23:06:00] [INFO ] Time to serialize gal into /tmp/LTLFireability6433335574128560893.gal : 112 ms
[2024-05-24 23:06:00] [INFO ] Time to serialize properties into /tmp/LTLFireability10340469054092142076.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6433335574128560893.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10340469054092142076.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(("((((((((((l20_34>=1)&&(pl1_104>=1))||((l20_15>=1)&&(pl1_45>=1)))||(((l20_28>=1)&&(pl1_85>=1))||((l20_21>=1)&&(pl1_64>=1))))||...6672
Formula 0 simplified : XG(!"((((((((((l20_34>=1)&&(pl1_104>=1))||((l20_15>=1)&&(pl1_45>=1)))||(((l20_28>=1)&&(pl1_85>=1))||((l20_21>=1)&&(pl1_64>=1))))||((...6664
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12834804 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15242192 kB

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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-COL-L00050M0005C002P002G001"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is FamilyReunion-COL-L00050M0005C002P002G001, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-smll-171636280300253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00050M0005C002P002G001.tgz
mv FamilyReunion-COL-L00050M0005C002P002G001 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;