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-171683760200025.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-002B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760200025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 11 14:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 14:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 14:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 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 33K 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-002B-CTLCardinality-2024-00
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-01
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-02
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-03
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-04
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-05
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-06
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-07
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-08
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-09
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-10
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2024-11
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2023-12
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2023-13
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2023-14
FORMULA_NAME ShieldIIPs-PT-002B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716876515109

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-002B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 06:08:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 06:08:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:08:36] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-28 06:08:36] [INFO ] Transformed 123 places.
[2024-05-28 06:08:36] [INFO ] Transformed 121 transitions.
[2024-05-28 06:08:36] [INFO ] Found NUPN structural information;
[2024-05-28 06:08:36] [INFO ] Parsed PT model containing 123 places and 121 transitions and 362 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Applied a total of 0 rules in 16 ms. Remains 123 /123 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 123 cols
[2024-05-28 06:08:36] [INFO ] Computed 19 invariants in 14 ms
[2024-05-28 06:08:36] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-28 06:08:36] [INFO ] Invariant cache hit.
[2024-05-28 06:08:36] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-28 06:08:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 19/141 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:38] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 16 ms to minimize.
[2024-05-28 06:08:38] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-05-28 06:08:38] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:08:38] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:08:38] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:08:38] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:08:38] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:08:38] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:08:38] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:08:38] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:08:38] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:08:38] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:08:38] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:08:38] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:08:38] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:08:38] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:08:38] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 1 ms to minimize.
[2024-05-28 06:08:38] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:08:38] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:08:38] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 4 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:08:39] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:08:40] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 16/198 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:41] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 8 ms to minimize.
[2024-05-28 06:08:41] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:08:41] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:08:41] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:08:41] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:08:41] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 6/204 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:41] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 121/244 variables, 123/328 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:42] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:08:42] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-28 06:08:42] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2024-05-28 06:08:42] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-28 06:08:42] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 06:08:42] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:08:43] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:08:43] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 06:08:43] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:08:43] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:08:43] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:08:43] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:08:43] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:08:43] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:08:43] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2024-05-28 06:08:43] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:08:43] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:08:43] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:08:43] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:08:43] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 20/348 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:44] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-28 06:08:44] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:08:44] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:08:44] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:08:44] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 5/353 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:45] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:08:45] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:08:45] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:08:45] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:45] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 14/371 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:47] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/244 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/244 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:48] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/244 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:49] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:08:49] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:08:49] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2024-05-28 06:08:49] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:08:49] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/244 variables, 5/378 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/244 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/244 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/244 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/244 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:53] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:08:53] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/244 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:53] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/244 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:54] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:08:55] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:08:55] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/244 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:55] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
[2024-05-28 06:08:55] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:08:55] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:08:55] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:08:55] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:08:55] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:08:55] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:08:55] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 06:08:56] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:08:56] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:08:56] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:08:56] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:08:56] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:08:56] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:08:56] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:08:56] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/244 variables, 16/403 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:56] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:08:57] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/244 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:58] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/244 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/244 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:08:59] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:08:59] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
At refinement iteration 30 (OVERLAPS) 0/244 variables, 2/408 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:09:00] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 0 ms to minimize.
[2024-05-28 06:09:00] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:09:00] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:09:00] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:09:00] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:09:00] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:09:00] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:09:00] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/244 variables, 8/416 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:09:01] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/244 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:09:02] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/244 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/244 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 35 (OVERLAPS) 0/244 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 418 constraints, problems are : Problem set: 0 solved, 120 unsolved in 27612 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 153/153 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 19/141 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 153/295 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:09:05] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:09:05] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:09:05] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:09:05] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:09:05] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:09:05] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:09:05] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:09:05] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:09:05] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 9/304 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 121/244 variables, 123/427 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 120/547 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:09:07] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:09:07] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:09:08] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:09:08] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:09:08] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 5/552 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:09:12] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:09:15] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-28 06:09:15] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:09:15] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:09:16] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 4/557 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:09:20] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:09:24] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-28 06:09:24] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 2/560 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:09:28] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 06:09:31] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:09:31] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:09:31] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:09:32] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:09:32] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/244 variables, 5/566 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 244/244 variables, and 566 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30020 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 181/181 constraints]
After SMT, in 57695ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 57706ms
Finished structural reductions in LTL mode , in 1 iterations and 58103 ms. Remains : 123/123 places, 121/121 transitions.
Support contains 68 out of 123 places after structural reductions.
[2024-05-28 06:09:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 06:09:34] [INFO ] Flatten gal took : 44 ms
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 06:09:34] [INFO ] Flatten gal took : 31 ms
[2024-05-28 06:09:34] [INFO ] Input system was already deterministic with 121 transitions.
Support contains 66 out of 123 places (down from 68) after GAL structural reductions.
RANDOM walk for 7046 steps (18 resets) in 273 ms. (25 steps per ms) remains 0/49 properties
[2024-05-28 06:09:35] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:09:35] [INFO ] Flatten gal took : 19 ms
[2024-05-28 06:09:35] [INFO ] Input system was already deterministic with 121 transitions.
Computed a total of 32 stabilizing places and 32 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 122 transition count 109
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 111 transition count 109
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 22 place count 111 transition count 98
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 100 transition count 98
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 57 place count 87 transition count 85
Iterating global reduction 2 with 13 rules applied. Total rules applied 70 place count 87 transition count 85
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 70 place count 87 transition count 79
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 82 place count 81 transition count 79
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 138 place count 53 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 51 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 141 place count 50 transition count 49
Applied a total of 141 rules in 38 ms. Remains 50 /123 variables (removed 73) and now considering 49/121 (removed 72) transitions.
// Phase 1: matrix 49 rows 50 cols
[2024-05-28 06:09:35] [INFO ] Computed 18 invariants in 2 ms
[2024-05-28 06:09:35] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-28 06:09:35] [INFO ] Invariant cache hit.
[2024-05-28 06:09:35] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-28 06:09:35] [INFO ] Redundant transitions in 14 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-28 06:09:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-28 06:09:35] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:09:35] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:09:35] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:09:35] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:09:35] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 06:09:35] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-05-28 06:09:35] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 49/99 variables, 50/75 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-28 06:09:35] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-28 06:09:36] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-28 06:09:36] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:09:36] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-28 06:09:36] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 80 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1325 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 49/99 variables, 50/80 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 48/128 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/99 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 128 constraints, problems are : Problem set: 0 solved, 48 unsolved in 597 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 12/12 constraints]
After SMT, in 1947ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1949ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/123 places, 49/121 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2189 ms. Remains : 50/123 places, 49/121 transitions.
[2024-05-28 06:09:37] [INFO ] Flatten gal took : 11 ms
[2024-05-28 06:09:37] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:09:37] [INFO ] Input system was already deterministic with 49 transitions.
RANDOM walk for 595 steps (3 resets) in 9 ms. (59 steps per ms) remains 0/1 properties
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 06:09:37] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:09:37] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:09:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3232628451719168830.gal : 2 ms
[2024-05-28 06:09:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7772923420288490996.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3232628451719168830.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7772923420288490996.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 122 transition count 112
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 114 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 113 transition count 111
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 18 place count 113 transition count 100
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 40 place count 102 transition count 100
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 53 place count 89 transition count 87
Iterating global reduction 3 with 13 rules applied. Total rules applied 66 place count 89 transition count 87
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 66 place count 89 transition count 82
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 76 place count 84 transition count 82
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 122 place count 61 transition count 59
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 59 transition count 57
Applied a total of 124 rules in 19 ms. Remains 59 /123 variables (removed 64) and now considering 57/121 (removed 64) transitions.
// Phase 1: matrix 57 rows 59 cols
[2024-05-28 06:09:37] [INFO ] Computed 19 invariants in 0 ms
[2024-05-28 06:09:37] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-28 06:09:37] [INFO ] Invariant cache hit.
[2024-05-28 06:09:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 06:09:37] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-28 06:09:37] [INFO ] Redundant transitions in 13 ms returned [56]
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 53 sub problems to find dead transitions.
// Phase 1: matrix 56 rows 59 cols
[2024-05-28 06:09:37] [INFO ] Computed 19 invariants in 0 ms
[2024-05-28 06:09:37] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 3/59 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-28 06:09:38] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:09:38] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:09:38] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 56/115 variables, 59/90 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:09:38] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:09:38] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:09:38] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/115 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:09:38] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:09:38] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:09:38] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-28 06:09:38] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:09:38] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:09:39] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:09:39] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/115 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/115 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 14 (OVERLAPS) 0/115 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 103 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2135 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 3/59 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 15/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:09:39] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:09:39] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 56/115 variables, 59/102 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 53/158 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 0/115 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 158 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1223 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 59/59 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 24/24 constraints]
After SMT, in 3378ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 3381ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/123 places, 56/121 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 3537 ms. Remains : 59/123 places, 56/121 transitions.
[2024-05-28 06:09:40] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:09:40] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:09:40] [INFO ] Input system was already deterministic with 56 transitions.
[2024-05-28 06:09:40] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:09:40] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:09:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality17865291933208582875.gal : 1 ms
[2024-05-28 06:09:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality11677610416218090184.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17865291933208582875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11677610416218090184.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.60945e+07,0.475571,22912,2,3201,5,65602,6,0,291,136346,0


Converting to forward existential form...Done !
original formula: AG((!(A(!((EG((p16==1)) * (p62==1))) U (p40==1))) + ((p79==0) * (((p45==0)||(p70==1)) + (AG((p39!=1)) + (p49==1))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(!(!((E(!((p40==1)) U (!(!((EG((p16==1)) * (p62==1)))) * !((p40==1)))) + EG(!((p40==1))))...381
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t15, t16, t17, t22, t23, t32, t38...320
Detected timeout of ITS tools.
[2024-05-28 06:10:11] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:10:11] [INFO ] Applying decomposition
[2024-05-28 06:10:11] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph465953210677937091.txt' '-o' '/tmp/graph465953210677937091.bin' '-w' '/tmp/graph465953210677937091.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph465953210677937091.bin' '-l' '-1' '-v' '-w' '/tmp/graph465953210677937091.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:10:11] [INFO ] Decomposing Gal with order
[2024-05-28 06:10:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:10:11] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-28 06:10:11] [INFO ] Flatten gal took : 28 ms
[2024-05-28 06:10:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 6 ms.
[2024-05-28 06:10:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality13094236911831474811.gal : 3 ms
[2024-05-28 06:10:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality12415680745475278278.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13094236911831474811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12415680745475278278.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.60945e+07,0.447695,19280,601,55,26761,128,213,62620,52,1015,0


Converting to forward existential form...Done !
original formula: AG((!(A(!((EG((i2.u3.p16==1)) * (i3.u10.p62==1))) U (i1.u7.p40==1))) + ((i4.u13.p79==0) * (((i2.u8.p45==0)||(i5.i0.u11.p70==1)) + (AG((i1...189
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(!(!((E(!((i1.u7.p40==1)) U (!(!((EG((i2.u3.p16==1)) * (i3.u10.p62==1)))) * !((i1.u7.p40=...478
Reverse transition relation is NOT exact ! Due to transitions t17, t22, t23, t32, t39, t41, t43, t44, t47, t52, t54, i0.t38, i0.u6.t0, i0.u6.t1, i1.u7.t15,...421
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,20.8233,564880,1,0,819759,372,1045,1.38449e+06,232,1416,731548
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 123 transition count 111
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 113 transition count 111
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 20 place count 113 transition count 101
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 40 place count 103 transition count 101
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 54 place count 89 transition count 87
Iterating global reduction 2 with 14 rules applied. Total rules applied 68 place count 89 transition count 87
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 68 place count 89 transition count 81
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 80 place count 83 transition count 81
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 124 place count 61 transition count 59
Applied a total of 124 rules in 25 ms. Remains 61 /123 variables (removed 62) and now considering 59/121 (removed 62) transitions.
// Phase 1: matrix 59 rows 61 cols
[2024-05-28 06:10:32] [INFO ] Computed 19 invariants in 0 ms
[2024-05-28 06:10:32] [INFO ] Implicit Places using invariants in 37 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 60/123 places, 59/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 66 ms. Remains : 60/123 places, 59/121 transitions.
[2024-05-28 06:10:32] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:10:32] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:10:32] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-28 06:10:32] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:10:32] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:10:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality15259857054559447816.gal : 1 ms
[2024-05-28 06:10:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality6417661291929191408.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15259857054559447816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6417661291929191408.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.66287e+07,0.412182,20548,2,2601,5,59994,6,0,301,115094,0


Converting to forward existential form...Done !
original formula: (EG(EF(((((!(E((p73==1) U ((p49==0)||(p64==1)))) * (p115==0)) * (p66==0)) + (p72==0)) + (p2==1)))) * EF(EG(((p80!=0)&&(p92!=1)))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * EG(E(TRUE U ((((!(E((p73==1) U ((p49==0)||(p64==1)))) * (p115==0)) * (p66==0)) + (p72==0)) + ...204
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t19, t21, t22, t40, t41, t42...310
Detected timeout of ITS tools.
[2024-05-28 06:11:02] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:11:02] [INFO ] Applying decomposition
[2024-05-28 06:11:02] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9870715119487971618.txt' '-o' '/tmp/graph9870715119487971618.bin' '-w' '/tmp/graph9870715119487971618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9870715119487971618.bin' '-l' '-1' '-v' '-w' '/tmp/graph9870715119487971618.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:11:02] [INFO ] Decomposing Gal with order
[2024-05-28 06:11:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:11:02] [INFO ] Removed a total of 29 redundant transitions.
[2024-05-28 06:11:02] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:11:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 4 ms.
[2024-05-28 06:11:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality5351975825634480365.gal : 2 ms
[2024-05-28 06:11:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality13754176874872402432.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5351975825634480365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13754176874872402432.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.66287e+07,0.266941,13008,518,53,16172,434,208,38509,56,2190,0


Converting to forward existential form...Done !
original formula: (EG(EF(((((!(E((i4.i0.u12.p73==1) U ((i1.u9.p49==0)||(i0.u11.p64==1)))) * (i6.u19.p115==0)) * (i0.u11.p66==0)) + (i4.i0.u12.p72==0)) + (i...218
=> equivalent forward existential formula: [FwdG(FwdU((Init * EG(E(TRUE U ((((!(E((i4.i0.u12.p73==1) U ((i1.u9.p49==0)||(i0.u11.p64==1)))) * (i6.u19.p115==...274
Reverse transition relation is NOT exact ! Due to transitions t0, t33, t41, t43, t48, t49, t56, i1.t42, i1.u1.t22, i1.u9.t3, i1.u9.t4, i2.t40, i2.u7.t1, i2...412
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,16.1065,326736,1,0,496857,863,1066,1.04444e+06,253,4555,421609
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 122 transition count 110
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 112 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 111 transition count 109
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 22 place count 111 transition count 99
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 42 place count 101 transition count 99
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 54 place count 89 transition count 87
Iterating global reduction 3 with 12 rules applied. Total rules applied 66 place count 89 transition count 87
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 66 place count 89 transition count 83
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 74 place count 85 transition count 83
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 132 place count 56 transition count 54
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 54 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 135 place count 53 transition count 52
Applied a total of 135 rules in 25 ms. Remains 53 /123 variables (removed 70) and now considering 52/121 (removed 69) transitions.
// Phase 1: matrix 52 rows 53 cols
[2024-05-28 06:11:18] [INFO ] Computed 18 invariants in 2 ms
[2024-05-28 06:11:18] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-28 06:11:18] [INFO ] Invariant cache hit.
[2024-05-28 06:11:18] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-28 06:11:18] [INFO ] Redundant transitions in 13 ms returned [51]
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 49 sub problems to find dead transitions.
// Phase 1: matrix 51 rows 53 cols
[2024-05-28 06:11:18] [INFO ] Computed 18 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-28 06:11:18] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 1/53 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-28 06:11:18] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:11:18] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:11:19] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 51/104 variables, 53/75 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 75 constraints, problems are : Problem set: 0 solved, 49 unsolved in 771 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 1/53 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 51/104 variables, 53/75 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 49/124 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 124 constraints, problems are : Problem set: 0 solved, 49 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 4/4 constraints]
After SMT, in 1505ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1506ms
Starting structural reductions in SI_CTL mode, iteration 1 : 53/123 places, 51/121 transitions.
Applied a total of 0 rules in 6 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1650 ms. Remains : 53/123 places, 51/121 transitions.
[2024-05-28 06:11:20] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:11:20] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:11:20] [INFO ] Input system was already deterministic with 51 transitions.
[2024-05-28 06:11:20] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:11:20] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:11:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality15416660919353945168.gal : 1 ms
[2024-05-28 06:11:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality13605284230125799373.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15416660919353945168.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13605284230125799373.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.50382e+07,0.27086,15752,2,1629,5,44612,6,0,265,85273,0


Converting to forward existential form...Done !
original formula: AF((((p54!=0)&&(p55!=1)) * AG((p43!=1))))
=> equivalent forward existential formula: [FwdG(Init,!((((p54!=0)&&(p55!=1)) * !(E(TRUE U !((p43!=1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t15, t19, t31, t32, t34, t35, t36...300
(forward)formula 0,1,0.960183,38760,1,0,279,202860,131,132,1860,251436,222
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 112 transition count 110
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 112 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 111 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 111 transition count 109
Applied a total of 24 rules in 5 ms. Remains 111 /123 variables (removed 12) and now considering 109/121 (removed 12) transitions.
// Phase 1: matrix 109 rows 111 cols
[2024-05-28 06:11:21] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 06:11:21] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-28 06:11:21] [INFO ] Invariant cache hit.
[2024-05-28 06:11:21] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-28 06:11:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:11:21] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:11:21] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:11:21] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:11:21] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:11:21] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:11:21] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:11:21] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:11:21] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:11:21] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:11:22] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:11:22] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:11:22] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:11:22] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:11:22] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:11:22] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:11:22] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:11:22] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:11:22] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:11:22] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:11:22] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/220 variables, 111/150 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:11:22] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:11:22] [INFO ] Deduced a trap composed of 24 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:11:23] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:11:23] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:11:23] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:11:23] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:11:23] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:11:23] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:11:23] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:11:23] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:11:23] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:11:23] [INFO ] Deduced a trap composed of 21 places in 17 ms of which 0 ms to minimize.
[2024-05-28 06:11:23] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:11:23] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:11:24] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 3 ms to minimize.
[2024-05-28 06:11:24] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:11:24] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:11:24] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:11:25] [INFO ] Deduced a trap composed of 26 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (OVERLAPS) 0/220 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 183 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6041 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 53/72 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:11:27] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:11:27] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:11:27] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:11:27] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:11:28] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:11:28] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:11:28] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:11:28] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:11:28] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:11:28] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 109/220 variables, 111/193 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 108/301 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:11:29] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:11:29] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:11:29] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:11:30] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:11:30] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:11:30] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 6/307 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:11:31] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:11:31] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:11:31] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:11:31] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:11:31] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:11:31] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:11:32] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 7/314 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:11:33] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:11:34] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/220 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:11:36] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/220 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:11:38] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/220 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/220 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:11:42] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/220 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/220 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 19 (OVERLAPS) 0/220 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 319 constraints, problems are : Problem set: 0 solved, 108 unsolved in 20494 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 81/81 constraints]
After SMT, in 26547ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 26548ms
Starting structural reductions in LTL mode, iteration 1 : 111/123 places, 109/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26660 ms. Remains : 111/123 places, 109/121 transitions.
[2024-05-28 06:11:47] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:11:47] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:11:47] [INFO ] Input system was already deterministic with 109 transitions.
[2024-05-28 06:11:47] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:11:47] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:11:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality12834811853067222811.gal : 1 ms
[2024-05-28 06:11:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality11964688350349927501.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12834811853067222811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11964688350349927501.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.62234e+11,4.10776,132812,2,19749,5,428038,6,0,555,826159,0


Converting to forward existential form...Done !
original formula: EG(A(!(E(AG((p93==1)) U AF(((p18==0)||(p14==1))))) U AG((AX(((p44==0)||(p14==1))) + A((p75==0) U ((p51==0)||(p107==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(E(TRUE U !((!(EX(!(((p44==0)||(p14==1))))) + !((E(!(((p51==0)||(p107==1))) U (!((p75==0)) * ...634
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t2...357
Detected timeout of ITS tools.
[2024-05-28 06:12:17] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:12:17] [INFO ] Applying decomposition
[2024-05-28 06:12:17] [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/graph6173189773237097858.txt' '-o' '/tmp/graph6173189773237097858.bin' '-w' '/tmp/graph6173189773237097858.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6173189773237097858.bin' '-l' '-1' '-v' '-w' '/tmp/graph6173189773237097858.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:12:17] [INFO ] Decomposing Gal with order
[2024-05-28 06:12:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:12:17] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-28 06:12:17] [INFO ] Flatten gal took : 20 ms
[2024-05-28 06:12:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 06:12:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality12984828673657151986.gal : 2 ms
[2024-05-28 06:12:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality14647744790279410382.ctl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12984828673657151986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14647744790279410382.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.62234e+11,0.839686,33088,1184,52,57724,223,360,106229,47,1336,0


Converting to forward existential form...Done !
original formula: EG(A(!(E(AG((i8.u32.p93==1)) U AF(((i1.i1.u8.p18==0)||(i1.i0.u6.p14==1))))) U AG((AX(((i3.u16.p44==0)||(i1.i0.u6.p14==1))) + A((i6.u27.p7...203
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(E(TRUE U !((!(EX(!(((i3.u16.p44==0)||(i1.i0.u6.p14==1))))) + !((E(!(((i3.u16.p51==0)||(i9.u3...854
Reverse transition relation is NOT exact ! Due to transitions t39, t41, t43, t65, t67, i0.i0.u1.t73, i1.t69, i1.i0.u6.t72, i1.i1.u7.t71, i2.i0.u10.t68, i2....640
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 122 transition count 113
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 115 transition count 113
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 14 place count 115 transition count 102
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 36 place count 104 transition count 102
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 44 place count 96 transition count 94
Iterating global reduction 2 with 8 rules applied. Total rules applied 52 place count 96 transition count 94
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 52 place count 96 transition count 91
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 58 place count 93 transition count 91
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 114 place count 65 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 63 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 62 transition count 61
Applied a total of 117 rules in 22 ms. Remains 62 /123 variables (removed 61) and now considering 61/121 (removed 60) transitions.
// Phase 1: matrix 61 rows 62 cols
[2024-05-28 06:12:48] [INFO ] Computed 18 invariants in 1 ms
[2024-05-28 06:12:48] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-28 06:12:48] [INFO ] Invariant cache hit.
[2024-05-28 06:12:48] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-28 06:12:48] [INFO ] Redundant transitions in 12 ms returned [60]
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 57 sub problems to find dead transitions.
// Phase 1: matrix 60 rows 62 cols
[2024-05-28 06:12:48] [INFO ] Computed 18 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 3/62 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 06:12:48] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:12:48] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:12:48] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-28 06:12:48] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:12:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:12:48] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:12:48] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:12:48] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 06:12:48] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 60/122 variables, 62/89 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 06:12:49] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:12:49] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:12:49] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 92 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1332 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 3/62 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 60/122 variables, 62/92 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 57/149 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 06:12:49] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:12:49] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:12:49] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-28 06:12:50] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/122 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 12 (OVERLAPS) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 153 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1781 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 16/16 constraints]
After SMT, in 3123ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 3124ms
Starting structural reductions in SI_CTL mode, iteration 1 : 62/123 places, 60/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 3263 ms. Remains : 62/123 places, 60/121 transitions.
[2024-05-28 06:12:51] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:12:51] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:12:51] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-28 06:12:51] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:12:51] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:12:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality10969018964889354432.gal : 1 ms
[2024-05-28 06:12:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality863968138099639202.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10969018964889354432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality863968138099639202.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.09702e+07,0.484526,22656,2,3084,5,64751,6,0,308,131774,0


Converting to forward existential form...Done !
original formula: AG(AF(((!(A(EG((p74==1)) U AF(((p54==0)||(p17==1))))) * (AF(((p28==0)||(p48==1))) + ((p32==0)&&(p11==1)))) * ((((p38==0)&&(p57==1))&&(p3=...198
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!(!((E(!(!(EG(!(((p54==0)||(p17==1)))))) U (!(EG((p74==1))) * !(!(EG(!(((p54==0)||(p17...351
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t15, t16, t18, t19, t20, t22, t23, t2...321
Detected timeout of ITS tools.
[2024-05-28 06:13:21] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:13:21] [INFO ] Applying decomposition
[2024-05-28 06:13:21] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1946696573170809827.txt' '-o' '/tmp/graph1946696573170809827.bin' '-w' '/tmp/graph1946696573170809827.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1946696573170809827.bin' '-l' '-1' '-v' '-w' '/tmp/graph1946696573170809827.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:13:21] [INFO ] Decomposing Gal with order
[2024-05-28 06:13:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:13:21] [INFO ] Removed a total of 35 redundant transitions.
[2024-05-28 06:13:21] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:13:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 1 ms.
[2024-05-28 06:13:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality3535178950035866520.gal : 1 ms
[2024-05-28 06:13:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality13863977508359053121.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3535178950035866520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13863977508359053121.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.09702e+07,0.373598,17760,533,49,26007,173,217,45619,47,997,0


Converting to forward existential form...Done !
original formula: AG(AF(((!(A(EG((i6.u14.p74==1)) U AF(((i3.u12.p54==0)||(i1.i0.u3.p17==1))))) * (AF(((i1.i0.u7.p28==0)||(i2.u11.p48==1))) + ((i0.u9.p32==0...292
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!(!((E(!(!(EG(!(((i3.u12.p54==0)||(i1.i0.u3.p17==1)))))) U (!(EG((i6.u14.p74==1))) * !...477
Reverse transition relation is NOT exact ! Due to transitions t35, t40, t41, t46, t47, t55, t57, t58, i0.t43, i0.u8.t22, i0.u9.t1, i0.u9.t2, i0.u9.t3, i1.i...475
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,8.07168,287832,1,0,547675,337,1156,721489,208,1287,511550
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 111 transition count 109
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 111 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 110 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 110 transition count 108
Applied a total of 26 rules in 3 ms. Remains 110 /123 variables (removed 13) and now considering 108/121 (removed 13) transitions.
// Phase 1: matrix 108 rows 110 cols
[2024-05-28 06:13:29] [INFO ] Computed 19 invariants in 3 ms
[2024-05-28 06:13:29] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-28 06:13:29] [INFO ] Invariant cache hit.
[2024-05-28 06:13:29] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-28 06:13:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:13:30] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:13:31] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:13:31] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:13:31] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:13:31] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:13:31] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:13:31] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:13:31] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:13:31] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:13:31] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:13:31] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:13:31] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:13:32] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 108/218 variables, 110/162 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:13:32] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:13:32] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:13:33] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/218 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:13:34] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:13:34] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:13:34] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:13:34] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:13:34] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:13:35] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:13:35] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:13:35] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/218 variables, 3/173 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:13:36] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:13:36] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:13:36] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:13:36] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:13:36] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:13:36] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:13:36] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:13:36] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:13:36] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:13:36] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:13:36] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:13:36] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 12/185 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:13:37] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:13:37] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/218 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/218 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:13:38] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:13:38] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:13:38] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/218 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:13:39] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:13:39] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:13:39] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/218 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:13:39] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/218 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/218 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 22 (OVERLAPS) 0/218 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 194 constraints, problems are : Problem set: 0 solved, 107 unsolved in 11589 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 65/84 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/218 variables, 110/194 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 107/301 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:13:42] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:13:42] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:13:42] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:13:42] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:13:42] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:13:42] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 6/307 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:13:43] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:13:44] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-28 06:13:44] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:13:44] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:13:44] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:13:44] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 6/313 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:13:45] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-28 06:13:45] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:13:46] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:13:46] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:13:46] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 5/318 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:13:47] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:13:47] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:13:47] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:13:47] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/218 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 322 constraints, problems are : Problem set: 0 solved, 107 unsolved in 11064 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 86/86 constraints]
After SMT, in 22668ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 22670ms
Starting structural reductions in LTL mode, iteration 1 : 110/123 places, 108/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22804 ms. Remains : 110/123 places, 108/121 transitions.
[2024-05-28 06:13:52] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:13:52] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:13:52] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-28 06:13:52] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:13:52] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:13:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality5031140099219769049.gal : 1 ms
[2024-05-28 06:13:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality3740865455415921867.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5031140099219769049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3740865455415921867.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44199e+11,5.95327,171448,2,12688,5,485783,6,0,550,1.17413e+06,0


Converting to forward existential form...Done !
original formula: AX(EF(EX((((p49==0)&&(p39==1))&&(((p69==0)&&(p93==1))||((p27==0)&&(p72==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U EX((((p49==0)&&(p39==1))&&(((p69==0)&&(p93==1))||((p27==0)&&(p72==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t24, t2...357
(forward)formula 0,1,12.5915,267188,1,0,289,1.27611e+06,237,129,3479,1.74155e+06,264
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 122 transition count 109
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 111 transition count 109
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 22 place count 111 transition count 98
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 100 transition count 98
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 58 place count 86 transition count 84
Iterating global reduction 2 with 14 rules applied. Total rules applied 72 place count 86 transition count 84
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 72 place count 86 transition count 78
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 84 place count 80 transition count 78
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 140 place count 52 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 50 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 143 place count 49 transition count 48
Applied a total of 143 rules in 12 ms. Remains 49 /123 variables (removed 74) and now considering 48/121 (removed 73) transitions.
// Phase 1: matrix 48 rows 49 cols
[2024-05-28 06:14:04] [INFO ] Computed 18 invariants in 1 ms
[2024-05-28 06:14:05] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-28 06:14:05] [INFO ] Invariant cache hit.
[2024-05-28 06:14:05] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-28 06:14:05] [INFO ] Redundant transitions in 13 ms returned [47]
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 46 sub problems to find dead transitions.
// Phase 1: matrix 47 rows 49 cols
[2024-05-28 06:14:05] [INFO ] Computed 18 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-28 06:14:05] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:14:05] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:14:05] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:14:05] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-28 06:14:05] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-05-28 06:14:05] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 47/96 variables, 49/73 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-28 06:14:05] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:14:05] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:14:05] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-28 06:14:05] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:14:05] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-28 06:14:05] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 79 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1037 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 47/96 variables, 49/79 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 46/125 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-28 06:14:06] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:14:06] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/96 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 127 constraints, problems are : Problem set: 0 solved, 46 unsolved in 788 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 14/14 constraints]
After SMT, in 1834ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1836ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/123 places, 47/121 transitions.
Applied a total of 0 rules in 4 ms. Remains 49 /49 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1957 ms. Remains : 49/123 places, 47/121 transitions.
[2024-05-28 06:14:06] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:14:06] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:14:06] [INFO ] Input system was already deterministic with 47 transitions.
[2024-05-28 06:14:06] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:14:06] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:14:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality10024987436907665216.gal : 0 ms
[2024-05-28 06:14:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality16854717465627902646.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10024987436907665216.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16854717465627902646.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.63226e+07,0.264997,14668,2,1426,5,41832,6,0,246,76904,0


Converting to forward existential form...Done !
original formula: AF(EG((p47==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG((p47==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t28, t29, t30, t31, t32, t33, t34...290
(forward)formula 0,0,4.75501,169192,1,0,518,955727,118,197,1743,1.39005e+06,572
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 112 transition count 110
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 112 transition count 110
Applied a total of 22 rules in 2 ms. Remains 112 /123 variables (removed 11) and now considering 110/121 (removed 11) transitions.
// Phase 1: matrix 110 rows 112 cols
[2024-05-28 06:14:11] [INFO ] Computed 19 invariants in 2 ms
[2024-05-28 06:14:11] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-28 06:14:11] [INFO ] Invariant cache hit.
[2024-05-28 06:14:11] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-28 06:14:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:14:12] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:14:12] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:14:12] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:14:12] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:14:12] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:14:12] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:14:12] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:14:12] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:14:12] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:14:12] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:14:12] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:14:12] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:14:12] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:14:12] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:14:12] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:14:12] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:14:13] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:14:13] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:14:13] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:14:13] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:14:13] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:14:13] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:14:13] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:14:13] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:14:13] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:14:14] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:14:14] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:14:14] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:14:14] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 110/222 variables, 112/160 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:14:15] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:14:15] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:14:15] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:14:15] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:14:15] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:14:15] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 6/166 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:14:15] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 06:14:15] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:14:15] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:14:15] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:14:16] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:14:16] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:14:17] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/222 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 173 constraints, problems are : Problem set: 0 solved, 109 unsolved in 6584 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 42/61 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:14:18] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:14:18] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 110/222 variables, 112/175 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 109/284 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:14:19] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:14:19] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:14:19] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:14:19] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:14:20] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:14:20] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:14:20] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:14:20] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 8/292 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:14:21] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:14:22] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:14:22] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:14:22] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:14:22] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:14:22] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-28 06:14:22] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:14:22] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 8/300 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:14:23] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:14:23] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:14:23] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:14:24] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-28 06:14:24] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 5/305 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:14:25] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-28 06:14:25] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:14:25] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:14:25] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:14:25] [INFO ] Deduced a trap composed of 35 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:14:25] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:14:25] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:14:25] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:14:26] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:14:26] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 10/315 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:14:27] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-28 06:14:27] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:14:27] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:14:28] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 4/319 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:14:30] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:14:30] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:14:30] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:14:30] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:14:31] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/222 variables, 5/324 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:14:33] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:14:33] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:14:33] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:14:33] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:14:33] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:14:34] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 6/330 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:14:35] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/222 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:14:37] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:14:37] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:14:37] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/222 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/222 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 18 (OVERLAPS) 0/222 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 334 constraints, problems are : Problem set: 0 solved, 109 unsolved in 25232 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 94/94 constraints]
After SMT, in 31830ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 31832ms
Starting structural reductions in LTL mode, iteration 1 : 112/123 places, 110/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31961 ms. Remains : 112/123 places, 110/121 transitions.
[2024-05-28 06:14:43] [INFO ] Flatten gal took : 9 ms
[2024-05-28 06:14:43] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:14:43] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-28 06:14:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:14:43] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:14:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality6146858653699774240.gal : 1 ms
[2024-05-28 06:14:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality11031372283844515713.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6146858653699774240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11031372283844515713.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46283e+11,5.1864,145604,2,31018,5,447820,6,0,560,907187,0


Converting to forward existential form...Done !
original formula: AG(EF((((p61==0)||(p75==1)) + (EG(EX(((p99==0)||(p106==1)))) * ((EG((p66==0)) + E((p70==1) U ((p3==0)||(p105==1)))) + ((p107==0)||(p97==1...162
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((p61==0)||(p75==1)) + (EG(EX(((p99==0)||(p106==1)))) * ((EG((p66==0)) + E((p70=...222
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t24, t2...367
Detected timeout of ITS tools.
[2024-05-28 06:15:13] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:15:13] [INFO ] Applying decomposition
[2024-05-28 06:15:13] [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/graph6531896497588412975.txt' '-o' '/tmp/graph6531896497588412975.bin' '-w' '/tmp/graph6531896497588412975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6531896497588412975.bin' '-l' '-1' '-v' '-w' '/tmp/graph6531896497588412975.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:15:13] [INFO ] Decomposing Gal with order
[2024-05-28 06:15:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:15:13] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-28 06:15:13] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:15:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 06:15:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality1472422776079237274.gal : 2 ms
[2024-05-28 06:15:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality6819353455173630286.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1472422776079237274.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6819353455173630286.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46283e+11,1.27038,44192,1799,47,72690,195,363,144181,51,767,0


Converting to forward existential form...Done !
original formula: AG(EF((((i4.u20.p61==0)||(i7.u26.p75==1)) + (EG(EX(((i6.i0.u34.p99==0)||(i10.u36.p106==1)))) * ((EG((i6.i0.u22.p66==0)) + E((i6.i1.u24.p7...243
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i4.u20.p61==0)||(i7.u26.p75==1)) + (EG(EX(((i6.i0.u34.p99==0)||(i10.u36.p106==...303
Reverse transition relation is NOT exact ! Due to transitions t40, t42, t44, t65, t67, t69, i0.i1.u5.t72, i1.u6.t71, i2.i0.u9.t68, i2.i0.u12.t1, i2.i0.u12....681
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 112 transition count 110
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 112 transition count 110
Applied a total of 22 rules in 9 ms. Remains 112 /123 variables (removed 11) and now considering 110/121 (removed 11) transitions.
// Phase 1: matrix 110 rows 112 cols
[2024-05-28 06:15:43] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 06:15:43] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-28 06:15:43] [INFO ] Invariant cache hit.
[2024-05-28 06:15:44] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-28 06:15:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:15:44] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:15:44] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:15:44] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:15:44] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:15:44] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:15:44] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:15:44] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:15:44] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:15:44] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:15:44] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:15:45] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:15:45] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:15:45] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:15:45] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:15:45] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:15:45] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:15:45] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:15:45] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:15:45] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:15:45] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:15:45] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:15:45] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:15:45] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:15:45] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:15:46] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:15:46] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:15:46] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/222 variables, 112/158 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:15:46] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:15:47] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-28 06:15:47] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:15:47] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-28 06:15:47] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:15:47] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:15:47] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:15:47] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:15:47] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:15:47] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 10/168 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:15:47] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:15:47] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:15:47] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:15:47] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:15:48] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:15:48] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:15:49] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:15:49] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:15:49] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:15:50] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:15:50] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:15:50] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 15 (OVERLAPS) 0/222 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 180 constraints, problems are : Problem set: 0 solved, 109 unsolved in 8170 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/222 variables, 112/180 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 109/289 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:15:53] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:15:53] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:15:53] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:15:53] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:15:53] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:15:53] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:15:53] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:15:53] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:15:53] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:15:53] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:15:54] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:15:54] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:15:54] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 13/302 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:15:55] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:15:55] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:15:55] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:15:55] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:15:55] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:15:55] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:15:55] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 7/309 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:15:57] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:15:57] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:15:58] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:15:58] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:15:58] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:15:58] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:15:58] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:15:59] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 6/317 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:16:00] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:16:00] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:16:00] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:16:02] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-28 06:16:02] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:16:03] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-28 06:16:04] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 324 constraints, problems are : Problem set: 0 solved, 109 unsolved in 17162 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 84/84 constraints]
After SMT, in 25346ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 25347ms
Starting structural reductions in LTL mode, iteration 1 : 112/123 places, 110/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25489 ms. Remains : 112/123 places, 110/121 transitions.
[2024-05-28 06:16:09] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:16:09] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:16:09] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-28 06:16:09] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:16:09] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:16:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality6090341687057262402.gal : 1 ms
[2024-05-28 06:16:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality1697174590488120721.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6090341687057262402.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1697174590488120721.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41939e+11,5.54264,164652,2,32774,5,512081,6,0,560,1.04317e+06,0


Converting to forward existential form...Done !
original formula: A(EX(AX(((p87==1)&&((p55==0)||(p57==1))))) U A(!(EF(EX(TRUE))) U EG(E(((p96==0)||(p38==1)) U (p89!=0)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(EG(E(((p96==0)||(p38==1)) U (p89!=0)))) U (!(!(E(TRUE U EX(TRUE)))) * !(EG(E(((p96==0)||...657
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t12, t13, t14, t15, t16, t17, t18, t19, t20, t24, t2...362
Detected timeout of ITS tools.
[2024-05-28 06:16:39] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:16:39] [INFO ] Applying decomposition
[2024-05-28 06:16:39] [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/graph5301760587997548210.txt' '-o' '/tmp/graph5301760587997548210.bin' '-w' '/tmp/graph5301760587997548210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5301760587997548210.bin' '-l' '-1' '-v' '-w' '/tmp/graph5301760587997548210.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:16:39] [INFO ] Decomposing Gal with order
[2024-05-28 06:16:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:16:39] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-28 06:16:39] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:16:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 06:16:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality2487382661849821279.gal : 2 ms
[2024-05-28 06:16:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality10371558199743687403.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2487382661849821279.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10371558199743687403.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.41939e+11,2.31861,63736,2212,49,105762,239,376,198518,52,962,0


Converting to forward existential form...Done !
original formula: A(EX(AX(((i5.i0.u31.p87==1)&&((i4.u20.p55==0)||(i4.u20.p57==1))))) U A(!(EF(EX(TRUE))) U EG(E(((i8.u33.p96==0)||(i2.i1.u12.p38==1)) U (i8...171
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(EG(E(((i8.u33.p96==0)||(i2.i1.u12.p38==1)) U (i8.u33.p89!=0)))) U (!(!(E(TRUE U EX(TRUE)...897
Reverse transition relation is NOT exact ! Due to transitions t39, t41, t43, t65, t67, i0.i0.u1.t73, i1.t69, i1.i0.u6.t72, i1.i1.u7.t71, i2.i0.u10.t68, i2....669
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 113 transition count 111
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 113 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 112 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 112 transition count 110
Applied a total of 22 rules in 8 ms. Remains 112 /123 variables (removed 11) and now considering 110/121 (removed 11) transitions.
// Phase 1: matrix 110 rows 112 cols
[2024-05-28 06:17:09] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 06:17:09] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-28 06:17:09] [INFO ] Invariant cache hit.
[2024-05-28 06:17:09] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-28 06:17:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:17:10] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:17:11] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:17:11] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:17:11] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:17:11] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:17:11] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:17:11] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:17:11] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:17:11] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:17:11] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:17:12] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:17:12] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:17:12] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:17:12] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:17:12] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:17:13] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:17:13] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:17:13] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:17:13] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 110/222 variables, 112/171 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:17:14] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:17:14] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:17:14] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:17:14] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-28 06:17:14] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:17:14] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:17:14] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:17:14] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:17:14] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:17:14] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:17:14] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:17:15] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 5/183 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:17:15] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:17:16] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:17:16] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:17:16] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/222 variables, 3/187 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:17:16] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:17:16] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/222 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:17:17] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:17:17] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/222 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/222 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 18 (OVERLAPS) 0/222 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 191 constraints, problems are : Problem set: 0 solved, 109 unsolved in 9151 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 60/79 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:17:19] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:17:19] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:17:19] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:17:19] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:17:19] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:17:19] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/222 variables, 112/197 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 109/306 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:17:20] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:17:20] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:17:21] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:17:21] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:17:21] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:17:21] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-05-28 06:17:21] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:17:21] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:17:21] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:17:21] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 10/316 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:17:22] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:17:22] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:17:23] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 3/319 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:17:24] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:17:24] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-28 06:17:26] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:17:26] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 323 constraints, problems are : Problem set: 0 solved, 109 unsolved in 12617 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 83/83 constraints]
After SMT, in 21784ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 21785ms
Starting structural reductions in LTL mode, iteration 1 : 112/123 places, 110/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21919 ms. Remains : 112/123 places, 110/121 transitions.
[2024-05-28 06:17:31] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:17:31] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:17:31] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-28 06:17:31] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:17:31] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:17:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality4527206928649794102.gal : 1 ms
[2024-05-28 06:17:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality13150406169060312137.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4527206928649794102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13150406169060312137.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44191e+11,5.4924,163868,2,14254,5,466586,6,0,560,1.11184e+06,0


Converting to forward existential form...Done !
original formula: AG(EX(((((p6==0)||(p28==1)) + (EX((((p103==0)&&(p23==1))||(p117==1))) + ((((p28==0)&&(p122==1)) * ((p95==0) * AX((p32==0)))) * ((p72==0)|...233
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((((p6==0)||(p28==1)) + (EX((((p103==0)&&(p23==1))||(p117==1))) + ((((p28==0)&&(p122==1...293
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t12, t13, t14, t15, t16, t17, t18, t19, t20, t25, t2...367
(forward)formula 0,0,11.5587,254032,1,0,293,1.19829e+06,248,130,3346,1.75768e+06,250
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 110 transition count 108
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 110 transition count 108
Applied a total of 26 rules in 1 ms. Remains 110 /123 variables (removed 13) and now considering 108/121 (removed 13) transitions.
// Phase 1: matrix 108 rows 110 cols
[2024-05-28 06:17:43] [INFO ] Computed 19 invariants in 2 ms
[2024-05-28 06:17:43] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-28 06:17:43] [INFO ] Invariant cache hit.
[2024-05-28 06:17:43] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-28 06:17:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:17:43] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:17:43] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:17:43] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:17:43] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:17:43] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:17:43] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:17:43] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:17:44] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:17:44] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:17:44] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:17:44] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 06:17:44] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:17:44] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:17:44] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:17:44] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:17:44] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:17:44] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:17:44] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:17:44] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:17:44] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:17:44] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:17:44] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:17:45] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:17:45] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 108/218 variables, 110/153 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:17:46] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:17:46] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:17:46] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:17:46] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:17:46] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:17:46] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:17:46] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:17:47] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:17:47] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:17:47] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:17:47] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:17:48] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:17:48] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:17:48] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:17:49] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:17:49] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:17:49] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:17:49] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:17:49] [INFO ] Deduced a trap composed of 23 places in 17 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/218 variables, 5/172 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:17:50] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:17:50] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/218 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/218 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:17:51] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:17:51] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-28 06:17:51] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:17:51] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/218 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:17:51] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/218 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/218 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 20 (OVERLAPS) 0/218 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 179 constraints, problems are : Problem set: 0 solved, 107 unsolved in 9999 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 50/69 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:17:53] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:17:53] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/218 variables, 110/181 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 107/288 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:17:54] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:17:54] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:17:56] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:17:56] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:17:56] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:17:56] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:17:57] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 5/295 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:17:58] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:17:58] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-28 06:17:58] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:18:00] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:18:00] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:18:01] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-28 06:18:01] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:18:02] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:18:03] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:18:05] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:18:05] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:18:06] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:18:06] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:18:06] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:18:06] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 4/310 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:18:08] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:18:09] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/218 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/218 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 18 (OVERLAPS) 0/218 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 312 constraints, problems are : Problem set: 0 solved, 107 unsolved in 20698 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 76/76 constraints]
After SMT, in 30709ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 30714ms
Starting structural reductions in LTL mode, iteration 1 : 110/123 places, 108/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30831 ms. Remains : 110/123 places, 108/121 transitions.
[2024-05-28 06:18:13] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:18:13] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:18:13] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-28 06:18:13] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:18:13] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:18:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality15682139636876303219.gal : 1 ms
[2024-05-28 06:18:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality11992893512753433920.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15682139636876303219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11992893512753433920.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.29617e+11,5.06427,148164,2,29788,5,454390,6,0,550,937626,0


Converting to forward existential form...Done !
original formula: EF(AG((AX((p78==1)) * (EG(((p89==0)&&(p120==1))) + ((p1==0)&&(p66==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EX(!((p78==1)))) * (EG(((p89==0)&&(p120==1))) + ((p1==0)&&(p66==1))))))))] !...162
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t15, t16, t17, t18, t19, t23, t28, t3...352
Detected timeout of ITS tools.
[2024-05-28 06:18:44] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:18:44] [INFO ] Applying decomposition
[2024-05-28 06:18:44] [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/graph7568343771415051648.txt' '-o' '/tmp/graph7568343771415051648.bin' '-w' '/tmp/graph7568343771415051648.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7568343771415051648.bin' '-l' '-1' '-v' '-w' '/tmp/graph7568343771415051648.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:18:44] [INFO ] Decomposing Gal with order
[2024-05-28 06:18:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:18:44] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-28 06:18:44] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:18:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 06:18:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality7025930085162590037.gal : 1 ms
[2024-05-28 06:18:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality7377667343074678143.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7025930085162590037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7377667343074678143.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.29617e+11,0.976025,36196,1577,38,58632,177,349,122589,44,624,0


Converting to forward existential form...Done !
original formula: EF(AG((AX((i6.u26.p78==1)) * (EG(((i7.u32.p89==0)&&(i9.i0.u39.p120==1))) + ((i0.u0.p1==0)&&(i8.u21.p66==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EX(!((i6.u26.p78==1)))) * (EG(((i7.u32.p89==0)&&(i9.i0.u39.p120==1))) + ((i0...199
Reverse transition relation is NOT exact ! Due to transitions t38, t40, t42, t63, t65, i0.u1.t71, i1.i0.u9.t66, i1.i0.u12.t1, i1.i0.u12.t2, i1.i0.u12.t3, i...621
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 109 transition count 107
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 109 transition count 107
Applied a total of 28 rules in 1 ms. Remains 109 /123 variables (removed 14) and now considering 107/121 (removed 14) transitions.
// Phase 1: matrix 107 rows 109 cols
[2024-05-28 06:19:14] [INFO ] Computed 19 invariants in 3 ms
[2024-05-28 06:19:14] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-28 06:19:14] [INFO ] Invariant cache hit.
[2024-05-28 06:19:14] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-05-28 06:19:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:14] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
[2024-05-28 06:19:14] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:19:14] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:19:14] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:19:14] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:19:14] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:19:14] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:19:14] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:19:14] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:19:15] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:19:15] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:19:15] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:19:15] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:19:15] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:19:15] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:19:15] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:19:15] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:19:15] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:19:15] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:19:15] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:15] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-28 06:19:15] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:19:15] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:19:15] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:19:15] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:19:15] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:16] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:19:16] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:16] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:19:16] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:19:16] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:19:16] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 107/216 variables, 109/160 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:17] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:19:17] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:17] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:19:17] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:19:17] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:19:17] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:19:17] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 5/167 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:18] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:18] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:19:18] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:19:18] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:19:18] [INFO ] Deduced a trap composed of 19 places in 15 ms of which 0 ms to minimize.
[2024-05-28 06:19:19] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:19:19] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 6/174 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:19] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:19:19] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:19:19] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:19:19] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:20] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:19:20] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:20] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 16 (OVERLAPS) 0/216 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 181 constraints, problems are : Problem set: 0 solved, 106 unsolved in 7701 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 53/72 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:22] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/216 variables, 109/182 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 106/288 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:23] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-28 06:19:23] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:19:23] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:19:23] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:24] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-28 06:19:24] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:25] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-28 06:19:26] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:19:26] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:19:26] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:27] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:19:27] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:29] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:30] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:19:30] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:19:31] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:19:31] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:19:31] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 5/306 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:33] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/216 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:35] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-28 06:19:35] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:19:35] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:19:35] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2024-05-28 06:19:35] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-28 06:19:35] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:19:35] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 7/314 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:37] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:19:38] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:19:39] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/216 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 19 (OVERLAPS) 0/216 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 317 constraints, problems are : Problem set: 0 solved, 106 unsolved in 22450 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 83/83 constraints]
After SMT, in 30163ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 30165ms
Starting structural reductions in LTL mode, iteration 1 : 109/123 places, 107/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30274 ms. Remains : 109/123 places, 107/121 transitions.
[2024-05-28 06:19:44] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:19:44] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:19:44] [INFO ] Input system was already deterministic with 107 transitions.
[2024-05-28 06:19:44] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:19:44] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:19:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality13296177604823796985.gal : 1 ms
[2024-05-28 06:19:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality3985824311489262672.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13296177604823796985.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3985824311489262672.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28701e+11,5.38098,158316,2,31644,5,512093,6,0,545,993132,0


Converting to forward existential form...Done !
original formula: AG(((EX(EF(((p108==0)&&(p88==1)))) + AF((p16==1))) + ((p12==0)||((p80==0)&&(p26==1)))))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !(((p12==0)||((p80==0)&&(p26==1))))) * !(EX(E(TRUE U ((p108==0)&&(p88==1)))))),!((p16=...169
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t15, t16, t17, t18, t19, t23, t28, t3...352
Detected timeout of ITS tools.
[2024-05-28 06:20:14] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:20:14] [INFO ] Applying decomposition
[2024-05-28 06:20:14] [INFO ] Flatten gal took : 2 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/graph3959853404667875090.txt' '-o' '/tmp/graph3959853404667875090.bin' '-w' '/tmp/graph3959853404667875090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3959853404667875090.bin' '-l' '-1' '-v' '-w' '/tmp/graph3959853404667875090.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:20:14] [INFO ] Decomposing Gal with order
[2024-05-28 06:20:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:20:14] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-28 06:20:14] [INFO ] Flatten gal took : 10 ms
[2024-05-28 06:20:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 06:20:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality3370409192764422602.gal : 1 ms
[2024-05-28 06:20:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality5384768917420941388.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3370409192764422602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5384768917420941388.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28701e+11,1.21508,43620,1648,36,76071,155,330,130343,42,541,0


Converting to forward existential form...Done !
original formula: AG(((EX(EF(((i8.u36.p108==0)&&(i7.u31.p88==1)))) + AF((i2.u7.p16==1))) + ((i1.i1.u5.p12==0)||((i6.i0.u27.p80==0)&&(i4.i0.u11.p26==1)))))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !(((i1.i1.u5.p12==0)||((i6.i0.u27.p80==0)&&(i4.i0.u11.p26==1))))) * !(EX(E(TRUE U ((i8...218
Reverse transition relation is NOT exact ! Due to transitions t37, t39, t62, t64, t66, i0.u1.t70, i1.i1.u6.t69, i2.u7.t68, i3.i0.u10.t65, i3.i0.u13.t1, i3....625
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 111 transition count 109
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 111 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 110 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 110 transition count 108
Applied a total of 26 rules in 2 ms. Remains 110 /123 variables (removed 13) and now considering 108/121 (removed 13) transitions.
// Phase 1: matrix 108 rows 110 cols
[2024-05-28 06:20:44] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 06:20:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-28 06:20:44] [INFO ] Invariant cache hit.
[2024-05-28 06:20:44] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-28 06:20:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:45] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:20:45] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:20:45] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:20:45] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:20:45] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:20:45] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:20:45] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:20:45] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:20:45] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:20:45] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:20:45] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:20:45] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:20:45] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:20:45] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:20:45] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:20:45] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-05-28 06:20:45] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:46] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:20:46] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:20:46] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:20:46] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2024-05-28 06:20:46] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/218 variables, 110/151 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:46] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:20:46] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:20:46] [INFO ] Deduced a trap composed of 24 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:20:46] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:20:47] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:20:47] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:48] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:20:48] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/218 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:49] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/218 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:49] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:20:49] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:20:49] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:20:49] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:20:49] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:20:49] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 6/166 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:50] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:20:50] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:20:50] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:50] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:20:50] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:51] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/218 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:52] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/218 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/218 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:53] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/218 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:54] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:20:54] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:20:54] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:20:54] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/218 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:54] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/218 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/218 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 22 (OVERLAPS) 0/218 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 179 constraints, problems are : Problem set: 0 solved, 107 unsolved in 10987 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 50/69 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:56] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:20:56] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:56] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:20:56] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:20:56] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:20:56] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:56] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:57] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 108/218 variables, 110/187 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 107/294 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:58] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-28 06:20:58] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:20:58] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:21:00] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/218 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:21:02] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-05-28 06:21:02] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-28 06:21:02] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:21:02] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:21:03] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:21:03] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:21:03] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:21:04] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:21:04] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:21:05] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:21:05] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:21:05] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:21:06] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/218 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:21:08] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:21:08] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/218 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/218 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 19 (OVERLAPS) 0/218 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 313 constraints, problems are : Problem set: 0 solved, 107 unsolved in 17127 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 77/77 constraints]
After SMT, in 28125ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 28126ms
Starting structural reductions in LTL mode, iteration 1 : 110/123 places, 108/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28253 ms. Remains : 110/123 places, 108/121 transitions.
[2024-05-28 06:21:12] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:21:12] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:21:12] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-28 06:21:12] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:21:12] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:21:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality11628437963200829002.gal : 2 ms
[2024-05-28 06:21:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality17997495634621210893.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11628437963200829002.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17997495634621210893.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.43827e+11,4.84388,147212,2,10170,5,429810,6,0,550,996625,0


Converting to forward existential form...Done !
original formula: E((p91!=1) U EX((AF(AX((p79==0))) * !(((p55==0)||(p103==1))))))
=> equivalent forward existential formula: [((EY(FwdU(Init,(p91!=1))) * !(((p55==0)||(p103==1)))) * !(EG(!(!(EX(!((p79==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t24, t3...352
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-28 06:21:42] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:21:42] [INFO ] Applying decomposition
[2024-05-28 06:21:42] [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/graph835779163122039758.txt' '-o' '/tmp/graph835779163122039758.bin' '-w' '/tmp/graph835779163122039758.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph835779163122039758.bin' '-l' '-1' '-v' '-w' '/tmp/graph835779163122039758.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:21:42] [INFO ] Decomposing Gal with order
[2024-05-28 06:21:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:21:42] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-28 06:21:42] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:21:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 06:21:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality13421387760926649697.gal : 2 ms
[2024-05-28 06:21:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality12241718814953660674.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13421387760926649697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12241718814953660674.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.43827e+11,0.803544,31488,1012,54,50945,188,360,79223,47,931,0


Converting to forward existential form...Done !
original formula: E((i9.i1.u31.p91!=1) U EX((AF(AX((i8.u27.p79==0))) * !(((i4.u19.p55==0)||(i11.u35.p103==1))))))
=> equivalent forward existential formula: [((EY(FwdU(Init,(i9.i1.u31.p91!=1))) * !(((i4.u19.p55==0)||(i11.u35.p103==1)))) * !(EG(!(!(EX(!((i8.u27.p79==0))...171
Reverse transition relation is NOT exact ! Due to transitions t39, t43, t64, t66, t68, i0.i1.u5.t71, i1.u6.t70, i2.i0.u9.t67, i2.i0.u12.t1, i2.i0.u12.t2, i...642
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-28 06:22:13] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:22:13] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:22:13] [INFO ] Applying decomposition
[2024-05-28 06:22:13] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17968888177788640813.txt' '-o' '/tmp/graph17968888177788640813.bin' '-w' '/tmp/graph17968888177788640813.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17968888177788640813.bin' '-l' '-1' '-v' '-w' '/tmp/graph17968888177788640813.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:22:13] [INFO ] Decomposing Gal with order
[2024-05-28 06:22:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:22:13] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-28 06:22:13] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:22:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 06:22:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality9911209852976282696.gal : 1 ms
[2024-05-28 06:22:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality2858269505732910255.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9911209852976282696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2858269505732910255.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.58775e+11,1.32786,47372,2473,63,80123,336,351,144767,51,1369,0


Converting to forward existential form...Done !
original formula: EG(A(!(E(AG((i9.u33.p93==1)) U AF(((i2.u8.p18==0)||(i1.i1.u6.p14==1))))) U AG((AX(((i4.u18.p44==0)||(i1.i1.u6.p14==1))) + A((i7.u27.p75==...201
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(E(TRUE U !((!(EX(!(((i4.u18.p44==0)||(i1.i1.u6.p14==1))))) + !((E(!(((i4.u18.p51==0)||(i10.u...860
Reverse transition relation is NOT exact ! Due to transitions t47, t51, t76, t78, t80, i0.u1.t84, i0.u10.t79, i1.i0.u15.t69, i1.i0.u15.t70, i1.i1.u6.t83, i...778
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,156.56,2293432,1,0,3.95544e+06,629,1436,6.90488e+06,168,2061,2108294
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(EF((((i5.u21.p61==0)||(i7.u27.p75==1)) + (EG(EX(((i6.i2.u35.p99==0)||(i10.u36.p106==1)))) * ((EG((i6.i0.u23.p66==0)) + E((i6.i1.u25.p7...243
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i5.u21.p61==0)||(i7.u27.p75==1)) + (EG(EX(((i6.i2.u35.p99==0)||(i10.u36.p106==...303
(forward)formula 1,0,266.72,3534228,1,0,5.16663e+06,686,1110,1.12276e+07,138,2284,849107
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(EX(AX(((i8.u31.p87==1)&&((i5.u20.p55==0)||(i5.u20.p57==1))))) U A(!(EF(EX(TRUE))) U EG(E(((i9.u32.p96==0)||(i3.u14.p38==1)) U (i9.u32.p...165
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(EG(E(((i9.u32.p96==0)||(i3.u14.p38==1)) U (i9.u32.p89!=0)))) U (!(!(E(TRUE U EX(TRUE))))...867
(forward)formula 2,0,578.895,3910164,1,0,5.62209e+06,686,1018,1.12276e+07,131,2284,5685042
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(AG((AX((i7.u28.p78==1)) * (EG(((i9.u32.p89==0)&&(i11.u41.p120==1))) + ((i6.i0.u0.p1==0)&&(i6.i0.u23.p66==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EX(!((i7.u28.p78==1)))) * (EG(((i9.u32.p89==0)&&(i11.u41.p120==1))) + ((i6.i...203
(forward)formula 3,1,656.72,4302468,1,0,6.23062e+06,686,982,1.20789e+07,131,2284,1489722
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(((EX(EF(((i10.u36.p108==0)&&(i9.u34.p88==1)))) + AF((i2.u7.p16==1))) + ((i1.i1.u5.p12==0)||((i7.u29.p80==0)&&(i4.u11.p26==1)))))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !(((i1.i1.u5.p12==0)||((i7.u29.p80==0)&&(i4.u11.p26==1))))) * !(EX(E(TRUE U ((i10.u36....213
(forward)formula 4,1,657.913,4302468,1,0,6.23062e+06,686,1468,1.20789e+07,166,2284,1641081
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E((i9.u33.p91!=1) U EX((AF(AX((i7.u28.p79==0))) * !(((i5.u20.p55==0)||(i10.u37.p103==1))))))
=> equivalent forward existential formula: [((EY(FwdU(Init,(i9.u33.p91!=1))) * !(((i5.u20.p55==0)||(i10.u37.p103==1)))) * !(EG(!(!(EX(!((i7.u28.p79==0)))))...168
(forward)formula 5,1,708.375,4302468,1,0,6.23062e+06,690,1627,1.20789e+07,175,2284,3242059
FORMULA ShieldIIPs-PT-002B-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1525778 ms.

BK_STOP 1716878042025

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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-002B"
export BK_EXAMINATION="CTLCardinality"
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-002B, examination is CTLCardinality"
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-171683760200025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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