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.r356-tall-171683760300067.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 itstools
Input is ShieldIIPs-PT-005A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760300067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 11 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 14:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 14:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:43 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 ShieldIIPs-PT-005A-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-005A-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-005A-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-005A-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-005A-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-005A-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-005A-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-005A-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-005A-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-005A-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-005A-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-005A-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-005A-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-005A-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-005A-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-005A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716885290205

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-005A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-28 08:34:51] [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-28 08:34:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 08:34:51] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-28 08:34:51] [INFO ] Transformed 128 places.
[2024-05-28 08:34:51] [INFO ] Transformed 123 transitions.
[2024-05-28 08:34:51] [INFO ] Found NUPN structural information;
[2024-05-28 08:34:51] [INFO ] Parsed PT model containing 128 places and 123 transitions and 546 arcs in 158 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 2 formulas.
FORMULA ShieldIIPs-PT-005A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005A-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005A-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005A-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 12 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-05-28 08:34:51] [INFO ] Computed 46 invariants in 6 ms
[2024-05-28 08:34:51] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-28 08:34:51] [INFO ] Invariant cache hit.
[2024-05-28 08:34:52] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 08:34:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:34:53] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 11 ms to minimize.
[2024-05-28 08:34:53] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 08:34:53] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:34:53] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 08:34:53] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:34:54] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:34:55] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:34:55] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 27 ms to minimize.
[2024-05-28 08:34:55] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4706 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:34:58] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5844 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 10619ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 10630ms
Finished structural reductions in LTL mode , in 1 iterations and 11096 ms. Remains : 128/128 places, 123/123 transitions.
Support contains 25 out of 128 places after structural reductions.
[2024-05-28 08:35:02] [INFO ] Flatten gal took : 39 ms
[2024-05-28 08:35:02] [INFO ] Flatten gal took : 21 ms
[2024-05-28 08:35:02] [INFO ] Input system was already deterministic with 123 transitions.
Support contains 24 out of 128 places (down from 25) after GAL structural reductions.
RANDOM walk for 1033 steps (1 resets) in 118 ms. (8 steps per ms) remains 0/16 properties
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ShieldIIPs-PT-005A-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||p0)))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 08:35:03] [INFO ] Invariant cache hit.
[2024-05-28 08:35:03] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-28 08:35:03] [INFO ] Invariant cache hit.
[2024-05-28 08:35:03] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 08:35:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:35:04] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-28 08:35:04] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:35:04] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 08:35:04] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 08:35:04] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:35:05] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:35:06] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 08:35:06] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-28 08:35:06] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4309 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:35:09] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5309 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9650ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9652ms
Finished structural reductions in LTL mode , in 1 iterations and 9925 ms. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 276 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-005A-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-LTLCardinality-01 finished in 10252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 08:35:13] [INFO ] Invariant cache hit.
[2024-05-28 08:35:13] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 08:35:13] [INFO ] Invariant cache hit.
[2024-05-28 08:35:13] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 08:35:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:35:14] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 08:35:14] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-28 08:35:14] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:35:14] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 08:35:14] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:35:15] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:35:16] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 2 ms to minimize.
[2024-05-28 08:35:16] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-28 08:35:16] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4178 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:35:19] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5372 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9587ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9589ms
Finished structural reductions in LTL mode , in 1 iterations and 9791 ms. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLCardinality-03
Product exploration explored 100000 steps with 1766 reset in 370 ms.
Product exploration explored 100000 steps with 1772 reset in 278 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 245 steps (0 resets) in 7 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 08:35:24] [INFO ] Invariant cache hit.
[2024-05-28 08:35:24] [INFO ] [Real]Absence check using 46 positive place invariants in 8 ms returned sat
[2024-05-28 08:35:24] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-28 08:35:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 08:35:24] [INFO ] [Nat]Absence check using 46 positive place invariants in 7 ms returned sat
[2024-05-28 08:35:24] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-28 08:35:24] [INFO ] Computed and/alt/rep : 114/403/114 causal constraints (skipped 8 transitions) in 14 ms.
[2024-05-28 08:35:25] [INFO ] Added : 110 causal constraints over 22 iterations in 321 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 08:35:25] [INFO ] Invariant cache hit.
[2024-05-28 08:35:25] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-28 08:35:25] [INFO ] Invariant cache hit.
[2024-05-28 08:35:25] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 08:35:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:35:26] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-28 08:35:26] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-28 08:35:26] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:35:26] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 08:35:26] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:35:27] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:35:27] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-28 08:35:28] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-28 08:35:28] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4087 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:35:30] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5452 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9564ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9567ms
Finished structural reductions in LTL mode , in 1 iterations and 9804 ms. Remains : 128/128 places, 123/123 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 255 steps (0 resets) in 6 ms. (36 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 08:35:35] [INFO ] Invariant cache hit.
[2024-05-28 08:35:35] [INFO ] [Real]Absence check using 46 positive place invariants in 7 ms returned sat
[2024-05-28 08:35:35] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-28 08:35:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 08:35:35] [INFO ] [Nat]Absence check using 46 positive place invariants in 6 ms returned sat
[2024-05-28 08:35:35] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-28 08:35:35] [INFO ] Computed and/alt/rep : 114/403/114 causal constraints (skipped 8 transitions) in 11 ms.
[2024-05-28 08:35:36] [INFO ] Added : 110 causal constraints over 22 iterations in 302 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1749 reset in 205 ms.
Product exploration explored 100000 steps with 1785 reset in 219 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 128 transition count 123
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 30 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 08:35:36] [INFO ] Redundant transitions in 34 ms returned [115]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 121 sub problems to find dead transitions.
// Phase 1: matrix 122 rows 128 cols
[2024-05-28 08:35:36] [INFO ] Computed 46 invariants in 2 ms
[2024-05-28 08:35:36] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:35:37] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-28 08:35:37] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:35:37] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 08:35:37] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-28 08:35:38] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 08:35:38] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-28 08:35:38] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 7/181 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/181 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 122/250 variables, 128/309 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 3/312 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/312 constraints. Problems are: Problem set: 2 solved, 119 unsolved
[2024-05-28 08:35:40] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/250 variables, 1/313 constraints. Problems are: Problem set: 2 solved, 119 unsolved
[2024-05-28 08:35:41] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 1/314 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 0/314 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/250 variables, 0/314 constraints. Problems are: Problem set: 2 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 314 constraints, problems are : Problem set: 2 solved, 119 unsolved in 6829 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 2 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 3/128 variables, 46/171 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 3/174 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 122/250 variables, 128/311 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 3/314 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 119/433 constraints. Problems are: Problem set: 2 solved, 119 unsolved
[2024-05-28 08:35:45] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 08:35:45] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
[2024-05-28 08:35:45] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 08:35:45] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 4/437 constraints. Problems are: Problem set: 2 solved, 119 unsolved
[2024-05-28 08:35:47] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-28 08:35:47] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 2/439 constraints. Problems are: Problem set: 2 solved, 119 unsolved
[2024-05-28 08:35:50] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 1/440 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/440 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 13 (OVERLAPS) 0/250 variables, 0/440 constraints. Problems are: Problem set: 2 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 440 constraints, problems are : Problem set: 2 solved, 119 unsolved in 14688 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 119/121 constraints, Known Traps: 16/16 constraints]
After SMT, in 21542ms problems are : Problem set: 2 solved, 119 unsolved
Search for dead transitions found 2 dead transitions in 21544ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 128/128 places, 120/123 transitions.
Graph (complete) has 439 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 126 /128 variables (removed 2) and now considering 120/120 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 126/128 places, 120/123 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21624 ms. Remains : 126/128 places, 120/123 transitions.
Built C files in :
/tmp/ltsmin15045785528047347455
[2024-05-28 08:35:58] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15045785528047347455
Running compilation step : cd /tmp/ltsmin15045785528047347455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 360 ms.
Running link step : cd /tmp/ltsmin15045785528047347455;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15045785528047347455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11261633574240663815.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 8 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-05-28 08:36:13] [INFO ] Computed 46 invariants in 2 ms
[2024-05-28 08:36:13] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 08:36:13] [INFO ] Invariant cache hit.
[2024-05-28 08:36:13] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 08:36:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:36:14] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-28 08:36:14] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-28 08:36:14] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-28 08:36:14] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 08:36:14] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:36:15] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:36:16] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-28 08:36:16] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:36:16] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3998 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:36:19] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5285 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9301ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9302ms
Finished structural reductions in LTL mode , in 1 iterations and 9504 ms. Remains : 128/128 places, 123/123 transitions.
Built C files in :
/tmp/ltsmin14855160521213618454
[2024-05-28 08:36:23] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14855160521213618454
Running compilation step : cd /tmp/ltsmin14855160521213618454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 263 ms.
Running link step : cd /tmp/ltsmin14855160521213618454;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14855160521213618454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13725185465784697168.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 08:36:38] [INFO ] Flatten gal took : 11 ms
[2024-05-28 08:36:38] [INFO ] Flatten gal took : 13 ms
[2024-05-28 08:36:38] [INFO ] Time to serialize gal into /tmp/LTL13088224410915098353.gal : 4 ms
[2024-05-28 08:36:38] [INFO ] Time to serialize properties into /tmp/LTL4114924607836586909.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13088224410915098353.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7245302850998825233.hoa' '-atoms' '/tmp/LTL4114924607836586909.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4114924607836586909.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7245302850998825233.hoa
Detected timeout of ITS tools.
[2024-05-28 08:36:53] [INFO ] Flatten gal took : 9 ms
[2024-05-28 08:36:53] [INFO ] Flatten gal took : 9 ms
[2024-05-28 08:36:53] [INFO ] Time to serialize gal into /tmp/LTL16726775758604772389.gal : 3 ms
[2024-05-28 08:36:53] [INFO ] Time to serialize properties into /tmp/LTL14509789245295753990.ltl : 16 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16726775758604772389.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14509789245295753990.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(p56==1)")))))
Formula 0 simplified : XXG!"(p56==1)"
Detected timeout of ITS tools.
[2024-05-28 08:37:08] [INFO ] Flatten gal took : 13 ms
[2024-05-28 08:37:08] [INFO ] Applying decomposition
[2024-05-28 08:37:08] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4816583054886974639.txt' '-o' '/tmp/graph4816583054886974639.bin' '-w' '/tmp/graph4816583054886974639.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4816583054886974639.bin' '-l' '-1' '-v' '-w' '/tmp/graph4816583054886974639.weights' '-q' '0' '-e' '0.001'
[2024-05-28 08:37:08] [INFO ] Decomposing Gal with order
[2024-05-28 08:37:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 08:37:08] [INFO ] Removed a total of 80 redundant transitions.
[2024-05-28 08:37:08] [INFO ] Flatten gal took : 81 ms
[2024-05-28 08:37:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 11 ms.
[2024-05-28 08:37:08] [INFO ] Time to serialize gal into /tmp/LTL318272192152981039.gal : 4 ms
[2024-05-28 08:37:08] [INFO ] Time to serialize properties into /tmp/LTL9757122407168526412.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL318272192152981039.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9757122407168526412.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(i2.i2.u20.p56==1)")))))
Formula 0 simplified : XXG!"(i2.i2.u20.p56==1)"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005A-LTLCardinality-03 finished in 130174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 128 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 122
Applied a total of 2 rules in 16 ms. Remains 127 /128 variables (removed 1) and now considering 122/123 (removed 1) transitions.
// Phase 1: matrix 122 rows 127 cols
[2024-05-28 08:37:23] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 08:37:23] [INFO ] Implicit Places using invariants in 71 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/128 places, 122/123 transitions.
Applied a total of 0 rules in 5 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 93 ms. Remains : 126/128 places, 122/123 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLCardinality-04
Stuttering criterion allowed to conclude after 277 steps with 0 reset in 3 ms.
FORMULA ShieldIIPs-PT-005A-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-LTLCardinality-04 finished in 141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 128 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 126 transition count 121
Applied a total of 4 rules in 8 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-05-28 08:37:23] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 08:37:24] [INFO ] Implicit Places using invariants in 164 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 165 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 121/123 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 178 ms. Remains : 125/128 places, 121/123 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLCardinality-05
Stuttering criterion allowed to conclude after 259 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-005A-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-LTLCardinality-05 finished in 288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 127 transition count 121
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 125 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 124 transition count 120
Applied a total of 5 rules in 8 ms. Remains 124 /128 variables (removed 4) and now considering 120/123 (removed 3) transitions.
// Phase 1: matrix 120 rows 124 cols
[2024-05-28 08:37:24] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 08:37:24] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-28 08:37:24] [INFO ] Invariant cache hit.
[2024-05-28 08:37:24] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-28 08:37:24] [INFO ] Redundant transitions in 20 ms returned [112]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 118 sub problems to find dead transitions.
// Phase 1: matrix 119 rows 124 cols
[2024-05-28 08:37:24] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:37:24] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 4 ms to minimize.
[2024-05-28 08:37:24] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-28 08:37:24] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 08:37:24] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 08:37:24] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/298 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:37:26] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:37:27] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:37:27] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/243 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:37:27] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-28 08:37:27] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:37:28] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 08:37:28] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:37:28] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-28 08:37:28] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/243 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:37:29] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 08:37:29] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/243 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:37:30] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-28 08:37:30] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-28 08:37:30] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:37:31] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/243 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:37:32] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 08:37:32] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/243 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:37:32] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:37:32] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:37:32] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:37:32] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/243 variables, 4/319 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/243 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 19 (OVERLAPS) 0/243 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 319 constraints, problems are : Problem set: 0 solved, 118 unsolved in 9895 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/319 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 118/437 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 437 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3094 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 26/26 constraints]
After SMT, in 13007ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 13008ms
Starting structural reductions in SI_LTL mode, iteration 1 : 124/128 places, 119/123 transitions.
Applied a total of 0 rules in 13 ms. Remains 124 /124 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13287 ms. Remains : 124/128 places, 119/123 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLCardinality-07
Product exploration explored 100000 steps with 4220 reset in 179 ms.
Product exploration explored 100000 steps with 4227 reset in 235 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 54 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
[2024-05-28 08:37:38] [INFO ] Invariant cache hit.
[2024-05-28 08:37:38] [INFO ] [Real]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-28 08:37:38] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-28 08:37:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 08:37:38] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-28 08:37:38] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-28 08:37:38] [INFO ] Computed and/alt/rep : 118/287/118 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-28 08:37:39] [INFO ] Added : 108 causal constraints over 25 iterations in 498 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 119/119 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-28 08:37:39] [INFO ] Invariant cache hit.
[2024-05-28 08:37:39] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-28 08:37:39] [INFO ] Invariant cache hit.
[2024-05-28 08:37:39] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-28 08:37:39] [INFO ] Redundant transitions in 18 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-28 08:37:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:37:39] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 2 ms to minimize.
[2024-05-28 08:37:39] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-28 08:37:39] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:37:39] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 08:37:39] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/298 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:37:40] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 08:37:40] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 08:37:40] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:37:41] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/243 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:37:42] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 0 ms to minimize.
[2024-05-28 08:37:42] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:37:42] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:37:43] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:37:43] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 08:37:44] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 1 ms to minimize.
[2024-05-28 08:37:44] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 13 (OVERLAPS) 0/243 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 309 constraints, problems are : Problem set: 0 solved, 118 unsolved in 6488 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 16/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 118/427 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:37:46] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:37:49] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:37:49] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/243 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 430 constraints, problems are : Problem set: 0 solved, 118 unsolved in 17199 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 19/19 constraints]
After SMT, in 23703ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 23704ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 23904 ms. Remains : 124/124 places, 119/119 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 144 steps (0 resets) in 5 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0)]
[2024-05-28 08:38:03] [INFO ] Invariant cache hit.
[2024-05-28 08:38:03] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 08:38:03] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-28 08:38:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 08:38:03] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-28 08:38:03] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-28 08:38:03] [INFO ] Computed and/alt/rep : 118/287/118 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-28 08:38:04] [INFO ] Added : 108 causal constraints over 25 iterations in 509 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4174 reset in 175 ms.
Product exploration explored 100000 steps with 4233 reset in 222 ms.
Built C files in :
/tmp/ltsmin3190215100692044721
[2024-05-28 08:38:04] [INFO ] Computing symmetric may disable matrix : 119 transitions.
[2024-05-28 08:38:04] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:38:04] [INFO ] Computing symmetric may enable matrix : 119 transitions.
[2024-05-28 08:38:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:38:04] [INFO ] Computing Do-Not-Accords matrix : 119 transitions.
[2024-05-28 08:38:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:38:04] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3190215100692044721
Running compilation step : cd /tmp/ltsmin3190215100692044721;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 281 ms.
Running link step : cd /tmp/ltsmin3190215100692044721;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3190215100692044721;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8933094364441812019.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 119/119 transitions.
Applied a total of 0 rules in 9 ms. Remains 124 /124 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-28 08:38:19] [INFO ] Invariant cache hit.
[2024-05-28 08:38:19] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 08:38:19] [INFO ] Invariant cache hit.
[2024-05-28 08:38:20] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-28 08:38:20] [INFO ] Redundant transitions in 19 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-28 08:38:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:38:20] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 08:38:20] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-28 08:38:20] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:38:20] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 08:38:20] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/298 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:38:21] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 08:38:21] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 08:38:21] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:38:22] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/243 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:38:23] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-28 08:38:23] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:38:23] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:38:24] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:38:24] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 08:38:24] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 08:38:25] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 13 (OVERLAPS) 0/243 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 309 constraints, problems are : Problem set: 0 solved, 118 unsolved in 6524 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 16/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 118/427 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:38:27] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:38:30] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-28 08:38:30] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/243 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 430 constraints, problems are : Problem set: 0 solved, 118 unsolved in 17161 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 19/19 constraints]
After SMT, in 23705ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 23709ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 23922 ms. Remains : 124/124 places, 119/119 transitions.
Built C files in :
/tmp/ltsmin1236956919914688005
[2024-05-28 08:38:43] [INFO ] Computing symmetric may disable matrix : 119 transitions.
[2024-05-28 08:38:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:38:43] [INFO ] Computing symmetric may enable matrix : 119 transitions.
[2024-05-28 08:38:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:38:43] [INFO ] Computing Do-Not-Accords matrix : 119 transitions.
[2024-05-28 08:38:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:38:43] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1236956919914688005
Running compilation step : cd /tmp/ltsmin1236956919914688005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 292 ms.
Running link step : cd /tmp/ltsmin1236956919914688005;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1236956919914688005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11524149272232189220.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 08:38:58] [INFO ] Flatten gal took : 7 ms
[2024-05-28 08:38:58] [INFO ] Flatten gal took : 6 ms
[2024-05-28 08:38:58] [INFO ] Time to serialize gal into /tmp/LTL1685689425394827108.gal : 1 ms
[2024-05-28 08:38:58] [INFO ] Time to serialize properties into /tmp/LTL14071217303816186322.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1685689425394827108.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4421133194474232720.hoa' '-atoms' '/tmp/LTL14071217303816186322.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14071217303816186322.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4421133194474232720.hoa
Detected timeout of ITS tools.
[2024-05-28 08:39:13] [INFO ] Flatten gal took : 7 ms
[2024-05-28 08:39:13] [INFO ] Flatten gal took : 6 ms
[2024-05-28 08:39:13] [INFO ] Time to serialize gal into /tmp/LTL3997428402423910538.gal : 1 ms
[2024-05-28 08:39:13] [INFO ] Time to serialize properties into /tmp/LTL1397331429046812472.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3997428402423910538.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1397331429046812472.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((p126==0)&&(p107==1))"))))
Formula 0 simplified : FG!"((p126==0)&&(p107==1))"
Detected timeout of ITS tools.
[2024-05-28 08:39:29] [INFO ] Flatten gal took : 14 ms
[2024-05-28 08:39:29] [INFO ] Applying decomposition
[2024-05-28 08:39:29] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8534876190103696754.txt' '-o' '/tmp/graph8534876190103696754.bin' '-w' '/tmp/graph8534876190103696754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8534876190103696754.bin' '-l' '-1' '-v' '-w' '/tmp/graph8534876190103696754.weights' '-q' '0' '-e' '0.001'
[2024-05-28 08:39:29] [INFO ] Decomposing Gal with order
[2024-05-28 08:39:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 08:39:29] [INFO ] Removed a total of 75 redundant transitions.
[2024-05-28 08:39:29] [INFO ] Flatten gal took : 16 ms
[2024-05-28 08:39:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 18 ms.
[2024-05-28 08:39:29] [INFO ] Time to serialize gal into /tmp/LTL1545749879715103256.gal : 2 ms
[2024-05-28 08:39:29] [INFO ] Time to serialize properties into /tmp/LTL14496140220480638717.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1545749879715103256.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14496140220480638717.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i4.i0.u44.p126==0)&&(i4.i0.u38.p107==1))"))))
Formula 0 simplified : FG!"((i4.i0.u44.p126==0)&&(i4.i0.u38.p107==1))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005A-LTLCardinality-07 finished in 140033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 128 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 122
Applied a total of 2 rules in 12 ms. Remains 127 /128 variables (removed 1) and now considering 122/123 (removed 1) transitions.
// Phase 1: matrix 122 rows 127 cols
[2024-05-28 08:39:44] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 08:39:44] [INFO ] Implicit Places using invariants in 74 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/128 places, 122/123 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 91 ms. Remains : 126/128 places, 122/123 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLCardinality-09
Product exploration explored 100000 steps with 350 reset in 235 ms.
Product exploration explored 100000 steps with 348 reset in 255 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
RANDOM walk for 199 steps (0 resets) in 6 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 126 cols
[2024-05-28 08:39:45] [INFO ] Computed 45 invariants in 4 ms
[2024-05-28 08:39:45] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-28 08:39:45] [INFO ] Invariant cache hit.
[2024-05-28 08:39:45] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-28 08:39:45] [INFO ] Redundant transitions in 28 ms returned [119]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 120 sub problems to find dead transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-05-28 08:39:45] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:39:46] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 08:39:46] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-28 08:39:46] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:39:46] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-28 08:39:46] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/247 variables, 126/302 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:39:47] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:39:48] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 08:39:48] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:39:48] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 08:39:48] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/247 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:39:49] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:39:50] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/247 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:39:50] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 08:39:50] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:39:51] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:39:51] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:39:52] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 18 (OVERLAPS) 0/247 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 314 constraints, problems are : Problem set: 0 solved, 120 unsolved in 8795 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 45/170 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 17/188 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/247 variables, 126/314 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 120/434 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/247 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 434 constraints, problems are : Problem set: 0 solved, 120 unsolved in 6009 ms.
Refiners :[Domain max(s): 126/126 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 17/17 constraints]
After SMT, in 14822ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 14823ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/126 places, 121/122 transitions.
Applied a total of 0 rules in 12 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15052 ms. Remains : 126/126 places, 121/122 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 571 steps (0 resets) in 11 ms. (47 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 349 reset in 223 ms.
Product exploration explored 100000 steps with 347 reset in 244 ms.
Built C files in :
/tmp/ltsmin13238698141863898748
[2024-05-28 08:40:00] [INFO ] Computing symmetric may disable matrix : 121 transitions.
[2024-05-28 08:40:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:40:01] [INFO ] Computing symmetric may enable matrix : 121 transitions.
[2024-05-28 08:40:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:40:01] [INFO ] Computing Do-Not-Accords matrix : 121 transitions.
[2024-05-28 08:40:01] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:40:01] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13238698141863898748
Running compilation step : cd /tmp/ltsmin13238698141863898748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 287 ms.
Running link step : cd /tmp/ltsmin13238698141863898748;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13238698141863898748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2032781632847245222.hoa' '--buchi-type=spotba'
LTSmin run took 4690 ms.
FORMULA ShieldIIPs-PT-005A-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-005A-LTLCardinality-09 finished in 21869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-05-28 08:40:06] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 08:40:06] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-28 08:40:06] [INFO ] Invariant cache hit.
[2024-05-28 08:40:06] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 08:40:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:40:07] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
[2024-05-28 08:40:07] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:40:07] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 08:40:07] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 08:40:07] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:40:08] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:40:08] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:40:08] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:40:08] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4140 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:40:11] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5399 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9559ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9560ms
Finished structural reductions in LTL mode , in 1 iterations and 9740 ms. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLCardinality-10
Product exploration explored 100000 steps with 2057 reset in 228 ms.
Product exploration explored 100000 steps with 2103 reset in 262 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 63 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 08:40:16] [INFO ] Invariant cache hit.
[2024-05-28 08:40:17] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-28 08:40:17] [INFO ] Invariant cache hit.
[2024-05-28 08:40:17] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 08:40:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:40:18] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-28 08:40:18] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-28 08:40:18] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 08:40:18] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 08:40:18] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:40:19] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:40:19] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-28 08:40:19] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:40:19] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4238 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:40:22] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5478 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9735ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9737ms
Finished structural reductions in LTL mode , in 1 iterations and 9924 ms. Remains : 128/128 places, 123/123 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2102 reset in 203 ms.
Product exploration explored 100000 steps with 2052 reset in 217 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 128 transition count 123
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 12 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 08:40:28] [INFO ] Redundant transitions in 21 ms returned [115]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 121 sub problems to find dead transitions.
// Phase 1: matrix 122 rows 128 cols
[2024-05-28 08:40:28] [INFO ] Computed 46 invariants in 0 ms
[2024-05-28 08:40:28] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 08:40:29] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 08:40:29] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-28 08:40:29] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:40:29] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:40:29] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 08:40:29] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-28 08:40:29] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 7/181 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/181 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 122/250 variables, 128/309 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 3/312 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/312 constraints. Problems are: Problem set: 2 solved, 119 unsolved
[2024-05-28 08:40:31] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/250 variables, 1/313 constraints. Problems are: Problem set: 2 solved, 119 unsolved
[2024-05-28 08:40:32] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 1/314 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 0/314 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/250 variables, 0/314 constraints. Problems are: Problem set: 2 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 314 constraints, problems are : Problem set: 2 solved, 119 unsolved in 6651 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 2 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 3/128 variables, 46/171 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 3/174 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 122/250 variables, 128/311 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 3/314 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 119/433 constraints. Problems are: Problem set: 2 solved, 119 unsolved
[2024-05-28 08:40:36] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 08:40:36] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:40:36] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:40:37] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 4/437 constraints. Problems are: Problem set: 2 solved, 119 unsolved
[2024-05-28 08:40:38] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
[2024-05-28 08:40:38] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 2/439 constraints. Problems are: Problem set: 2 solved, 119 unsolved
[2024-05-28 08:40:41] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 1/440 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/440 constraints. Problems are: Problem set: 2 solved, 119 unsolved
At refinement iteration 13 (OVERLAPS) 0/250 variables, 0/440 constraints. Problems are: Problem set: 2 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 440 constraints, problems are : Problem set: 2 solved, 119 unsolved in 14393 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 119/121 constraints, Known Traps: 16/16 constraints]
After SMT, in 21072ms problems are : Problem set: 2 solved, 119 unsolved
Search for dead transitions found 2 dead transitions in 21073ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 128/128 places, 120/123 transitions.
Graph (complete) has 439 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 126 /128 variables (removed 2) and now considering 120/120 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 126/128 places, 120/123 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21133 ms. Remains : 126/128 places, 120/123 transitions.
Built C files in :
/tmp/ltsmin4246955096162234609
[2024-05-28 08:40:49] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4246955096162234609
Running compilation step : cd /tmp/ltsmin4246955096162234609;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 249 ms.
Running link step : cd /tmp/ltsmin4246955096162234609;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4246955096162234609;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12941371533299012951.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-05-28 08:41:04] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 08:41:04] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-28 08:41:04] [INFO ] Invariant cache hit.
[2024-05-28 08:41:04] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 08:41:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:41:05] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 08:41:05] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:41:05] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 08:41:05] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 08:41:05] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:41:06] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:41:07] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:41:07] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-28 08:41:07] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4095 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:41:10] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5504 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9622ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9623ms
Finished structural reductions in LTL mode , in 1 iterations and 9835 ms. Remains : 128/128 places, 123/123 transitions.
Built C files in :
/tmp/ltsmin14779295993885387002
[2024-05-28 08:41:14] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14779295993885387002
Running compilation step : cd /tmp/ltsmin14779295993885387002;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 287 ms.
Running link step : cd /tmp/ltsmin14779295993885387002;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14779295993885387002;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12882961541339376852.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 08:41:29] [INFO ] Flatten gal took : 7 ms
[2024-05-28 08:41:29] [INFO ] Flatten gal took : 7 ms
[2024-05-28 08:41:29] [INFO ] Time to serialize gal into /tmp/LTL8990977658087586454.gal : 1 ms
[2024-05-28 08:41:29] [INFO ] Time to serialize properties into /tmp/LTL15048277440806639251.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8990977658087586454.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9342140056306965076.hoa' '-atoms' '/tmp/LTL15048277440806639251.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15048277440806639251.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9342140056306965076.hoa
Detected timeout of ITS tools.
[2024-05-28 08:41:44] [INFO ] Flatten gal took : 7 ms
[2024-05-28 08:41:44] [INFO ] Flatten gal took : 7 ms
[2024-05-28 08:41:44] [INFO ] Time to serialize gal into /tmp/LTL18360481601266536208.gal : 1 ms
[2024-05-28 08:41:44] [INFO ] Time to serialize properties into /tmp/LTL13997399223477189245.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18360481601266536208.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13997399223477189245.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((p19==0)||(p89==1))"))))))
Formula 0 simplified : XXXG!"((p19==0)||(p89==1))"
Detected timeout of ITS tools.
[2024-05-28 08:41:59] [INFO ] Flatten gal took : 12 ms
[2024-05-28 08:41:59] [INFO ] Applying decomposition
[2024-05-28 08:41:59] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8438943134553014065.txt' '-o' '/tmp/graph8438943134553014065.bin' '-w' '/tmp/graph8438943134553014065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8438943134553014065.bin' '-l' '-1' '-v' '-w' '/tmp/graph8438943134553014065.weights' '-q' '0' '-e' '0.001'
[2024-05-28 08:41:59] [INFO ] Decomposing Gal with order
[2024-05-28 08:41:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 08:41:59] [INFO ] Removed a total of 80 redundant transitions.
[2024-05-28 08:41:59] [INFO ] Flatten gal took : 10 ms
[2024-05-28 08:41:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 4 ms.
[2024-05-28 08:41:59] [INFO ] Time to serialize gal into /tmp/LTL8364773219925403844.gal : 3 ms
[2024-05-28 08:41:59] [INFO ] Time to serialize properties into /tmp/LTL17898236398907147202.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8364773219925403844.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17898236398907147202.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((i0.i1.u7.p19==0)||(i3.i1.u33.p89==1))"))))))
Formula 0 simplified : XXXG!"((i0.i1.u7.p19==0)||(i3.i1.u33.p89==1))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005A-LTLCardinality-10 finished in 128611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p1))||G(p2)||G(p3)||p0)))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 128 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 126 transition count 121
Applied a total of 4 rules in 8 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-05-28 08:42:14] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 08:42:14] [INFO ] Implicit Places using invariants in 71 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/128 places, 121/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 83 ms. Remains : 125/128 places, 121/123 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), (AND (NOT p1) p0 (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLCardinality-12
Stuttering criterion allowed to conclude after 9850 steps with 202 reset in 26 ms.
FORMULA ShieldIIPs-PT-005A-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-LTLCardinality-12 finished in 314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(!p0)) U G(!p1))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-05-28 08:42:14] [INFO ] Computed 46 invariants in 0 ms
[2024-05-28 08:42:15] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 08:42:15] [INFO ] Invariant cache hit.
[2024-05-28 08:42:15] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-28 08:42:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:42:16] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-28 08:42:16] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-28 08:42:16] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 08:42:16] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 08:42:16] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/307 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:42:17] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:42:17] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-28 08:42:17] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-28 08:42:17] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 311 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4177 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 46/173 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 122/433 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 08:42:20] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 434 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5318 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 10/10 constraints]
After SMT, in 9513ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 9514ms
Finished structural reductions in LTL mode , in 1 iterations and 9704 ms. Remains : 128/128 places, 123/123 transitions.
Stuttering acceptance computed with spot in 120 ms :[p1, p1, p0]
Running random walk in product with property : ShieldIIPs-PT-005A-LTLCardinality-13
Stuttering criterion allowed to conclude after 1112 steps with 3 reset in 3 ms.
FORMULA ShieldIIPs-PT-005A-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005A-LTLCardinality-13 finished in 9848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : ShieldIIPs-PT-005A-LTLCardinality-03
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 127 transition count 121
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 125 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 124 transition count 120
Applied a total of 5 rules in 14 ms. Remains 124 /128 variables (removed 4) and now considering 120/123 (removed 3) transitions.
// Phase 1: matrix 120 rows 124 cols
[2024-05-28 08:42:25] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 08:42:25] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 08:42:25] [INFO ] Invariant cache hit.
[2024-05-28 08:42:25] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-28 08:42:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:42:25] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 08:42:25] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 08:42:25] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:42:25] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:42:25] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/244 variables, 124/298 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:42:26] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 08:42:26] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-28 08:42:26] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/244 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 301 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2995 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/244 variables, 124/301 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 119/420 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:42:28] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 08:42:28] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-28 08:42:29] [INFO ] Deduced a trap composed of 9 places in 14 ms of which 1 ms to minimize.
[2024-05-28 08:42:29] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:42:31] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/244 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 425 constraints, problems are : Problem set: 0 solved, 119 unsolved in 12313 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 13/13 constraints]
After SMT, in 15323ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 15324ms
Starting structural reductions in LI_LTL mode, iteration 1 : 124/128 places, 120/123 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 15507 ms. Remains : 124/128 places, 120/123 transitions.
Running random walk in product with property : ShieldIIPs-PT-005A-LTLCardinality-03
Product exploration explored 100000 steps with 1958 reset in 187 ms.
Product exploration explored 100000 steps with 1955 reset in 206 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 57 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 200 steps (0 resets) in 6 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 08:42:41] [INFO ] Invariant cache hit.
[2024-05-28 08:42:41] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 08:42:41] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-28 08:42:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 08:42:41] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-28 08:42:41] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-28 08:42:41] [INFO ] Computed and/alt/rep : 119/292/119 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-28 08:42:41] [INFO ] Added : 117 causal constraints over 24 iterations in 318 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 120/120 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-28 08:42:41] [INFO ] Invariant cache hit.
[2024-05-28 08:42:42] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 08:42:42] [INFO ] Invariant cache hit.
[2024-05-28 08:42:42] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-28 08:42:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:42:42] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-28 08:42:42] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-28 08:42:42] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 08:42:42] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 08:42:42] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/244 variables, 124/298 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:42:43] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 08:42:43] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 08:42:43] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/244 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 301 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2992 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/244 variables, 124/301 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 119/420 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:42:45] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-28 08:42:45] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:42:46] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 08:42:46] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:42:48] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/244 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 425 constraints, problems are : Problem set: 0 solved, 119 unsolved in 12615 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 13/13 constraints]
After SMT, in 15625ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 15627ms
Finished structural reductions in LTL mode , in 1 iterations and 15809 ms. Remains : 124/124 places, 120/120 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 263 steps (0 resets) in 5 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 08:42:58] [INFO ] Invariant cache hit.
[2024-05-28 08:42:58] [INFO ] [Real]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-28 08:42:58] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-28 08:42:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 08:42:58] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 08:42:58] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-28 08:42:58] [INFO ] Computed and/alt/rep : 119/292/119 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-28 08:42:58] [INFO ] Added : 117 causal constraints over 24 iterations in 310 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1965 reset in 180 ms.
Product exploration explored 100000 steps with 1956 reset in 204 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 120/120 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-28 08:42:59] [INFO ] Redundant transitions in 25 ms returned [112]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 118 sub problems to find dead transitions.
// Phase 1: matrix 119 rows 124 cols
[2024-05-28 08:42:59] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:42:59] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 2 ms to minimize.
[2024-05-28 08:42:59] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:42:59] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 08:43:00] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 08:43:00] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/298 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:01] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:02] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-28 08:43:02] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/243 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:02] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 1 ms to minimize.
[2024-05-28 08:43:02] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:03] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 08:43:03] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 08:43:03] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-28 08:43:04] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/243 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:04] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-28 08:43:04] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/243 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:05] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-28 08:43:05] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-28 08:43:05] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:06] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/243 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:07] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-28 08:43:07] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/243 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 08:43:07] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-28 08:43:07] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:43:07] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-28 08:43:08] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/243 variables, 4/319 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/243 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 19 (OVERLAPS) 0/243 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 319 constraints, problems are : Problem set: 0 solved, 118 unsolved in 10049 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/243 variables, 124/319 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 118/437 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/243 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 437 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3245 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 26/26 constraints]
After SMT, in 13312ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 13313ms
Starting structural reductions in SI_LTL mode, iteration 1 : 124/124 places, 119/120 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13355 ms. Remains : 124/124 places, 119/120 transitions.
Built C files in :
/tmp/ltsmin13911757591930252111
[2024-05-28 08:43:12] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13911757591930252111
Running compilation step : cd /tmp/ltsmin13911757591930252111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 251 ms.
Running link step : cd /tmp/ltsmin13911757591930252111;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13911757591930252111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1179040791160102354.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 120/120 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 120/120 (removed 0) transitions.
// Phase 1: matrix 120 rows 124 cols
[2024-05-28 08:43:28] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 08:43:28] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 08:43:28] [INFO ] Invariant cache hit.
[2024-05-28 08:43:28] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-28 08:43:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:43:28] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 3 ms to minimize.
[2024-05-28 08:43:28] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 08:43:28] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 08:43:28] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 08:43:28] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/244 variables, 124/298 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:43:29] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 08:43:29] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-28 08:43:29] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/244 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 301 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3054 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/244 variables, 124/301 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 119/420 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:43:32] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 08:43:32] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 08:43:32] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 08:43:32] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:43:35] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/244 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 425 constraints, problems are : Problem set: 0 solved, 119 unsolved in 12708 ms.
Refiners :[Domain max(s): 124/124 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 13/13 constraints]
After SMT, in 15787ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 15788ms
Finished structural reductions in LTL mode , in 1 iterations and 15974 ms. Remains : 124/124 places, 120/120 transitions.
Built C files in :
/tmp/ltsmin2076781914802278066
[2024-05-28 08:43:44] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2076781914802278066
Running compilation step : cd /tmp/ltsmin2076781914802278066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 270 ms.
Running link step : cd /tmp/ltsmin2076781914802278066;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2076781914802278066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10688053941508786984.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 08:43:59] [INFO ] Flatten gal took : 7 ms
[2024-05-28 08:43:59] [INFO ] Flatten gal took : 11 ms
[2024-05-28 08:43:59] [INFO ] Time to serialize gal into /tmp/LTL9761630598600685331.gal : 1 ms
[2024-05-28 08:43:59] [INFO ] Time to serialize properties into /tmp/LTL654561465808615714.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9761630598600685331.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16159504299298481609.hoa' '-atoms' '/tmp/LTL654561465808615714.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL654561465808615714.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16159504299298481609.hoa
Detected timeout of ITS tools.
[2024-05-28 08:44:14] [INFO ] Flatten gal took : 7 ms
[2024-05-28 08:44:14] [INFO ] Flatten gal took : 5 ms
[2024-05-28 08:44:14] [INFO ] Time to serialize gal into /tmp/LTL3298165321115526358.gal : 1 ms
[2024-05-28 08:44:14] [INFO ] Time to serialize properties into /tmp/LTL10857610084798572824.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3298165321115526358.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10857610084798572824.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(p56==1)")))))
Formula 0 simplified : XXG!"(p56==1)"
Detected timeout of ITS tools.
[2024-05-28 08:44:29] [INFO ] Flatten gal took : 6 ms
[2024-05-28 08:44:29] [INFO ] Applying decomposition
[2024-05-28 08:44:29] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17461474005842194948.txt' '-o' '/tmp/graph17461474005842194948.bin' '-w' '/tmp/graph17461474005842194948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17461474005842194948.bin' '-l' '-1' '-v' '-w' '/tmp/graph17461474005842194948.weights' '-q' '0' '-e' '0.001'
[2024-05-28 08:44:29] [INFO ] Decomposing Gal with order
[2024-05-28 08:44:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 08:44:29] [INFO ] Removed a total of 77 redundant transitions.
[2024-05-28 08:44:29] [INFO ] Flatten gal took : 9 ms
[2024-05-28 08:44:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 3 ms.
[2024-05-28 08:44:29] [INFO ] Time to serialize gal into /tmp/LTL3101921390873370072.gal : 1 ms
[2024-05-28 08:44:29] [INFO ] Time to serialize properties into /tmp/LTL12514942304372076147.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3101921390873370072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12514942304372076147.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(i2.i2.u20.p56==1)")))))
Formula 0 simplified : XXG!"(i2.i2.u20.p56==1)"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005A-LTLCardinality-03 finished in 139505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : ShieldIIPs-PT-005A-LTLCardinality-10
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 128 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 126 transition count 121
Applied a total of 4 rules in 8 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-05-28 08:44:44] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 08:44:44] [INFO ] Implicit Places using invariants in 87 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 125/128 places, 121/123 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 99 ms. Remains : 125/128 places, 121/123 transitions.
Running random walk in product with property : ShieldIIPs-PT-005A-LTLCardinality-10
Product exploration explored 100000 steps with 2295 reset in 197 ms.
Product exploration explored 100000 steps with 2279 reset in 229 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 121/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 125 cols
[2024-05-28 08:44:45] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 08:44:45] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-28 08:44:45] [INFO ] Invariant cache hit.
[2024-05-28 08:44:46] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-28 08:44:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:44:46] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:44:47] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-28 08:44:47] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 08:44:47] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 08:44:47] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/246 variables, 125/300 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:44:48] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/246 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:44:49] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 08:44:49] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:44:49] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 08:44:50] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 08:44:50] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:44:50] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:44:50] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:44:51] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:44:51] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:44:51] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:44:52] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 16 (OVERLAPS) 0/246 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 312 constraints, problems are : Problem set: 0 solved, 120 unsolved in 7765 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 17/187 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/246 variables, 125/312 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 120/432 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:44:56] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:45:00] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 0/246 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 434 constraints, problems are : Problem set: 0 solved, 120 unsolved in 17265 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 19/19 constraints]
After SMT, in 25052ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 25053ms
Finished structural reductions in LTL mode , in 1 iterations and 25239 ms. Remains : 125/125 places, 121/121 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2243 reset in 188 ms.
Product exploration explored 100000 steps with 2277 reset in 219 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-05-28 08:45:12] [INFO ] Redundant transitions in 18 ms returned [113]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 119 sub problems to find dead transitions.
// Phase 1: matrix 120 rows 125 cols
[2024-05-28 08:45:12] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:45:13] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-28 08:45:13] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-28 08:45:13] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-28 08:45:13] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:45:13] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/300 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:45:14] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 08:45:14] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 0 ms to minimize.
[2024-05-28 08:45:14] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:45:14] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 08:45:14] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 08:45:14] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 08:45:14] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 08:45:14] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 08:45:15] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 9/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 309 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3888 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 14/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/245 variables, 125/309 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 119/428 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:45:17] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:45:21] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 08:45:23] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/245 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 431 constraints, problems are : Problem set: 0 solved, 119 unsolved in 16959 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 17/17 constraints]
After SMT, in 20867ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 20868ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/125 places, 120/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20897 ms. Remains : 125/125 places, 120/121 transitions.
Built C files in :
/tmp/ltsmin4401262752164835444
[2024-05-28 08:45:33] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4401262752164835444
Running compilation step : cd /tmp/ltsmin4401262752164835444;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 247 ms.
Running link step : cd /tmp/ltsmin4401262752164835444;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin4401262752164835444;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9255214734504167230.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 121/121 transitions.
Applied a total of 0 rules in 1 ms. Remains 125 /125 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 125 cols
[2024-05-28 08:45:48] [INFO ] Computed 45 invariants in 2 ms
[2024-05-28 08:45:48] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 08:45:48] [INFO ] Invariant cache hit.
[2024-05-28 08:45:48] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-28 08:45:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:45:49] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 08:45:49] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-28 08:45:49] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 08:45:49] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 08:45:49] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/246 variables, 125/300 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:45:51] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/246 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:45:51] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 08:45:51] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:45:52] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 08:45:52] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 08:45:52] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 08:45:52] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:45:53] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:45:53] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 08:45:53] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:45:54] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:45:54] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 16 (OVERLAPS) 0/246 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 312 constraints, problems are : Problem set: 0 solved, 120 unsolved in 7687 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 45/169 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 17/187 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/246 variables, 125/312 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 120/432 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:45:59] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 08:46:02] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 0/246 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 434 constraints, problems are : Problem set: 0 solved, 120 unsolved in 17338 ms.
Refiners :[Domain max(s): 125/125 constraints, Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 19/19 constraints]
After SMT, in 25049ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 25050ms
Finished structural reductions in LTL mode , in 1 iterations and 25246 ms. Remains : 125/125 places, 121/121 transitions.
Built C files in :
/tmp/ltsmin1925158147499446824
[2024-05-28 08:46:13] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1925158147499446824
Running compilation step : cd /tmp/ltsmin1925158147499446824;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 270 ms.
Running link step : cd /tmp/ltsmin1925158147499446824;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1925158147499446824;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17156809051842374052.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 08:46:28] [INFO ] Flatten gal took : 4 ms
[2024-05-28 08:46:28] [INFO ] Flatten gal took : 4 ms
[2024-05-28 08:46:28] [INFO ] Time to serialize gal into /tmp/LTL1077513785083228933.gal : 1 ms
[2024-05-28 08:46:28] [INFO ] Time to serialize properties into /tmp/LTL9361180132328278617.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1077513785083228933.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12560723312633303155.hoa' '-atoms' '/tmp/LTL9361180132328278617.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9361180132328278617.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12560723312633303155.hoa
Detected timeout of ITS tools.
[2024-05-28 08:46:44] [INFO ] Flatten gal took : 7 ms
[2024-05-28 08:46:44] [INFO ] Flatten gal took : 4 ms
[2024-05-28 08:46:44] [INFO ] Time to serialize gal into /tmp/LTL10040347813476752590.gal : 1 ms
[2024-05-28 08:46:44] [INFO ] Time to serialize properties into /tmp/LTL13952777085959521854.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10040347813476752590.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13952777085959521854.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((p19==0)||(p89==1))"))))))
Formula 0 simplified : XXXG!"((p19==0)||(p89==1))"
Detected timeout of ITS tools.
[2024-05-28 08:46:59] [INFO ] Flatten gal took : 10 ms
[2024-05-28 08:46:59] [INFO ] Applying decomposition
[2024-05-28 08:46:59] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18014925440632915307.txt' '-o' '/tmp/graph18014925440632915307.bin' '-w' '/tmp/graph18014925440632915307.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18014925440632915307.bin' '-l' '-1' '-v' '-w' '/tmp/graph18014925440632915307.weights' '-q' '0' '-e' '0.001'
[2024-05-28 08:46:59] [INFO ] Decomposing Gal with order
[2024-05-28 08:46:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 08:46:59] [INFO ] Removed a total of 77 redundant transitions.
[2024-05-28 08:46:59] [INFO ] Flatten gal took : 9 ms
[2024-05-28 08:46:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 4 ms.
[2024-05-28 08:46:59] [INFO ] Time to serialize gal into /tmp/LTL5486277856949298694.gal : 3 ms
[2024-05-28 08:46:59] [INFO ] Time to serialize properties into /tmp/LTL8227071463302299832.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5486277856949298694.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8227071463302299832.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((i0.i2.u7.p19==0)||(i3.i0.u33.p89==1))"))))))
Formula 0 simplified : XXXG!"((i0.i2.u7.p19==0)||(i3.i0.u33.p89==1))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005A-LTLCardinality-10 finished in 149720 ms.
[2024-05-28 08:47:14] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9313932304847049424
[2024-05-28 08:47:14] [INFO ] Applying decomposition
[2024-05-28 08:47:14] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2024-05-28 08:47:14] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:47:14] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2024-05-28 08:47:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:47:14] [INFO ] Flatten gal took : 4 ms
[2024-05-28 08:47:14] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2024-05-28 08:47:14] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 08:47:14] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9313932304847049424
Running compilation step : cd /tmp/ltsmin9313932304847049424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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.202405141337/bin/convert-linux64' '-i' '/tmp/graph15783277829491904682.txt' '-o' '/tmp/graph15783277829491904682.bin' '-w' '/tmp/graph15783277829491904682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15783277829491904682.bin' '-l' '-1' '-v' '-w' '/tmp/graph15783277829491904682.weights' '-q' '0' '-e' '0.001'
[2024-05-28 08:47:14] [INFO ] Decomposing Gal with order
[2024-05-28 08:47:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 08:47:14] [INFO ] Removed a total of 80 redundant transitions.
[2024-05-28 08:47:14] [INFO ] Flatten gal took : 8 ms
[2024-05-28 08:47:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 3 ms.
[2024-05-28 08:47:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality4181042847233649845.gal : 2 ms
[2024-05-28 08:47:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality6730948219801348721.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4181042847233649845.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6730948219801348721.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((X(X(F("(i2.i2.u20.p56==1)")))))
Formula 0 simplified : XXG!"(i2.i2.u20.p56==1)"
Compilation finished in 319 ms.
Running link step : cd /tmp/ltsmin9313932304847049424;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin9313932304847049424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin9313932304847049424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9313932304847049424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
LTSmin run took 45346 ms.
FORMULA ShieldIIPs-PT-005A-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9313932304847049424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin9313932304847049424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>((LTLAPp2==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin9313932304847049424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-28 09:11:21] [INFO ] Applying decomposition
[2024-05-28 09:11:21] [INFO ] Flatten gal took : 4 ms
[2024-05-28 09:11:21] [INFO ] Decomposing Gal with order
[2024-05-28 09:11:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 09:11:21] [INFO ] Removed a total of 85 redundant transitions.
[2024-05-28 09:11:21] [INFO ] Flatten gal took : 27 ms
[2024-05-28 09:11:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 2 ms.
[2024-05-28 09:11:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality16431249071052250595.gal : 19 ms
[2024-05-28 09:11:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality14429281239793441440.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16431249071052250595.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14429281239793441440.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((X(X(F("(i18.u24.p56==1)")))))
Formula 0 simplified : XXG!"(i18.u24.p56==1)"
Reverse transition relation is NOT exact ! Due to transitions t48, t50, t59, t61, t63, t65, t75, t76, t79, t81, t88, t92, t94, t95, t103, t107, t109, t110,...577
Computing Next relation with stutter on 136620 deadlock states

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="ShieldIIPs-PT-005A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-005A, 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 r356-tall-171683760300067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-005A.tgz
mv ShieldIIPs-PT-005A 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 ;