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.r131-smll-171624288800307.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 DNAwalker-PT-16redondantChoiceR, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-171624288800307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 13 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 14:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 13 14:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 19 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 211K 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 DNAwalker-PT-16redondantChoiceR-LTLCardinality-00
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-01
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-02
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-03
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-04
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-05
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-06
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-07
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-08
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-09
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-10
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-11
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-12
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-13
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-14
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716468358374

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-16redondantChoiceR
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-23 12:46:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 12:46:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 12:46:01] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2024-05-23 12:46:01] [INFO ] Transformed 43 places.
[2024-05-23 12:46:01] [INFO ] Transformed 490 transitions.
[2024-05-23 12:46:01] [INFO ] Parsed PT model containing 43 places and 490 transitions and 1438 arcs in 234 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 24 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2024-05-23 12:46:01] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2024-05-23 12:46:01] [INFO ] Computed 0 invariants in 15 ms
[2024-05-23 12:46:01] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
[2024-05-23 12:46:01] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:46:01] [INFO ] Invariant cache hit.
[2024-05-23 12:46:01] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-23 12:46:01] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:46:01] [INFO ] Invariant cache hit.
[2024-05-23 12:46:02] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-23 12:46:02] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
[2024-05-23 12:46:02] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:46:02] [INFO ] Invariant cache hit.
[2024-05-23 12:46:02] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1439 ms. Remains : 43/43 places, 490/490 transitions.
Support contains 34 out of 43 places after structural reductions.
[2024-05-23 12:46:02] [INFO ] Flatten gal took : 79 ms
[2024-05-23 12:46:02] [INFO ] Flatten gal took : 40 ms
[2024-05-23 12:46:03] [INFO ] Input system was already deterministic with 490 transitions.
Support contains 33 out of 43 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 377 resets, run finished after 637 ms. (steps per millisecond=15 ) properties (out of 30) seen :23
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-23 12:46:03] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:46:03] [INFO ] Invariant cache hit.
[2024-05-23 12:46:04] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-23 12:46:29] [INFO ] After 24937ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2024-05-23 12:46:29] [INFO ] State equation strengthened by 161 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 12:46:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 12:46:29] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 490/490 transitions.
Graph (complete) has 478 edges and 43 vertex of which 41 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 41 transition count 466
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 32 place count 32 transition count 457
Applied a total of 32 rules in 53 ms. Remains 32 /43 variables (removed 11) and now considering 457/490 (removed 33) transitions.
// Phase 1: matrix 457 rows 32 cols
[2024-05-23 12:46:29] [INFO ] Computed 0 invariants in 8 ms
[2024-05-23 12:46:29] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 339 ms. Remains : 32/43 places, 457/490 transitions.
Incomplete random walk after 10000 steps, including 351 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 533023 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 533023 steps, saw 127860 distinct states, run finished after 3003 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-23 12:46:32] [INFO ] Invariant cache hit.
[2024-05-23 12:46:33] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 12:46:55] [INFO ] After 22478ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 457/457 transitions.
Applied a total of 0 rules in 10 ms. Remains 32 /32 variables (removed 0) and now considering 457/457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 32/32 places, 457/457 transitions.
Incomplete random walk after 10000 steps, including 350 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 524988 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :{}
Probabilistic random walk after 524988 steps, saw 125825 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-23 12:46:58] [INFO ] Invariant cache hit.
[2024-05-23 12:46:59] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 12:47:17] [INFO ] After 18151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 457/457 transitions.
Applied a total of 0 rules in 13 ms. Remains 32 /32 variables (removed 0) and now considering 457/457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 32/32 places, 457/457 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 457/457 transitions.
Applied a total of 0 rules in 9 ms. Remains 32 /32 variables (removed 0) and now considering 457/457 (removed 0) transitions.
[2024-05-23 12:47:17] [INFO ] Invariant cache hit.
[2024-05-23 12:47:17] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-23 12:47:17] [INFO ] Invariant cache hit.
[2024-05-23 12:47:17] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 12:47:18] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
[2024-05-23 12:47:18] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-23 12:47:18] [INFO ] Invariant cache hit.
[2024-05-23 12:47:18] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1178 ms. Remains : 32/32 places, 457/457 transitions.
Applied a total of 0 rules in 9 ms. Remains 32 /32 variables (removed 0) and now considering 457/457 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-23 12:47:18] [INFO ] Invariant cache hit.
[2024-05-23 12:47:18] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 12:47:36] [INFO ] After 18155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 43 stabilizing places and 488 stable transitions
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(p0)))'
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 21 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2024-05-23 12:47:37] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2024-05-23 12:47:37] [INFO ] Computed 0 invariants in 5 ms
[2024-05-23 12:47:37] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
[2024-05-23 12:47:37] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:47:37] [INFO ] Invariant cache hit.
[2024-05-23 12:47:37] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-23 12:47:37] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:47:37] [INFO ] Invariant cache hit.
[2024-05-23 12:47:37] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-23 12:47:38] [INFO ] Implicit Places using invariants and state equation in 1331 ms returned []
Implicit Place search using SMT with State Equation took 1432 ms to find 0 implicit places.
[2024-05-23 12:47:38] [INFO ] Redundant transitions in 59 ms returned []
[2024-05-23 12:47:38] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:47:38] [INFO ] Invariant cache hit.
[2024-05-23 12:47:39] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2065 ms. Remains : 43/43 places, 490/490 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 312 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s35 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 49 steps with 3 reset in 3 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-00 finished in 2454 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((p0&&(p1||F(p2))&&(F(p2)||G(p3))))))'
Support contains 8 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 18 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2024-05-23 12:47:39] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:47:39] [INFO ] Invariant cache hit.
[2024-05-23 12:47:39] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
[2024-05-23 12:47:39] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:47:39] [INFO ] Invariant cache hit.
[2024-05-23 12:47:39] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-23 12:47:39] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:47:39] [INFO ] Invariant cache hit.
[2024-05-23 12:47:39] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-23 12:47:41] [INFO ] Implicit Places using invariants and state equation in 1155 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
[2024-05-23 12:47:41] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-23 12:47:41] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:47:41] [INFO ] Invariant cache hit.
[2024-05-23 12:47:41] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1793 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p2) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0 (NOT p2) p3), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LEQ s38 s4) (LEQ s35 s0)), p1:(GT s39 s9), p2:(LEQ s20 s2), p3:(GT s38 s4)], nbAcceptance=2, 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 2 reset in 347 ms.
Product exploration explored 100000 steps with 1 reset in 238 ms.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2 p3), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p2) (NOT p3))))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 p0 (NOT p2) p3))), (X p0), (X (NOT (AND (NOT p2) p3))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 16 factoid took 6013 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter insensitive) to 3 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 376 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-23 12:47:48] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:47:48] [INFO ] Invariant cache hit.
[2024-05-23 12:47:48] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 12:48:00] [INFO ] After 11961ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 490/490 transitions.
Graph (complete) has 478 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 42 transition count 473
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 37 transition count 468
Applied a total of 22 rules in 21 ms. Remains 37 /43 variables (removed 6) and now considering 468/490 (removed 22) transitions.
// Phase 1: matrix 468 rows 37 cols
[2024-05-23 12:48:00] [INFO ] Computed 0 invariants in 4 ms
[2024-05-23 12:48:00] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 37/43 places, 468/490 transitions.
Finished random walk after 1961 steps, including 74 resets, run visited all 1 properties in 10 ms. (steps per millisecond=196 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2 p3), (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p2) (NOT p3))))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 p0 (NOT p2) p3))), (X p0), (X (NOT (AND (NOT p2) p3))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p2)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (AND (NOT p2) (NOT p3))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)))), (F (AND (NOT p2) p3)), (F (NOT p0)), (F (AND p0 p1 (NOT p2) p3)), (F (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p2) (NOT p3))))]
Knowledge based reduction with 16 factoid took 7870 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter insensitive) to 3 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Support contains 8 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 10 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2024-05-23 12:48:08] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2024-05-23 12:48:08] [INFO ] Computed 0 invariants in 2 ms
[2024-05-23 12:48:09] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
[2024-05-23 12:48:09] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:48:09] [INFO ] Invariant cache hit.
[2024-05-23 12:48:09] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-23 12:48:09] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:48:09] [INFO ] Invariant cache hit.
[2024-05-23 12:48:09] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-23 12:48:10] [INFO ] Implicit Places using invariants and state equation in 1138 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
[2024-05-23 12:48:10] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-23 12:48:10] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:48:10] [INFO ] Invariant cache hit.
[2024-05-23 12:48:10] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1709 ms. Remains : 43/43 places, 490/490 transitions.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2 p3), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p0), (X (NOT (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p2) p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 16 factoid took 5877 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter insensitive) to 3 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 375 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-23 12:48:16] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:48:16] [INFO ] Invariant cache hit.
[2024-05-23 12:48:16] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 12:48:25] [INFO ] After 9138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 12:48:25] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-23 12:48:26] [INFO ] After 730ms SMT Verify possible using 161 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 12:48:26] [INFO ] After 854ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2024-05-23 12:48:26] [INFO ] After 10118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 8 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 490/490 transitions.
Graph (complete) has 478 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 42 transition count 473
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 37 transition count 468
Applied a total of 22 rules in 13 ms. Remains 37 /43 variables (removed 6) and now considering 468/490 (removed 22) transitions.
// Phase 1: matrix 468 rows 37 cols
[2024-05-23 12:48:26] [INFO ] Computed 0 invariants in 3 ms
[2024-05-23 12:48:27] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 37/43 places, 468/490 transitions.
Finished random walk after 7800 steps, including 289 resets, run visited all 1 properties in 47 ms. (steps per millisecond=165 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2 p3), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p0), (X (NOT (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p2) p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (AND (NOT p2) (NOT p3))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p3)))), (F (AND (NOT p2) p3)), (F (NOT p0)), (F (AND p0 (NOT p2) p1 p3)), (F (OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p2) (NOT p3))))]
Knowledge based reduction with 16 factoid took 7741 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter insensitive) to 3 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 222 ms.
Product exploration explored 100000 steps with 0 reset in 338 ms.
Built C files in :
/tmp/ltsmin4905887047544838821
[2024-05-23 12:48:35] [INFO ] Computing symmetric may disable matrix : 490 transitions.
[2024-05-23 12:48:35] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:48:35] [INFO ] Computing symmetric may enable matrix : 490 transitions.
[2024-05-23 12:48:35] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:48:36] [INFO ] Computing Do-Not-Accords matrix : 490 transitions.
[2024-05-23 12:48:36] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:48:36] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4905887047544838821
Running compilation step : cd /tmp/ltsmin4905887047544838821;'/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 1742 ms.
Running link step : cd /tmp/ltsmin4905887047544838821;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin4905887047544838821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17602106697506798150.hoa' '--buchi-type=spotba'
LTSmin run took 1144 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-01 finished in 59513 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((G(p0)&&p1)) U p1)||F(p2)||p0))))'
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 8 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2024-05-23 12:48:39] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2024-05-23 12:48:39] [INFO ] Computed 0 invariants in 2 ms
[2024-05-23 12:48:39] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
[2024-05-23 12:48:39] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:48:39] [INFO ] Invariant cache hit.
[2024-05-23 12:48:39] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-23 12:48:39] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:48:39] [INFO ] Invariant cache hit.
[2024-05-23 12:48:39] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-23 12:48:40] [INFO ] Implicit Places using invariants and state equation in 1266 ms returned []
Implicit Place search using SMT with State Equation took 1340 ms to find 0 implicit places.
[2024-05-23 12:48:40] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-23 12:48:40] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:48:40] [INFO ] Invariant cache hit.
[2024-05-23 12:48:40] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1879 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s34 s3), p1:(LEQ s29 s5), p2:(LEQ s16 s34)], 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 0 reset in 78 ms.
Product exploration explored 100000 steps with 0 reset in 75 ms.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))))]
Knowledge based reduction with 7 factoid took 652 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 378 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-23 12:48:41] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:48:41] [INFO ] Invariant cache hit.
[2024-05-23 12:48:41] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 12:48:44] [INFO ] After 2702ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 12:48:44] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-23 12:48:45] [INFO ] After 454ms SMT Verify possible using 161 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 12:48:45] [INFO ] After 556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2024-05-23 12:48:45] [INFO ] After 3365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))]
Knowledge based reduction with 7 factoid took 906 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 12 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2024-05-23 12:48:46] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:48:46] [INFO ] Invariant cache hit.
[2024-05-23 12:48:46] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
[2024-05-23 12:48:46] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:48:46] [INFO ] Invariant cache hit.
[2024-05-23 12:48:46] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-23 12:48:46] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:48:46] [INFO ] Invariant cache hit.
[2024-05-23 12:48:46] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-23 12:48:48] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned []
Implicit Place search using SMT with State Equation took 1369 ms to find 0 implicit places.
[2024-05-23 12:48:48] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-23 12:48:48] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:48:48] [INFO ] Invariant cache hit.
[2024-05-23 12:48:48] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1896 ms. Remains : 43/43 places, 490/490 transitions.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))))]
Knowledge based reduction with 7 factoid took 668 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Finished random walk after 209 steps, including 8 resets, run visited all 2 properties in 3 ms. (steps per millisecond=69 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))]
Knowledge based reduction with 7 factoid took 946 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 60 ms.
Product exploration explored 100000 steps with 0 reset in 62 ms.
Built C files in :
/tmp/ltsmin11107316508658424830
[2024-05-23 12:48:50] [INFO ] Computing symmetric may disable matrix : 490 transitions.
[2024-05-23 12:48:50] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:48:50] [INFO ] Computing symmetric may enable matrix : 490 transitions.
[2024-05-23 12:48:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:48:50] [INFO ] Computing Do-Not-Accords matrix : 490 transitions.
[2024-05-23 12:48:50] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:48:50] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11107316508658424830
Running compilation step : cd /tmp/ltsmin11107316508658424830;'/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 1602 ms.
Running link step : cd /tmp/ltsmin11107316508658424830;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11107316508658424830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8477518711972357049.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 8 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2024-05-23 12:49:05] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:49:05] [INFO ] Invariant cache hit.
[2024-05-23 12:49:05] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
[2024-05-23 12:49:05] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:49:05] [INFO ] Invariant cache hit.
[2024-05-23 12:49:05] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-23 12:49:05] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:49:05] [INFO ] Invariant cache hit.
[2024-05-23 12:49:06] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-23 12:49:07] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned []
Implicit Place search using SMT with State Equation took 1374 ms to find 0 implicit places.
[2024-05-23 12:49:07] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-23 12:49:07] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:49:07] [INFO ] Invariant cache hit.
[2024-05-23 12:49:07] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1917 ms. Remains : 43/43 places, 490/490 transitions.
Built C files in :
/tmp/ltsmin7113125491233198431
[2024-05-23 12:49:07] [INFO ] Computing symmetric may disable matrix : 490 transitions.
[2024-05-23 12:49:07] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:49:07] [INFO ] Computing symmetric may enable matrix : 490 transitions.
[2024-05-23 12:49:07] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:49:07] [INFO ] Computing Do-Not-Accords matrix : 490 transitions.
[2024-05-23 12:49:07] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:49:07] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7113125491233198431
Running compilation step : cd /tmp/ltsmin7113125491233198431;'/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 1548 ms.
Running link step : cd /tmp/ltsmin7113125491233198431;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7113125491233198431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13479528326969373315.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 12:49:22] [INFO ] Flatten gal took : 37 ms
[2024-05-23 12:49:22] [INFO ] Flatten gal took : 33 ms
[2024-05-23 12:49:22] [INFO ] Time to serialize gal into /tmp/LTL17775247556760685565.gal : 6 ms
[2024-05-23 12:49:22] [INFO ] Time to serialize properties into /tmp/LTL13650598860038556729.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/LTL17775247556760685565.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18418501098477553736.hoa' '-atoms' '/tmp/LTL13650598860038556729.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...320
Loading property file /tmp/LTL13650598860038556729.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18418501098477553736.hoa
Detected timeout of ITS tools.
[2024-05-23 12:49:37] [INFO ] Flatten gal took : 27 ms
[2024-05-23 12:49:37] [INFO ] Flatten gal took : 26 ms
[2024-05-23 12:49:37] [INFO ] Time to serialize gal into /tmp/LTL14663819526393480366.gal : 9 ms
[2024-05-23 12:49:37] [INFO ] Time to serialize properties into /tmp/LTL17105047904997160352.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14663819526393480366.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17105047904997160352.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 : !((F(G((((X((G("(B28<=A4)"))&&("(A24<=B5)")))U("(A24<=B5)"))||(F("(A14<=B28)")))||("(B28<=A4)")))))
Formula 0 simplified : G(F(!"(A24<=B5)" & !"(B28<=A4)" & X(!"(A24<=B5)" | F!"(B28<=A4)")) & FG!"(A14<=B28)")
Detected timeout of ITS tools.
[2024-05-23 12:49:52] [INFO ] Flatten gal took : 30 ms
[2024-05-23 12:49:52] [INFO ] Applying decomposition
[2024-05-23 12:49:52] [INFO ] Flatten gal took : 22 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/graph9768929119852541143.txt' '-o' '/tmp/graph9768929119852541143.bin' '-w' '/tmp/graph9768929119852541143.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9768929119852541143.bin' '-l' '-1' '-v' '-w' '/tmp/graph9768929119852541143.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:49:53] [INFO ] Decomposing Gal with order
[2024-05-23 12:49:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:49:53] [INFO ] Removed a total of 864 redundant transitions.
[2024-05-23 12:49:53] [INFO ] Flatten gal took : 94 ms
[2024-05-23 12:49:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-23 12:49:53] [INFO ] Time to serialize gal into /tmp/LTL3526755366766867283.gal : 6 ms
[2024-05-23 12:49:53] [INFO ] Time to serialize properties into /tmp/LTL10702094179629806186.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/LTL3526755366766867283.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10702094179629806186.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 : !((F(G((((X((G("(gu3.B28<=gu3.A4)"))&&("(gu4.A24<=gu4.B5)")))U("(gu4.A24<=gu4.B5)"))||(F("(gu3.A14<=gu3.B28)")))||("(gu3.B28<=gu3.A4)"...160
Formula 0 simplified : G(F(!"(gu3.B28<=gu3.A4)" & !"(gu4.A24<=gu4.B5)" & X(!"(gu4.A24<=gu4.B5)" | F!"(gu3.B28<=gu3.A4)")) & FG!"(gu3.A14<=gu3.B28)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10604836478519368565
[2024-05-23 12:50:08] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10604836478519368565
Running compilation step : cd /tmp/ltsmin10604836478519368565;'/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 1074 ms.
Running link step : cd /tmp/ltsmin10604836478519368565;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10604836478519368565;'/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))) U (LTLAPp1==true))||<>((LTLAPp2==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-02 finished in 104431 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)||G(p1))))'
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2024-05-23 12:50:23] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:23] [INFO ] Invariant cache hit.
[2024-05-23 12:50:23] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
[2024-05-23 12:50:23] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:23] [INFO ] Invariant cache hit.
[2024-05-23 12:50:23] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-23 12:50:23] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:23] [INFO ] Invariant cache hit.
[2024-05-23 12:50:23] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-23 12:50:25] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 1356 ms to find 0 implicit places.
[2024-05-23 12:50:25] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:25] [INFO ] Invariant cache hit.
[2024-05-23 12:50:25] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1897 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(GT 2 s11), p0:(LEQ s20 s28)], 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 1 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-03 finished in 2076 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(p0)&&(F(p1)||G(p2))))'
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2024-05-23 12:50:25] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:25] [INFO ] Invariant cache hit.
[2024-05-23 12:50:25] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
[2024-05-23 12:50:25] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:25] [INFO ] Invariant cache hit.
[2024-05-23 12:50:25] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-23 12:50:25] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:25] [INFO ] Invariant cache hit.
[2024-05-23 12:50:26] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-23 12:50:26] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1169 ms to find 0 implicit places.
[2024-05-23 12:50:26] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:26] [INFO ] Invariant cache hit.
[2024-05-23 12:50:27] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1674 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GT s31 s16) (GT s1 s3)), p2:(LEQ 1 s18), p0:(LEQ s31 s16)], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 34 steps with 2 reset in 1 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-05 finished in 1858 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(p0))'
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 7 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2024-05-23 12:50:27] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:27] [INFO ] Invariant cache hit.
[2024-05-23 12:50:27] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
[2024-05-23 12:50:27] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:27] [INFO ] Invariant cache hit.
[2024-05-23 12:50:27] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-23 12:50:27] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:27] [INFO ] Invariant cache hit.
[2024-05-23 12:50:27] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-23 12:50:29] [INFO ] Implicit Places using invariants and state equation in 1329 ms returned []
Implicit Place search using SMT with State Equation took 1401 ms to find 0 implicit places.
[2024-05-23 12:50:29] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-23 12:50:29] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:29] [INFO ] Invariant cache hit.
[2024-05-23 12:50:29] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1924 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 3 s10) (LEQ 1 s28))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-07 finished in 1975 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((p0&&X(F(p1)))))'
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2024-05-23 12:50:29] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:29] [INFO ] Invariant cache hit.
[2024-05-23 12:50:29] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
[2024-05-23 12:50:29] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:29] [INFO ] Invariant cache hit.
[2024-05-23 12:50:29] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-23 12:50:29] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:29] [INFO ] Invariant cache hit.
[2024-05-23 12:50:29] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-23 12:50:30] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 1299 ms to find 0 implicit places.
[2024-05-23 12:50:30] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:30] [INFO ] Invariant cache hit.
[2024-05-23 12:50:31] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1814 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ s12 s18), p0:(OR (LEQ s17 s7) (LEQ s9 s25))], 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-10 finished in 1955 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 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2024-05-23 12:50:31] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:31] [INFO ] Invariant cache hit.
[2024-05-23 12:50:31] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
[2024-05-23 12:50:31] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:31] [INFO ] Invariant cache hit.
[2024-05-23 12:50:31] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-23 12:50:31] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:31] [INFO ] Invariant cache hit.
[2024-05-23 12:50:31] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-23 12:50:33] [INFO ] Implicit Places using invariants and state equation in 1475 ms returned []
Implicit Place search using SMT with State Equation took 1564 ms to find 0 implicit places.
[2024-05-23 12:50:33] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:33] [INFO ] Invariant cache hit.
[2024-05-23 12:50:33] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2077 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-11 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:(GT s21 s7)], 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 DNAwalker-PT-16redondantChoiceR-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-11 finished in 2173 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((G(p0)||(p1&&X(p2)))))'
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2024-05-23 12:50:33] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:33] [INFO ] Invariant cache hit.
[2024-05-23 12:50:33] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
[2024-05-23 12:50:33] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:33] [INFO ] Invariant cache hit.
[2024-05-23 12:50:33] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-23 12:50:33] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:33] [INFO ] Invariant cache hit.
[2024-05-23 12:50:33] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-23 12:50:35] [INFO ] Implicit Places using invariants and state equation in 1396 ms returned []
Implicit Place search using SMT with State Equation took 1474 ms to find 0 implicit places.
[2024-05-23 12:50:35] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:35] [INFO ] Invariant cache hit.
[2024-05-23 12:50:35] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1991 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ 2 s13), p1:(LEQ s38 s15), p2:(LEQ 2 s42)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-12 finished in 2176 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(p0)||G(p1))))'
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 7 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2024-05-23 12:50:35] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:35] [INFO ] Invariant cache hit.
[2024-05-23 12:50:35] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
[2024-05-23 12:50:35] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:35] [INFO ] Invariant cache hit.
[2024-05-23 12:50:36] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-23 12:50:36] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:36] [INFO ] Invariant cache hit.
[2024-05-23 12:50:36] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-23 12:50:37] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned []
Implicit Place search using SMT with State Equation took 1366 ms to find 0 implicit places.
[2024-05-23 12:50:37] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-23 12:50:37] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:37] [INFO ] Invariant cache hit.
[2024-05-23 12:50:37] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1885 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s4), p1:(GT s24 s19)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-13 finished in 1939 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(F(p0))||G(p1)))))'
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2024-05-23 12:50:37] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:37] [INFO ] Invariant cache hit.
[2024-05-23 12:50:37] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
[2024-05-23 12:50:37] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:37] [INFO ] Invariant cache hit.
[2024-05-23 12:50:37] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-23 12:50:37] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:37] [INFO ] Invariant cache hit.
[2024-05-23 12:50:38] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-05-23 12:50:39] [INFO ] Implicit Places using invariants and state equation in 1266 ms returned []
Implicit Place search using SMT with State Equation took 1333 ms to find 0 implicit places.
[2024-05-23 12:50:39] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2024-05-23 12:50:39] [INFO ] Invariant cache hit.
[2024-05-23 12:50:39] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1904 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 3 s33), p0:(LEQ s37 s30)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 133 ms.
Stuttering criterion allowed to conclude after 50 steps with 1 reset in 1 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLCardinality-15 finished in 2242 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((G(p0)&&p1)) U p1)||F(p2)||p0))))'
[2024-05-23 12:50:40] [INFO ] Flatten gal took : 35 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10475570730038000813
[2024-05-23 12:50:40] [INFO ] Computing symmetric may disable matrix : 490 transitions.
[2024-05-23 12:50:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:50:40] [INFO ] Computing symmetric may enable matrix : 490 transitions.
[2024-05-23 12:50:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:50:40] [INFO ] Applying decomposition
[2024-05-23 12:50:40] [INFO ] Flatten gal took : 34 ms
[2024-05-23 12:50:40] [INFO ] Computing Do-Not-Accords matrix : 490 transitions.
[2024-05-23 12:50:40] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:50:40] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10475570730038000813
Running compilation step : cd /tmp/ltsmin10475570730038000813;'/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'
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/graph6604787061144984978.txt' '-o' '/tmp/graph6604787061144984978.bin' '-w' '/tmp/graph6604787061144984978.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6604787061144984978.bin' '-l' '-1' '-v' '-w' '/tmp/graph6604787061144984978.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:50:40] [INFO ] Decomposing Gal with order
[2024-05-23 12:50:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:50:40] [INFO ] Removed a total of 864 redundant transitions.
[2024-05-23 12:50:40] [INFO ] Flatten gal took : 66 ms
[2024-05-23 12:50:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-23 12:50:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality10375794007323496853.gal : 3 ms
[2024-05-23 12:50:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality14023401341274434393.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10375794007323496853.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14023401341274434393.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...299
Read 1 LTL properties
Checking formula 0 : !((F(G((((X((G("(gu3.B28<=gu3.A4)"))&&("(gu4.A24<=gu4.B5)")))U("(gu4.A24<=gu4.B5)"))||(F("(gu3.A14<=gu3.B28)")))||("(gu3.B28<=gu3.A4)"...160
Formula 0 simplified : G(F(!"(gu3.B28<=gu3.A4)" & !"(gu4.A24<=gu4.B5)" & X(!"(gu4.A24<=gu4.B5)" | F!"(gu3.B28<=gu3.A4)")) & FG!"(gu3.A14<=gu3.B28)")
Compilation finished in 1743 ms.
Running link step : cd /tmp/ltsmin10475570730038000813;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10475570730038000813;'/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))) U (LTLAPp1==true))||<>((LTLAPp2==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gu3.t6, gu3.t7, gu3.t12, gu3.t13, gu3.t54, gu3.t410, gu4.t0, gu4.t1, gu4.t68, gu4.t325, gu5.t...3031
Computing Next relation with stutter on 1.04294e+07 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.045: LTL layer: formula: <>([](((X(([]((LTLAPp0==true))&&(LTLAPp1==true))) U (LTLAPp1==true))||<>((LTLAPp2==true))||(LTLAPp0==true))))
pins2lts-mc-linux64( 6/ 8), 0.045: "<>([](((X(([]((LTLAPp0==true))&&(LTLAPp1==true))) U (LTLAPp1==true))||<>((LTLAPp2==true))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.045: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.054: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.070: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.070: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.098: There are 494 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.098: State length is 44, there are 498 groups
pins2lts-mc-linux64( 0/ 8), 0.098: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.098: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.098: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.098: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.146: [Blue] ~34 levels ~960 states ~4680 transitions
pins2lts-mc-linux64( 3/ 8), 0.170: [Blue] ~34 levels ~1920 states ~7832 transitions
pins2lts-mc-linux64( 3/ 8), 0.213: [Blue] ~34 levels ~3840 states ~13480 transitions
pins2lts-mc-linux64( 6/ 8), 0.280: [Blue] ~35 levels ~7680 states ~22848 transitions
pins2lts-mc-linux64( 1/ 8), 0.451: [Blue] ~37 levels ~15360 states ~58912 transitions
pins2lts-mc-linux64( 6/ 8), 0.740: [Blue] ~35 levels ~30720 states ~99728 transitions
pins2lts-mc-linux64( 6/ 8), 1.318: [Blue] ~35 levels ~61440 states ~240064 transitions
pins2lts-mc-linux64( 1/ 8), 2.393: [Blue] ~38 levels ~122880 states ~442968 transitions
pins2lts-mc-linux64( 6/ 8), 4.248: [Blue] ~36 levels ~245760 states ~1098712 transitions
pins2lts-mc-linux64( 6/ 8), 7.496: [Blue] ~36 levels ~491520 states ~2220304 transitions
pins2lts-mc-linux64( 7/ 8), 12.351: [Blue] ~34 levels ~983040 states ~3719896 transitions
pins2lts-mc-linux64( 7/ 8), 21.237: [Blue] ~34 levels ~1966080 states ~7859704 transitions
pins2lts-mc-linux64( 2/ 8), 38.618: [Blue] ~37 levels ~3932160 states ~15993544 transitions
pins2lts-mc-linux64( 2/ 8), 73.538: [Blue] ~37 levels ~7864320 states ~34730984 transitions
pins2lts-mc-linux64( 2/ 8), 144.130: [Blue] ~37 levels ~15728640 states ~73408216 transitions
pins2lts-mc-linux64( 2/ 8), 284.418: [Blue] ~37 levels ~31457280 states ~159194600 transitions
pins2lts-mc-linux64( 0/ 8), 563.294: [Blue] ~39 levels ~62914560 states ~312532760 transitions
pins2lts-mc-linux64( 0/ 8), 1115.173: [Blue] ~39 levels ~125829120 states ~651047448 transitions
pins2lts-mc-linux64( 0/ 8), 1233.175: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1233.221:
pins2lts-mc-linux64( 0/ 8), 1233.221: Explored 134216829 states 800612196 transitions, fanout: 5.965
pins2lts-mc-linux64( 0/ 8), 1233.221: Total exploration time 1233.110 sec (1233.050 sec minimum, 1233.080 sec on average)
pins2lts-mc-linux64( 0/ 8), 1233.221: States per second: 108844, Transitions per second: 649263
pins2lts-mc-linux64( 0/ 8), 1233.221:
pins2lts-mc-linux64( 0/ 8), 1233.221: State space has 134217309 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1233.221: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1233.221: blue states: 134216829 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1233.221: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1233.221: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1233.221:
pins2lts-mc-linux64( 0/ 8), 1233.221: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1233.221:
pins2lts-mc-linux64( 0/ 8), 1233.221: Queue width: 8B, total height: 293, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 1233.221: Tree memory: 1028.4MB, 8.0 B/state, compr.: 4.5%
pins2lts-mc-linux64( 0/ 8), 1233.221: Tree fill ratio (roots/leafs): 99.0%/1.0%
pins2lts-mc-linux64( 0/ 8), 1233.221: Stored 550 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1233.221: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1233.221: Est. total memory use: 1028.4MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10475570730038000813;'/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))) U (LTLAPp1==true))||<>((LTLAPp2==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10475570730038000813;'/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))) U (LTLAPp1==true))||<>((LTLAPp2==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-23 13:12:13] [INFO ] Flatten gal took : 21 ms
[2024-05-23 13:12:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality2331748411289533024.gal : 4 ms
[2024-05-23 13:12:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality6302740616863669089.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/LTLCardinality2331748411289533024.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6302740616863669089.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...297
Read 1 LTL properties
Checking formula 0 : !((F(G((((X((G("(B28<=A4)"))&&("(A24<=B5)")))U("(A24<=B5)"))||(F("(A14<=B28)")))||("(B28<=A4)")))))
Formula 0 simplified : G(F(!"(A24<=B5)" & !"(B28<=A4)" & X(!"(A24<=B5)" | F!"(B28<=A4)")) & FG!"(A14<=B28)")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...2923
Computing Next relation with stutter on 1.04294e+07 deadlock states
75 unique states visited
0 strongly connected components in search stack
80 transitions explored
42 items max in DFS search stack
106170 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1061.77,5543592,1,0,1458,2.10705e+07,30,724,1723,4.19697e+07,2711
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 2671632 ms.

BK_STOP 1716471033380

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

tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-16redondantChoiceR.tgz
mv DNAwalker-PT-16redondantChoiceR execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;