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-171683760200026.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760200026
=====================================================================

--------------------
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-CTLFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2023-12
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2023-13
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2023-14
FORMULA_NAME ShieldIIPs-PT-002B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716876523148

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
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
CTLFireability PT
Running Version 202405141337
[2024-05-28 06:08:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 06:08:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:08:44] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-05-28 06:08:44] [INFO ] Transformed 123 places.
[2024-05-28 06:08:44] [INFO ] Transformed 121 transitions.
[2024-05-28 06:08:44] [INFO ] Found NUPN structural information;
[2024-05-28 06:08:44] [INFO ] Parsed PT model containing 123 places and 121 transitions and 362 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 94 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 120
Applied a total of 2 rules in 23 ms. Remains 122 /123 variables (removed 1) and now considering 120/121 (removed 1) transitions.
// Phase 1: matrix 120 rows 122 cols
[2024-05-28 06:08:44] [INFO ] Computed 19 invariants in 15 ms
[2024-05-28 06:08:44] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-28 06:08:44] [INFO ] Invariant cache hit.
[2024-05-28 06:08:44] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-28 06:08:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:08:45] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 10 ms to minimize.
[2024-05-28 06:08:45] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:08:45] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 16 places in 16 ms of which 1 ms to minimize.
[2024-05-28 06:08:46] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:08:47] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:08:47] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:08:47] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:08:47] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:08:47] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:08:47] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:08:47] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-28 06:08:47] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:08:47] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:08:47] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 2 ms to minimize.
[2024-05-28 06:08:47] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 4 ms to minimize.
[2024-05-28 06:08:47] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:08:47] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:08:47] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:08:47] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:08:47] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:08:48] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:08:48] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:08:48] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:08:48] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:08:48] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:08:48] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:08:48] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:08:48] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:08:48] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:08:48] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:08:48] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:08:48] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:08:48] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:08:48] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:08:48] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:08:48] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:08:49] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 9 ms to minimize.
[2024-05-28 06:08:49] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:08:49] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:08:49] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:08:49] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:08:49] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:08:49] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-28 06:08:49] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:08:49] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:08:49] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:08:49] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:08:49] [INFO ] Deduced a trap composed of 26 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:08:49] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 7/95 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:08:50] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 2 ms to minimize.
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 16/111 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:08:51] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 120/242 variables, 122/235 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:08:52] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:08:54] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 2 ms to minimize.
[2024-05-28 06:08:54] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:08:54] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:08:54] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:08:54] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:08:54] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:08:54] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:08:54] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:08:54] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:08:54] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/242 variables, 10/246 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:08:55] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:08:55] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:08:55] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:08:55] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:08:55] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:08:55] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:08:55] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 7/253 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:08:56] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-28 06:08:56] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:08:56] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:08:56] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-28 06:08:56] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/242 variables, 5/258 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/242 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:08:57] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/242 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/242 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:08:59] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:08:59] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:08:59] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:08:59] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:08:59] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:08:59] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/242 variables, 6/265 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:09:00] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/242 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:09:00] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:09:01] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:09:01] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:09:01] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:09:01] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/242 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:09:01] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/242 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:09:02] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:09:02] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:09:02] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:09:02] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:09:02] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/242 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:09:03] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:09:03] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/242 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/242 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 27 (OVERLAPS) 0/242 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 279 constraints, problems are : Problem set: 0 solved, 119 unsolved in 20475 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 138/138 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 138/157 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:09:06] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:09:06] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:09:06] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:09:06] [INFO ] Deduced a trap composed of 31 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:09:06] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:09:06] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:09:06] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:09:06] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:09:06] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 5/166 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:09:07] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 120/242 variables, 122/289 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 119/408 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:09:08] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:09:08] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:09:10] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:09:11] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:09:11] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 2 ms to minimize.
[2024-05-28 06:09:11] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:09:11] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:09:11] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 6/416 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:09:13] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:09:13] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:09:14] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:09:14] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:09:14] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:09:14] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:09:14] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 7/423 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:09:16] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:09:17] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-28 06:09:17] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:09:17] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 4/427 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:09:20] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-28 06:09:20] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:09:20] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:09:20] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:09:20] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:09:20] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:09:20] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:09:20] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 8/435 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:09:24] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:09:27] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/242 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 06:09:32] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/242 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 438 constraints, problems are : Problem set: 0 solved, 119 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 178/178 constraints]
After SMT, in 50575ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 50597ms
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 120/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51007 ms. Remains : 122/123 places, 120/121 transitions.
Support contains 94 out of 122 places after structural reductions.
[2024-05-28 06:09:35] [INFO ] Flatten gal took : 29 ms
[2024-05-28 06:09:35] [INFO ] Flatten gal took : 16 ms
[2024-05-28 06:09:35] [INFO ] Input system was already deterministic with 120 transitions.
RANDOM walk for 40000 steps (114 resets) in 1147 ms. (34 steps per ms) remains 6/96 properties
BEST_FIRST walk for 40003 steps (29 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (29 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (22 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (16 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (21 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (19 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
[2024-05-28 06:09:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 1 (OVERLAPS) 104/122 variables, 19/19 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/19 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 120/242 variables, 122/141 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/141 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/242 variables, 0/141 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 141 constraints, problems are : Problem set: 5 solved, 1 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Problem AtomicPropp81 is UNSAT
After SMT solving in domain Int declared 122/242 variables, and 19 constraints, problems are : Problem set: 6 solved, 0 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 0/122 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 111ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA ShieldIIPs-PT-002B-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 06:09:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 06:09:36] [INFO ] Flatten gal took : 9 ms
FORMULA ShieldIIPs-PT-002B-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 06:09:36] [INFO ] Flatten gal took : 9 ms
[2024-05-28 06:09:36] [INFO ] Input system was already deterministic with 120 transitions.
Support contains 89 out of 122 places (down from 90) after GAL structural reductions.
Computed a total of 32 stabilizing places and 32 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 109 transition count 107
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 109 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 108 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 108 transition count 106
Applied a total of 28 rules in 11 ms. Remains 108 /122 variables (removed 14) and now considering 106/120 (removed 14) transitions.
// Phase 1: matrix 106 rows 108 cols
[2024-05-28 06:09:36] [INFO ] Computed 19 invariants in 3 ms
[2024-05-28 06:09:36] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-28 06:09:36] [INFO ] Invariant cache hit.
[2024-05-28 06:09:36] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-28 06:09:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 14 places in 22 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 1 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:09:37] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:38] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:09:38] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:38] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:38] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:09:38] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:09:39] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:39] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 106/214 variables, 108/153 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:39] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:09:40] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:09:40] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:09:40] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:09:40] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:09:40] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:09:40] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:41] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:09:41] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:41] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:42] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-28 06:09:42] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:09:42] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:09:42] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:09:42] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:09:42] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:09:42] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:09:42] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:09:42] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:09:42] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/214 variables, 10/173 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:43] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:09:43] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:09:43] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:09:43] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:09:43] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/214 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:44] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:09:44] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/214 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:44] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-28 06:09:44] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:09:44] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/214 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:45] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:09:45] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/214 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:45] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/214 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:46] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:09:46] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:09:46] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:09:46] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/214 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:47] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:09:47] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/214 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:47] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:09:47] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:09:47] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:09:47] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/214 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:48] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:09:48] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/214 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/214 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 25 (OVERLAPS) 0/214 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 198 constraints, problems are : Problem set: 0 solved, 105 unsolved in 12808 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 71/90 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:50] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/214 variables, 108/199 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 105/304 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:51] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:09:51] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:09:51] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:09:51] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:52] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:09:53] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:09:53] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:54] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:09:54] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-28 06:09:55] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:56] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:09:58] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-28 06:09:58] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (OVERLAPS) 0/214 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 317 constraints, problems are : Problem set: 0 solved, 105 unsolved in 13773 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 85/85 constraints]
After SMT, in 26596ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 26597ms
Starting structural reductions in LTL mode, iteration 1 : 108/122 places, 106/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26733 ms. Remains : 108/122 places, 106/120 transitions.
[2024-05-28 06:10:03] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:10:03] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:10:03] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-28 06:10:03] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:10:03] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:10:03] [INFO ] Time to serialize gal into /tmp/CTLFireability15161116500023774812.gal : 3 ms
[2024-05-28 06:10:03] [INFO ] Time to serialize properties into /tmp/CTLFireability12848630555775846910.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15161116500023774812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12848630555775846910.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.27785e+11,4.85127,143560,2,21275,5,460145,6,0,540,882909,0


Converting to forward existential form...Done !
original formula: EG(EF(AX((p60==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(EX(!((p60==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, t23, t28, t3...342
Detected timeout of ITS tools.
[2024-05-28 06:10:33] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:10:33] [INFO ] Applying decomposition
[2024-05-28 06:10:33] [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/graph17048788020183519844.txt' '-o' '/tmp/graph17048788020183519844.bin' '-w' '/tmp/graph17048788020183519844.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17048788020183519844.bin' '-l' '-1' '-v' '-w' '/tmp/graph17048788020183519844.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:10:33] [INFO ] Decomposing Gal with order
[2024-05-28 06:10:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:10:33] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-28 06:10:33] [INFO ] Flatten gal took : 45 ms
[2024-05-28 06:10:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 06:10:33] [INFO ] Time to serialize gal into /tmp/CTLFireability2374915469224477530.gal : 6 ms
[2024-05-28 06:10:33] [INFO ] Time to serialize properties into /tmp/CTLFireability8715079632781681164.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/CTLFireability2374915469224477530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8715079632781681164.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.27785e+11,1.78402,62072,1096,36,112880,190,357,175674,44,671,0


Converting to forward existential form...Done !
original formula: EG(EF(AX((i4.u19.p60==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(EX(!((i4.u19.p60==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t37, t39, t41, t62, t64, t66, i0.i1.u5.t69, i1.u6.t68, i2.i0.u10.t63, i2.i0.u16.t4, i2.i0.u16...601
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 122/122 places, 120/120 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 121 transition count 109
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 111 transition count 109
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 20 place count 111 transition count 100
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 38 place count 102 transition count 100
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 48 place count 92 transition count 90
Iterating global reduction 2 with 10 rules applied. Total rules applied 58 place count 92 transition count 90
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 58 place count 92 transition count 86
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 88 transition count 86
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 2 with 58 rules applied. Total rules applied 124 place count 59 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 57 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 127 place count 56 transition count 55
Applied a total of 127 rules in 36 ms. Remains 56 /122 variables (removed 66) and now considering 55/120 (removed 65) transitions.
// Phase 1: matrix 55 rows 56 cols
[2024-05-28 06:11:03] [INFO ] Computed 18 invariants in 7 ms
[2024-05-28 06:11:03] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-28 06:11:03] [INFO ] Invariant cache hit.
[2024-05-28 06:11:03] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-28 06:11:03] [INFO ] Redundant transitions in 20 ms returned [54]
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 51 sub problems to find dead transitions.
// Phase 1: matrix 54 rows 56 cols
[2024-05-28 06:11:03] [INFO ] Computed 18 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-28 06:11:04] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 2/56 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-28 06:11:04] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:11:04] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:11:04] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-05-28 06:11:04] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-05-28 06:11:04] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-05-28 06:11:04] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:11:04] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:11:04] [INFO ] Deduced a trap composed of 11 places in 14 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 8/27 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 54/110 variables, 56/83 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 83 constraints, problems are : Problem set: 0 solved, 51 unsolved in 977 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 2/56 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 54/110 variables, 56/83 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 51/134 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/110 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 134 constraints, problems are : Problem set: 0 solved, 51 unsolved in 785 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 9/9 constraints]
After SMT, in 1794ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 1797ms
Starting structural reductions in SI_CTL mode, iteration 1 : 56/122 places, 54/120 transitions.
Applied a total of 0 rules in 4 ms. Remains 56 /56 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1985 ms. Remains : 56/122 places, 54/120 transitions.
[2024-05-28 06:11:05] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:11:05] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:11:05] [INFO ] Input system was already deterministic with 54 transitions.
[2024-05-28 06:11:05] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:11:05] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:11:05] [INFO ] Time to serialize gal into /tmp/CTLFireability15780761914954078664.gal : 1 ms
[2024-05-28 06:11:05] [INFO ] Time to serialize properties into /tmp/CTLFireability8931711324492998921.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/CTLFireability15780761914954078664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8931711324492998921.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,5.833e+07,0.411194,19456,2,2387,5,59787,6,0,280,108921,0


Converting to forward existential form...Done !
original formula: EF((E((p99!=1) U AF((p107==1))) * (EF((p38==1)) + E((p37==1) U (((p28==1)&&(p47==1))&&(p61==1))))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * E((p99!=1) U !(EG(!((p107==1)))))),TRUE) * (p38==1))] != FALSE + [(FwdU((FwdU(Init,TR...252
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t17, t19, t36, t37, t38...305
Detected timeout of ITS tools.
[2024-05-28 06:11:35] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:11:35] [INFO ] Applying decomposition
[2024-05-28 06:11:35] [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/graph6969796506301400679.txt' '-o' '/tmp/graph6969796506301400679.bin' '-w' '/tmp/graph6969796506301400679.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6969796506301400679.bin' '-l' '-1' '-v' '-w' '/tmp/graph6969796506301400679.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:11:35] [INFO ] Decomposing Gal with order
[2024-05-28 06:11:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:11:35] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-28 06:11:35] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:11:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 6 ms.
[2024-05-28 06:11:35] [INFO ] Time to serialize gal into /tmp/CTLFireability232481283529293396.gal : 1 ms
[2024-05-28 06:11:35] [INFO ] Time to serialize properties into /tmp/CTLFireability4720076446975104079.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/CTLFireability232481283529293396.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4720076446975104079.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 -...261
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,5.833e+07,0.321773,15056,516,37,20967,85,199,42964,45,310,0


Converting to forward existential form...Done !
original formula: EF((E((i7.u18.p99!=1) U AF((i5.u19.p107==1))) * (EF((i2.u8.p38==1)) + E((i2.u6.p37==1) U (((i4.i1.u5.p28==1)&&(i1.u10.p47==1))&&(i4.i1.u1...169
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * E((i7.u18.p99!=1) U !(EG(!((i5.u19.p107==1)))))),TRUE) * (i2.u8.p38==1))] != FALSE + ...318
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t35, t37, t40, t41, t42, t48, t50, t52, i0.t36, i0.u7.t1, i0.u7.t2, i1.t28, i1.u10.t3...415
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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,11.5674,282328,1,0,437512,226,984,872939,190,693,442643
FORMULA ShieldIIPs-PT-002B-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 116 transition count 114
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 116 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 113
Applied a total of 14 rules in 8 ms. Remains 115 /122 variables (removed 7) and now considering 113/120 (removed 7) transitions.
// Phase 1: matrix 113 rows 115 cols
[2024-05-28 06:11:47] [INFO ] Computed 19 invariants in 3 ms
[2024-05-28 06:11:47] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-28 06:11:47] [INFO ] Invariant cache hit.
[2024-05-28 06:11:47] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-28 06:11:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 9 ms to minimize.
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 1 ms to minimize.
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:11:48] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:11:49] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2024-05-28 06:11:49] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:11:49] [INFO ] Deduced a trap composed of 21 places in 17 ms of which 0 ms to minimize.
[2024-05-28 06:11:49] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:11:49] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:11:49] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:11:49] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:11:49] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:11:49] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:11:49] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:11:49] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:11:50] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:11:50] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:11:50] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:11:50] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:11:50] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:11:50] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:11:50] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:11:50] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:11:50] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:11:50] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:11:50] [INFO ] Deduced a trap composed of 29 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:11:50] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:11:50] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:11:50] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:11:50] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 113/228 variables, 115/181 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:11:51] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:11:51] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:11:51] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:11:51] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:11:51] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:11:51] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:11:51] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:11:51] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:11:51] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:11:51] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:11:52] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:11:52] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:11:52] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:11:52] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:11:52] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 15/196 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:11:53] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:11:53] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:11:53] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:11:53] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:11:53] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:11:53] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:11:53] [INFO ] Deduced a trap composed of 29 places in 22 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/228 variables, 7/203 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:11:53] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:11:54] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:11:54] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:11:54] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:11:55] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:11:55] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:11:55] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:11:55] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:11:55] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:11:55] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-28 06:11:55] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:11:55] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 8/215 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:11:56] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:11:56] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:11:57] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:11:57] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:11:57] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/228 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:11:58] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/228 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/228 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:11:59] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:11:59] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:11:59] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/228 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:11:59] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:11:59] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/228 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:12:00] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/228 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/228 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:12:01] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:12:01] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/228 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:12:02] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:12:02] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:12:02] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:12:02] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/228 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/228 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:12:03] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
At refinement iteration 27 (OVERLAPS) 0/228 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/228 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:12:04] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:12:04] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:12:04] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 29 (OVERLAPS) 0/228 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/228 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 31 (OVERLAPS) 0/228 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 237 constraints, problems are : Problem set: 0 solved, 112 unsolved in 18956 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 103/103 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 103/122 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:12:07] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:12:07] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:12:07] [INFO ] Deduced a trap composed of 31 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:12:07] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:12:07] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:12:07] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:12:07] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:12:07] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 8/130 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/228 variables, 115/245 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 112/357 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:12:08] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:12:08] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:12:08] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:12:08] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 4/361 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:12:10] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-28 06:12:10] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:12:10] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:12:10] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:12:10] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:12:10] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:12:10] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:12:11] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:12:11] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:12:11] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:12:11] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:12:11] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:12:11] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 13/374 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:12:13] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:12:13] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:12:13] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:12:13] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-28 06:12:14] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 5/379 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:12:15] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:12:15] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:12:16] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:12:16] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:12:16] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 5/384 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:12:18] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:12:18] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:12:18] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:12:18] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 4/388 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:12:21] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:12:23] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:12:25] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:12:26] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:12:26] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 3/393 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 16 (OVERLAPS) 0/228 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 393 constraints, problems are : Problem set: 0 solved, 112 unsolved in 26827 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 147/147 constraints]
After SMT, in 45803ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 45805ms
Starting structural reductions in LTL mode, iteration 1 : 115/122 places, 113/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45920 ms. Remains : 115/122 places, 113/120 transitions.
[2024-05-28 06:12:33] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:12:33] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:12:33] [INFO ] Input system was already deterministic with 113 transitions.
[2024-05-28 06:12:33] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:12:33] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:12:33] [INFO ] Time to serialize gal into /tmp/CTLFireability12840769676820758950.gal : 1 ms
[2024-05-28 06:12:33] [INFO ] Time to serialize properties into /tmp/CTLFireability717191429205889856.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/CTLFireability12840769676820758950.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability717191429205889856.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.63613e+11,7.73554,181196,2,16046,5,503988,6,0,575,1.24935e+06,0


Converting to forward existential form...Done !
original formula: E(E((!(EG((p17==1))) * (((p38==1) + (E(((p2==1)&&(p45==1)) U (p96==1)) * ((p108==1)||(p105==1)))) + ((p121==1)&&(((p107==1)||(((p25==1)&&...715
=> equivalent forward existential formula: ((([(FwdU((FwdU(FwdU(Init,E((!(EG((p17==1))) * (((p38==1) + (E(((p2==1)&&(p45==1)) U (p96==1)) * ((p108==1)||(p1...2600
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, t21, t2...382
Detected timeout of ITS tools.
[2024-05-28 06:13:03] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:13:03] [INFO ] Applying decomposition
[2024-05-28 06:13:03] [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/graph10466772258415095793.txt' '-o' '/tmp/graph10466772258415095793.bin' '-w' '/tmp/graph10466772258415095793.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10466772258415095793.bin' '-l' '-1' '-v' '-w' '/tmp/graph10466772258415095793.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:13:03] [INFO ] Decomposing Gal with order
[2024-05-28 06:13:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:13:03] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-28 06:13:03] [INFO ] Flatten gal took : 10 ms
[2024-05-28 06:13:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 06:13:03] [INFO ] Time to serialize gal into /tmp/CTLFireability10676307887358155149.gal : 2 ms
[2024-05-28 06:13:03] [INFO ] Time to serialize properties into /tmp/CTLFireability7100194682463447622.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/CTLFireability10676307887358155149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7100194682463447622.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.63613e+11,2.7803,69544,1422,48,106441,280,366,264413,51,1250,0


Converting to forward existential form...Done !
original formula: E(E((!(EG((i1.i2.u7.p17==1))) * (((i3.u12.p38==1) + (E(((i0.i0.u1.p2==1)&&(i4.i0.u17.p45==1)) U (i7.u33.p96==1)) * ((i8.i0.u37.p108==1)||...1135
=> equivalent forward existential formula: ((([(FwdU((FwdU(FwdU(Init,E((!(EG((i1.i2.u7.p17==1))) * (((i3.u12.p38==1) + (E(((i0.i0.u1.p2==1)&&(i4.i0.u17.p45...3934
Reverse transition relation is NOT exact ! Due to transitions t42, t44, t46, t69, t71, i0.i0.u1.t77, i0.i1.t54, i0.i1.u21.t57, i1.t73, i1.i1.u6.t76, i1.i2....709
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 122/122 places, 120/120 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 110 transition count 108
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 110 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 109 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 109 transition count 107
Applied a total of 26 rules in 38 ms. Remains 109 /122 variables (removed 13) and now considering 107/120 (removed 13) transitions.
// Phase 1: matrix 107 rows 109 cols
[2024-05-28 06:13:33] [INFO ] Computed 19 invariants in 2 ms
[2024-05-28 06:13:33] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-28 06:13:33] [INFO ] Invariant cache hit.
[2024-05-28 06:13:33] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-05-28 06:13:33] [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:13:34] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-05-28 06:13:34] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-28 06:13:34] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:13:34] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:13:34] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:13:34] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 06:13:34] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:13:34] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-28 06:13:34] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-28 06:13:34] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:13:34] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:13:34] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:13:34] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:13:34] [INFO ] Deduced a trap composed of 18 places in 34 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 0 ms to minimize.
[2024-05-28 06:13:35] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:13:35] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:13:35] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:13:35] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:13:35] [INFO ] Deduced a trap composed of 23 places in 36 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:13:35] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:13:35] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:13:35] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:13:35] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:13:35] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:13:36] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:13:36] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:13:36] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:13:36] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:13:36] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:13:36] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:13:37] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:13:37] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:13:37] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:13:37] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:13:37] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (OVERLAPS) 107/216 variables, 109/164 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:13:38] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:13:39] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:13:39] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:13:39] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:13:39] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:13:39] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:13:39] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:13:39] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:13:39] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:13:40] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:13:40] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/216 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:13:41] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:13:41] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:13:41] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/216 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/216 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:13:42] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/216 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/216 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:13:43] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/216 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/216 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:13:44] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:13:44] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:13:44] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/216 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/216 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 25 (OVERLAPS) 0/216 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 183 constraints, problems are : Problem set: 0 solved, 106 unsolved in 11757 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 55/55 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, 55/74 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:13:45] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/216 variables, 109/184 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 106/290 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:13:46] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:13:46] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:13:46] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:13:47] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:13:47] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:13:47] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:13:47] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 7/297 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:13:48] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-28 06:13:49] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:13:49] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:13:49] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:13:49] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:13:50] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:13:50] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 6/304 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (OVERLAPS) 0/216 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 304 constraints, problems are : Problem set: 0 solved, 106 unsolved in 8142 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 70/70 constraints]
After SMT, in 19913ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 19915ms
Starting structural reductions in LTL mode, iteration 1 : 109/122 places, 107/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20100 ms. Remains : 109/122 places, 107/120 transitions.
[2024-05-28 06:13:53] [INFO ] Flatten gal took : 11 ms
[2024-05-28 06:13:53] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:13:53] [INFO ] Input system was already deterministic with 107 transitions.
[2024-05-28 06:13:53] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:13:53] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:13:53] [INFO ] Time to serialize gal into /tmp/CTLFireability17407799534971576397.gal : 1 ms
[2024-05-28 06:13:53] [INFO ] Time to serialize properties into /tmp/CTLFireability8584523789448397043.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/CTLFireability17407799534971576397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8584523789448397043.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.27785e+11,4.37193,142964,2,9889,5,418078,6,0,545,970511,0


Converting to forward existential form...Done !
original formula: AG((((AX((AF((p117==1)) + (p11==0))) + (p28==0)) + ((p50==0)||(p58==0))) + ((p5==1) + (A((p14==1) U (((p87==1)&&(p109==1))&&(p120==1))) *...169
=> equivalent forward existential formula: [FwdG((EY((((FwdU(Init,TRUE) * !(((p5==1) + (!((E(!((((p87==1)&&(p109==1))&&(p120==1))) U (!((p14==1)) * !((((p8...330
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, t29, t3...347
Detected timeout of ITS tools.
[2024-05-28 06:14:23] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:14:23] [INFO ] Applying decomposition
[2024-05-28 06:14:23] [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/graph6683975371562040123.txt' '-o' '/tmp/graph6683975371562040123.bin' '-w' '/tmp/graph6683975371562040123.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6683975371562040123.bin' '-l' '-1' '-v' '-w' '/tmp/graph6683975371562040123.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:14:23] [INFO ] Decomposing Gal with order
[2024-05-28 06:14:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:14:23] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-28 06:14:23] [INFO ] Flatten gal took : 27 ms
[2024-05-28 06:14:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 06:14:23] [INFO ] Time to serialize gal into /tmp/CTLFireability6800290018590043967.gal : 1 ms
[2024-05-28 06:14:23] [INFO ] Time to serialize properties into /tmp/CTLFireability5592569345408982395.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/CTLFireability6800290018590043967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5592569345408982395.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.27785e+11,0.495376,23020,1112,38,37115,144,346,73204,44,558,0


Converting to forward existential form...Done !
original formula: AG((((AX((AF((i10.u39.p117==1)) + (i1.i2.u5.p11==0))) + (i4.u11.p28==0)) + ((i4.u18.p50==0)||(i5.u20.p58==0))) + ((i1.i0.u2.p5==1) + (A((...254
=> equivalent forward existential formula: [FwdG((EY((((FwdU(Init,TRUE) * !(((i1.i0.u2.p5==1) + (!((E(!((((i6.u31.p87==1)&&(i9.u36.p109==1))&&(i10.u40.p120...459
Reverse transition relation is NOT exact ! Due to transitions t38, t40, t63, t65, t67, i0.u1.t71, i1.i1.u6.t70, i2.u7.t69, i3.i0.u10.t66, i3.i0.u13.t1, i3....602
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 115 transition count 113
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 115 transition count 113
Applied a total of 14 rules in 8 ms. Remains 115 /122 variables (removed 7) and now considering 113/120 (removed 7) transitions.
// Phase 1: matrix 113 rows 115 cols
[2024-05-28 06:14:53] [INFO ] Computed 19 invariants in 2 ms
[2024-05-28 06:14:53] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-28 06:14:54] [INFO ] Invariant cache hit.
[2024-05-28 06:14:54] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-28 06:14:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:14:54] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:14:54] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:14:54] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:14:54] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:14:54] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:14:54] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:14:54] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:14:54] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:14:54] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:14:54] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:14:54] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 1 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 0 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 3 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:14:55] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:14:56] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:14:56] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:14:56] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:14:56] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:14:56] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-28 06:14:56] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:14:56] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:14:56] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:14:56] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:14:56] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:14:57] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:14:57] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:14:57] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:14:57] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:14:57] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:14:57] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-28 06:14:57] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:14:57] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2024-05-28 06:14:57] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:14:57] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:14:57] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-28 06:14:57] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 06:14:57] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-28 06:14:58] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2024-05-28 06:14:58] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-28 06:14:58] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-28 06:14:58] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:14:58] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-28 06:14:58] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:14:58] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:14:58] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:14:58] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:14:58] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:15:00] [INFO ] Deduced a trap composed of 18 places in 1758 ms of which 2 ms to minimize.
[2024-05-28 06:15:00] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:15:00] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:15:00] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:15:01] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 113/228 variables, 115/207 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:15:02] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:15:02] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:15:02] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:15:02] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:15:02] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:15:02] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:15:02] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:15:02] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:15:03] [INFO ] Deduced a trap composed of 31 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:15:03] [INFO ] Deduced a trap composed of 30 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:15:03] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:15:03] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:15:03] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:15:03] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 14/221 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:15:04] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/228 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:15:04] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:15:04] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:15:04] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:15:04] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:15:05] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:15:05] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:15:05] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:15:05] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:15:05] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 5/231 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:15:06] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:15:07] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:15:07] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/228 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/228 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:15:08] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/228 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:15:09] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/228 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:15:09] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:15:09] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/228 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:15:11] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/228 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/228 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:15:11] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:15:11] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:15:11] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:15:11] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:15:11] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:15:11] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:15:11] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:15:12] [INFO ] Deduced a trap composed of 31 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:15:12] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:15:12] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:15:12] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:15:12] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:15:12] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/228 variables, 13/252 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/228 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 26 (OVERLAPS) 0/228 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 252 constraints, problems are : Problem set: 0 solved, 112 unsolved in 19677 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 118/118 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 118/137 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:15:14] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:15:14] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:15:14] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:15:14] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:15:15] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:15:15] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:15:15] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:15:15] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 113/228 variables, 115/260 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 112/372 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:15:16] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:15:16] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:15:16] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:15:16] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-28 06:15:17] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:15:17] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 6/378 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:15:19] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:15:19] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:15:21] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:15:24] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:15:24] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:15:24] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:15:24] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 4/385 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:15:27] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 06:15:27] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 15 (OVERLAPS) 0/228 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 387 constraints, problems are : Problem set: 0 solved, 112 unsolved in 22676 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 141/141 constraints]
After SMT, in 42371ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 42373ms
Starting structural reductions in LTL mode, iteration 1 : 115/122 places, 113/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42512 ms. Remains : 115/122 places, 113/120 transitions.
[2024-05-28 06:15:36] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:15:36] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:15:36] [INFO ] Input system was already deterministic with 113 transitions.
[2024-05-28 06:15:36] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:15:36] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:15:36] [INFO ] Time to serialize gal into /tmp/CTLFireability15571033364507176901.gal : 1 ms
[2024-05-28 06:15:36] [INFO ] Time to serialize properties into /tmp/CTLFireability16877788203587194229.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/CTLFireability15571033364507176901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16877788203587194229.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.6555e+11,8.74004,231296,2,27788,5,636614,6,0,575,1.63493e+06,0


Converting to forward existential form...Done !
original formula: AF((((EG((p33==0)) * AF((p1==0))) * (E(((A((((p84==1)&&(p92==1))&&(p119==1)) U (p6==1)) + (p112!=1)) + ((p113==1)&&(p96==1))) U (!(EG((p8...299
=> equivalent forward existential formula: [FwdG(Init,!((((EG((p33==0)) * !(EG(!((p1==0))))) * (E(((!((E(!((p6==1)) U (!((((p84==1)&&(p92==1))&&(p119==1)))...399
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, t21, t2...382
Detected timeout of ITS tools.
[2024-05-28 06:16:06] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:16:06] [INFO ] Applying decomposition
[2024-05-28 06:16:06] [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/graph6452175389587436306.txt' '-o' '/tmp/graph6452175389587436306.bin' '-w' '/tmp/graph6452175389587436306.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6452175389587436306.bin' '-l' '-1' '-v' '-w' '/tmp/graph6452175389587436306.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:16:06] [INFO ] Decomposing Gal with order
[2024-05-28 06:16:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:16:06] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-28 06:16:06] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:16:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 06:16:06] [INFO ] Time to serialize gal into /tmp/CTLFireability9515852819282280119.gal : 2 ms
[2024-05-28 06:16:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14137067538821283288.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/CTLFireability9515852819282280119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14137067538821283288.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.6555e+11,1.08746,37052,2041,50,57919,239,360,131052,51,933,0


Converting to forward existential form...Done !
original formula: AF((((EG((i2.u12.p33==0)) * AF((i0.u0.p1==0))) * (E(((A((((i7.i0.u28.p84==1)&&(i8.u31.p92==1))&&(i7.i0.u38.p119==1)) U (i5.u2.p6==1)) + (...468
=> equivalent forward existential formula: [FwdG(Init,!((((EG((i2.u12.p33==0)) * !(EG(!((i0.u0.p1==0))))) * (E(((!((E(!((i5.u2.p6==1)) U (!((((i7.i0.u28.p8...580
Reverse transition relation is NOT exact ! Due to transitions t42, t44, t68, t70, t72, i0.u1.t76, i1.u6.t74, i2.u9.t71, i2.u11.t65, i2.u12.t1, i2.u12.t2, i...703
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 109 transition count 107
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 109 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 108 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 108 transition count 106
Applied a total of 28 rules in 6 ms. Remains 108 /122 variables (removed 14) and now considering 106/120 (removed 14) transitions.
// Phase 1: matrix 106 rows 108 cols
[2024-05-28 06:16:36] [INFO ] Computed 19 invariants in 2 ms
[2024-05-28 06:16:36] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-28 06:16:36] [INFO ] Invariant cache hit.
[2024-05-28 06:16:36] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-28 06:16:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:37] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:16:37] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:16:37] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
[2024-05-28 06:16:37] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:16:37] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:16:37] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:16:37] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:16:37] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:16:37] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:16:37] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:16:37] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:16:37] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:16:37] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:16:37] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:16:37] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:16:37] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:16:37] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:16:37] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:16:37] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:38] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:16:38] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:38] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:38] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:16:39] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:16:39] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:39] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 106/214 variables, 108/153 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:39] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 06:16:40] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:16:40] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:16:40] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:16:40] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-28 06:16:40] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:16:40] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:41] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:16:41] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:41] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:42] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:16:42] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:16:42] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:16:42] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:16:42] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:16:42] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:16:42] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:16:42] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:16:42] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:16:42] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/214 variables, 10/173 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:43] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:16:43] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:16:43] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:16:43] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:16:43] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/214 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:44] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
[2024-05-28 06:16:44] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/214 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:44] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:16:44] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:16:44] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/214 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:45] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:16:45] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/214 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:46] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/214 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:46] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:16:46] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:16:46] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:16:46] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/214 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:47] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:16:47] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/214 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:47] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:16:47] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:16:47] [INFO ] Deduced a trap composed of 31 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:16:47] [INFO ] Deduced a trap composed of 30 places in 22 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/214 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:48] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:16:48] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/214 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/214 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 25 (OVERLAPS) 0/214 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 198 constraints, problems are : Problem set: 0 solved, 105 unsolved in 12887 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 71/90 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:50] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/214 variables, 108/199 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 105/304 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:51] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:16:51] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:16:51] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:16:51] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:52] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:16:53] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:16:53] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:54] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:16:54] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:16:55] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:56] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:16:58] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:16:58] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (OVERLAPS) 0/214 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 317 constraints, problems are : Problem set: 0 solved, 105 unsolved in 13889 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 85/85 constraints]
After SMT, in 26789ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 26790ms
Starting structural reductions in LTL mode, iteration 1 : 108/122 places, 106/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26918 ms. Remains : 108/122 places, 106/120 transitions.
[2024-05-28 06:17:03] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:17:03] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:17:03] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-28 06:17:03] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:17:03] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:17:03] [INFO ] Time to serialize gal into /tmp/CTLFireability12080296884419390492.gal : 1 ms
[2024-05-28 06:17:03] [INFO ] Time to serialize properties into /tmp/CTLFireability10230000128465286033.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/CTLFireability12080296884419390492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10230000128465286033.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.27785e+11,5.85156,144088,2,21275,5,460145,6,0,540,882909,0


Converting to forward existential form...Done !
original formula: (EX(EG((EF((p8==1)) + (p76==1)))) + AF(((p4==1)&&(p23==1))))
=> equivalent forward existential formula: [FwdG((Init * !(EX(EG((E(TRUE U (p8==1)) + (p76==1)))))),!(((p4==1)&&(p23==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, t23, t28, t3...342
Detected timeout of ITS tools.
[2024-05-28 06:17:33] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:17:33] [INFO ] Applying decomposition
[2024-05-28 06:17:33] [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/graph11700056574129760613.txt' '-o' '/tmp/graph11700056574129760613.bin' '-w' '/tmp/graph11700056574129760613.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11700056574129760613.bin' '-l' '-1' '-v' '-w' '/tmp/graph11700056574129760613.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:17:33] [INFO ] Decomposing Gal with order
[2024-05-28 06:17:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:17:33] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-28 06:17:33] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:17:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 06:17:33] [INFO ] Time to serialize gal into /tmp/CTLFireability751715311431035920.gal : 1 ms
[2024-05-28 06:17:33] [INFO ] Time to serialize properties into /tmp/CTLFireability8827870860033548421.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/CTLFireability751715311431035920.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8827870860033548421.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 -...261
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.27785e+11,0.877456,32724,1242,38,54475,158,306,108650,44,568,0


Converting to forward existential form...Done !
original formula: (EX(EG((EF((i2.i1.u3.p8==1)) + (i6.i1.u25.p76==1)))) + AF(((i5.u1.p4==1)&&(i1.u9.p23==1))))
=> equivalent forward existential formula: [FwdG((Init * !(EX(EG((E(TRUE U (i2.i1.u3.p8==1)) + (i6.i1.u25.p76==1)))))),!(((i5.u1.p4==1)&&(i1.u9.p23==1))))]...163
Reverse transition relation is NOT exact ! Due to transitions t37, t39, t62, t64, u19.t7, u19.t8, u19.t9, i1.u9.t65, i1.u11.t59, i1.u12.t1, i1.u12.t2, i1.u...571
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 122/122 places, 120/120 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 121 transition count 109
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 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 20 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 42 place count 100 transition count 98
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 54 place count 88 transition count 86
Iterating global reduction 2 with 12 rules applied. Total rules applied 66 place count 88 transition count 86
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 66 place count 88 transition count 81
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 76 place count 83 transition count 81
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 128 place count 57 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 55 transition count 53
Applied a total of 130 rules in 24 ms. Remains 55 /122 variables (removed 67) and now considering 53/120 (removed 67) transitions.
// Phase 1: matrix 53 rows 55 cols
[2024-05-28 06:18:03] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 06:18:03] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-28 06:18:03] [INFO ] Invariant cache hit.
[2024-05-28 06:18:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 06:18:03] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-28 06:18:03] [INFO ] Redundant transitions in 14 ms returned [52]
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 50 sub problems to find dead transitions.
// Phase 1: matrix 52 rows 55 cols
[2024-05-28 06:18:03] [INFO ] Computed 19 invariants in 0 ms
[2024-05-28 06:18:03] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 2/55 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-28 06:18:04] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:18:04] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-28 06:18:04] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2024-05-28 06:18:04] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-28 06:18:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:18:04] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 52/107 variables, 55/80 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 0/107 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 83 constraints, problems are : Problem set: 0 solved, 50 unsolved in 855 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 2/55 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 52/107 variables, 55/80 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 50/133 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-28 06:18:05] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-28 06:18:05] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/107 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 135 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1294 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 55/55 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 8/8 constraints]
After SMT, in 2186ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2187ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/122 places, 52/120 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 2320 ms. Remains : 55/122 places, 52/120 transitions.
[2024-05-28 06:18:06] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:18:06] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:18:06] [INFO ] Input system was already deterministic with 52 transitions.
[2024-05-28 06:18:06] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:18:06] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:18:06] [INFO ] Time to serialize gal into /tmp/CTLFireability190414948548347315.gal : 0 ms
[2024-05-28 06:18:06] [INFO ] Time to serialize properties into /tmp/CTLFireability2794957159526314583.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/CTLFireability190414948548347315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2794957159526314583.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 -...282
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.96667e+07,0.27516,15764,2,1712,5,47998,6,0,271,81688,0


Converting to forward existential form...Done !
original formula: AG(EF(((EF((p70==0)) + (p52==0)) + ((p19==1)&&(p35==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((E(TRUE U (p70==0)) + (p52==0)) + ((p19==1)&&(p35==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, t14, t16, t31, t32, t34, t35, t36...305
(forward)formula 0,1,0.495085,18244,1,0,151,92884,127,59,1852,81688,121
FORMULA ShieldIIPs-PT-002B-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 112 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 112 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 111 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 111 transition count 109
Applied a total of 22 rules in 6 ms. Remains 111 /122 variables (removed 11) and now considering 109/120 (removed 11) transitions.
// Phase 1: matrix 109 rows 111 cols
[2024-05-28 06:18:06] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 06:18:06] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-28 06:18:06] [INFO ] Invariant cache hit.
[2024-05-28 06:18:06] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-28 06:18:06] [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:18:07] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-05-28 06:18:07] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:18:07] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:18:07] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:18:07] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:18:07] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:18:07] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:18:07] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:18:07] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:18:07] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:18:07] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:18:07] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:18:07] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:18:07] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:18:07] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:18:07] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:18:07] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:18:07] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:18:07] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:18:07] [INFO ] Deduced a trap composed of 24 places in 22 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
[2024-05-28 06:18:08] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:18:08] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:18:08] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:18:08] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:18:08] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:18:08] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:18:08] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:18:08] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:08] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:18:08] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:18:08] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:18:08] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:18:09] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:09] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:18:09] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:18:09] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:18:09] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:18:09] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:18:09] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:09] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:10] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:18:10] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 109/220 variables, 111/172 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:11] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:18:11] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:18:11] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:18:11] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:11] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:18:11] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:18:11] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:12] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:18:12] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:18:12] [INFO ] Deduced a trap composed of 27 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:18:12] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:18:12] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:18:12] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:18:12] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:18:12] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:18:12] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 9/188 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:13] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:18:13] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:18:13] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 1 ms to minimize.
[2024-05-28 06:18:13] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:18:13] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/220 variables, 5/193 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/220 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:14] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/220 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:14] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:18:14] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:18:15] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/220 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/220 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:15] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/220 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:16] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:18:16] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:18:16] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:18:16] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:18:16] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:18:16] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:18:16] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/220 variables, 7/205 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:17] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/220 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:17] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:18:17] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:18:17] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/220 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:18] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-28 06:18:18] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:18:18] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/220 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:19] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/220 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:19] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:18:19] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/220 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/220 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 26 (OVERLAPS) 0/220 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 215 constraints, problems are : Problem set: 0 solved, 108 unsolved in 14151 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 85/85 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, 85/104 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:21] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:18:21] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:18:21] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:18:21] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:18:21] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:18:21] [INFO ] Deduced a trap composed of 27 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:18:21] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/111 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 109/220 variables, 111/222 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 108/330 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:22] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:18:22] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:18:23] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:18:23] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 4/334 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:24] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:18:24] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-28 06:18:24] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:26] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:18:26] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:18:26] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 06:18:28] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 0/220 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 341 constraints, problems are : Problem set: 0 solved, 108 unsolved in 14349 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 103/103 constraints]
After SMT, in 28514ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 28515ms
Starting structural reductions in LTL mode, iteration 1 : 111/122 places, 109/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28640 ms. Remains : 111/122 places, 109/120 transitions.
[2024-05-28 06:18:35] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:18:35] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:18:35] [INFO ] Input system was already deterministic with 109 transitions.
[2024-05-28 06:18:35] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:18:35] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:18:35] [INFO ] Time to serialize gal into /tmp/CTLFireability6973780608690672893.gal : 1 ms
[2024-05-28 06:18:35] [INFO ] Time to serialize properties into /tmp/CTLFireability11021632688140398779.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/CTLFireability6973780608690672893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11021632688140398779.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.40204e+11,5.96012,157888,2,14136,5,447650,6,0,555,1.08434e+06,0


Converting to forward existential form...Done !
original formula: E(EF(((((p25==1)&&(p36==1))&&(p60==1)) + (((p59==1) * AF(AG((p70==1)))) * (AX((p69==1)) + !(((p75==1)&&(p100==1))))))) U (EX(AG((((p99==1...288
=> equivalent forward existential formula: ([(EY(FwdU(Init,E(TRUE U ((((p25==1)&&(p36==1))&&(p60==1)) + (((p59==1) * !(EG(!(!(E(TRUE U !((p70==1)))))))) * ...816
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:19:05] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:19:05] [INFO ] Applying decomposition
[2024-05-28 06:19:05] [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/graph6111837047095143015.txt' '-o' '/tmp/graph6111837047095143015.bin' '-w' '/tmp/graph6111837047095143015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6111837047095143015.bin' '-l' '-1' '-v' '-w' '/tmp/graph6111837047095143015.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:19:05] [INFO ] Decomposing Gal with order
[2024-05-28 06:19:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:19:05] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-28 06:19:05] [INFO ] Flatten gal took : 15 ms
[2024-05-28 06:19:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 06:19:05] [INFO ] Time to serialize gal into /tmp/CTLFireability6573910498921985269.gal : 1 ms
[2024-05-28 06:19:05] [INFO ] Time to serialize properties into /tmp/CTLFireability15092975803416722419.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/CTLFireability6573910498921985269.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15092975803416722419.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.40204e+11,1.20939,42008,1367,52,68446,244,336,140686,56,911,0


Converting to forward existential form...Done !
original formula: E(EF(((((i2.u10.p25==1)&&(i2.u14.p36==1))&&(i4.u21.p60==1)) + (((i4.u21.p59==1) * AF(AG((i7.i1.u24.p70==1)))) * (AX((i7.i1.u23.p69==1)) +...439
=> equivalent forward existential formula: ([(EY(FwdU(Init,E(TRUE U ((((i2.u10.p25==1)&&(i2.u14.p36==1))&&(i4.u21.p60==1)) + (((i4.u21.p59==1) * !(EG(!(!(E...1134
Reverse transition relation is NOT exact ! Due to transitions t39, t41, t43, t65, t67, i0.u1.t73, i1.t69, i1.i1.u6.t72, i1.i2.u7.t71, i2.u10.t68, i2.u12.t6...625
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 111 transition count 109
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 111 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 108
Applied a total of 24 rules in 9 ms. Remains 110 /122 variables (removed 12) and now considering 108/120 (removed 12) transitions.
// Phase 1: matrix 108 rows 110 cols
[2024-05-28 06:19:35] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 06:19:35] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-28 06:19:35] [INFO ] Invariant cache hit.
[2024-05-28 06:19:35] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-28 06:19:35] [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:19:36] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:19:36] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:19:36] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:19:36] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:19:36] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:19:36] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:19:36] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:19:36] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:19:36] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:19:36] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:19:36] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:19:36] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:19:36] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:19:36] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:19:36] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:19:36] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:19:36] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:19:36] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:19:36] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:19:36] [INFO ] Deduced a trap composed of 18 places in 28 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:19:36] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:19:36] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-05-28 06:19:37] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:19:37] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:19:37] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:19:37] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:19:37] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:19:37] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:19:37] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:19:37] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:19:37] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:19:37] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:19:38] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:19:38] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:19:38] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 108/218 variables, 110/164 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:19:39] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:19:39] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:19:39] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-28 06:19:39] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:19:39] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:19:39] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:19:40] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/218 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:19:40] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:19:40] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:19:40] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:19:40] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:19:41] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:19:41] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:19:41] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:19:41] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-28 06:19:41] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:19:41] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 6/181 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:19:42] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 06:19:42] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-28 06:19:42] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 16 (OVERLAPS) 0/218 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 184 constraints, problems are : Problem set: 0 solved, 107 unsolved in 8079 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 55/55 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, 55/74 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:19:43] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:19:44] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:19:44] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:19:44] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:19:44] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:19:44] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/218 variables, 110/190 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 107/297 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:19:45] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:19:45] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:19:45] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:19:45] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-28 06:19:45] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:19:45] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:19:45] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:19:45] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:19:47] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:19:49] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:19:51] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:19:52] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:19:52] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:19:52] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:19:56] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/218 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:19:57] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:19:58] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:19:58] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-28 06:19:58] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:19:59] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:01] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:20:01] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/218 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:03] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/218 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:04] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:20:04] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:20:05] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/218 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:06] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:20:06] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/218 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:20:08] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/218 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/218 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 22 (OVERLAPS) 0/218 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 326 constraints, problems are : Problem set: 0 solved, 107 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 90/90 constraints]
After SMT, in 38100ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 38101ms
Starting structural reductions in LTL mode, iteration 1 : 110/122 places, 108/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38225 ms. Remains : 110/122 places, 108/120 transitions.
[2024-05-28 06:20:13] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:20:13] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:20:13] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-28 06:20:13] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:20:13] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:20:13] [INFO ] Time to serialize gal into /tmp/CTLFireability16459480353585120933.gal : 1 ms
[2024-05-28 06:20:13] [INFO ] Time to serialize properties into /tmp/CTLFireability7900494514092659775.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/CTLFireability16459480353585120933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7900494514092659775.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.44679e+11,6.28731,165588,2,10840,5,468641,6,0,550,1.12882e+06,0


Converting to forward existential form...Done !
original formula: A(E((E(A((p52==1) U (p66==1)) U ((p106!=1) + EX((p108==1)))) * AG((AG((p65==1)) + ((p78==1)&&(p95==1))))) U AF(EG(((p48==1)||(p117==1))))...168
=> equivalent forward existential formula: [((Init * !(EG(!((p48==1))))) * !(E(!((p48==1)) U (!(E((E(!((E(!((p66==1)) U (!((p52==1)) * !((p66==1)))) + EG(!...336
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...352
Detected timeout of ITS tools.
[2024-05-28 06:20:43] [INFO ] Flatten gal took : 10 ms
[2024-05-28 06:20:43] [INFO ] Applying decomposition
[2024-05-28 06:20:43] [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/graph9092633184701610199.txt' '-o' '/tmp/graph9092633184701610199.bin' '-w' '/tmp/graph9092633184701610199.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9092633184701610199.bin' '-l' '-1' '-v' '-w' '/tmp/graph9092633184701610199.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:20:43] [INFO ] Decomposing Gal with order
[2024-05-28 06:20:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:20:43] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-28 06:20:43] [INFO ] Flatten gal took : 10 ms
[2024-05-28 06:20:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 06:20:43] [INFO ] Time to serialize gal into /tmp/CTLFireability7552917624462754218.gal : 5 ms
[2024-05-28 06:20:43] [INFO ] Time to serialize properties into /tmp/CTLFireability7627825568002401662.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/CTLFireability7552917624462754218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7627825568002401662.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.44679e+11,1.19943,38584,1200,51,64759,224,343,123938,47,1169,0


Converting to forward existential form...Done !
original formula: A(E((E(A((i4.u18.p52==1) U (i6.i0.u23.p66==1)) U ((i8.i1.u35.p106!=1) + EX((i8.i1.u35.p108==1)))) * AG((AG((i6.i0.u22.p65==1)) + ((i8.i0....253
=> equivalent forward existential formula: [((Init * !(EG(!((i4.u16.p48==1))))) * !(E(!((i4.u16.p48==1)) U (!(E((E(!((E(!((i6.i0.u23.p66==1)) U (!((i4.u18....455
Reverse transition relation is NOT exact ! Due to transitions t40, t42, t66, t68, i0.u1.t72, i1.u6.t70, i2.u9.t67, i2.u12.t61, i2.u13.t1, i2.u13.t2, i2.u13...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
Using 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 : 122/122 places, 120/120 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 115 transition count 113
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 115 transition count 113
Applied a total of 14 rules in 5 ms. Remains 115 /122 variables (removed 7) and now considering 113/120 (removed 7) transitions.
// Phase 1: matrix 113 rows 115 cols
[2024-05-28 06:21:13] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 06:21:13] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-28 06:21:13] [INFO ] Invariant cache hit.
[2024-05-28 06:21:13] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-28 06:21:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:14] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:21:14] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:21:14] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:21:14] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:21:14] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:21:14] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:21:14] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:21:14] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:21:14] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:21:14] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:21:14] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:21:14] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:21:14] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:21:14] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:21:15] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:21:15] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:21:15] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:21:15] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:21:15] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:21:15] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:15] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:21:15] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:21:15] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:21:15] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:21:15] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:21:15] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:21:15] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:21:15] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:16] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:21:16] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:21:16] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:21:16] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:21:16] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:21:16] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:21:16] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:21:16] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:16] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:17] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 113/228 variables, 115/172 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:18] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:21:18] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:18] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:21:18] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:21:18] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:21:18] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:21:18] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2024-05-28 06:21:18] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:21:18] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 7/181 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:19] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:19] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:21:19] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:21:19] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:21:19] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 4/186 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:20] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:21] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:21:21] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:21:21] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/228 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:22] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:21:22] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:21:22] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:21:22] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:22] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:21:23] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:21:23] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/228 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:23] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:21:23] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/228 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/228 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 20 (OVERLAPS) 0/228 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 199 constraints, problems are : Problem set: 0 solved, 112 unsolved in 11130 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 65/84 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:25] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:21:25] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:21:25] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:25] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:21:25] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:21:25] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:21:26] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:21:26] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:21:26] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:21:26] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:21:26] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:21:26] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 9/96 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:26] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:21:26] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:26] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:21:26] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 113/228 variables, 115/215 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 112/327 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:27] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:21:28] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:21:28] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:21:28] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:21:28] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 06:21:28] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 6/333 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:29] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:21:29] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:21:29] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:21:29] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 4/337 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:31] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:35] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:21:35] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/228 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 06:21:37] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 17 (OVERLAPS) 0/228 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 341 constraints, problems are : Problem set: 0 solved, 112 unsolved in 17883 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 95/95 constraints]
After SMT, in 29025ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 29026ms
Starting structural reductions in LTL mode, iteration 1 : 115/122 places, 113/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29141 ms. Remains : 115/122 places, 113/120 transitions.
[2024-05-28 06:21:42] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:21:42] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:21:42] [INFO ] Input system was already deterministic with 113 transitions.
[2024-05-28 06:21:42] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:21:42] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:21:42] [INFO ] Time to serialize gal into /tmp/CTLFireability12579253460575436895.gal : 1 ms
[2024-05-28 06:21:42] [INFO ] Time to serialize properties into /tmp/CTLFireability5003061132868445120.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/CTLFireability12579253460575436895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5003061132868445120.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.79606e+11,6.98313,204436,2,42586,5,650188,6,0,575,1.30637e+06,0


Converting to forward existential form...Done !
original formula: (AG((A((A((p66==1) U (p93==1)) * EX((p0==1))) U ((EX((p59==1)) + (p113==1)) * EF((p7==1)))) + (!(E((p92==1) U ((p79==1)&&(p81==1)))) * ((...480
=> equivalent forward existential formula: ([(FwdU((FwdU((Init * !(!((E(!(!(((!(E(TRUE U !((p107!=1)))) * ((!(EG(!((p107==1)))) + ((p75==1)&&(p100==1))) + ...2077
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, t21, t2...377
Detected timeout of ITS tools.
[2024-05-28 06:22:13] [INFO ] Flatten gal took : 11 ms
[2024-05-28 06:22:13] [INFO ] Applying decomposition
[2024-05-28 06:22:13] [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/graph11569430395923477962.txt' '-o' '/tmp/graph11569430395923477962.bin' '-w' '/tmp/graph11569430395923477962.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11569430395923477962.bin' '-l' '-1' '-v' '-w' '/tmp/graph11569430395923477962.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 : 8 ms
[2024-05-28 06:22:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 06:22:13] [INFO ] Time to serialize gal into /tmp/CTLFireability14600025926364327012.gal : 1 ms
[2024-05-28 06:22:13] [INFO ] Time to serialize properties into /tmp/CTLFireability11717924672671105664.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/CTLFireability14600025926364327012.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11717924672671105664.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.79606e+11,1.18287,40756,1692,81,66161,309,377,117710,55,1827,0


Converting to forward existential form...Done !
original formula: (AG((A((A((i5.i0.u22.p66==1) U (i8.u33.p93==1)) * EX((i0.u0.p0==1))) U ((EX((i4.u19.p59==1)) + (i9.u40.p113==1)) * EF((i1.i0.u3.p7==1))))...752
=> equivalent forward existential formula: ([(FwdU((FwdU((Init * !(!((E(!(!(((!(E(TRUE U !((i6.i0.u35.p107!=1)))) * ((!(EG(!((i6.i0.u35.p107==1)))) + ((i5....3030
Reverse transition relation is NOT exact ! Due to transitions t43, t45, t68, t70, i0.u1.t76, i1.t72, i1.i1.u5.t75, i1.i2.u6.t74, i2.i0.u9.t71, i2.i0.u12.t1...688
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 111 transition count 109
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 111 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 108
Applied a total of 24 rules in 2 ms. Remains 110 /122 variables (removed 12) and now considering 108/120 (removed 12) transitions.
// Phase 1: matrix 108 rows 110 cols
[2024-05-28 06:22:43] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 06:22:43] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-28 06:22:43] [INFO ] Invariant cache hit.
[2024-05-28 06:22:43] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-28 06:22: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:22:43] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:22:43] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:22:43] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:22:43] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:22:43] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:22:43] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:22:43] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:22:43] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:22:44] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:22:44] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:22:44] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:22:44] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:22:44] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:22:44] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:22:44] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:22:44] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:22:44] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:22:44] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:22:44] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:22:44] [INFO ] Deduced a trap composed of 22 places in 38 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:22:44] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:22:44] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:22:44] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:22:44] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:45] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:22:45] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:22:45] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:22:45] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:45] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:22:45] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:22:45] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:22:45] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:22:45] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:22:45] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:22:45] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:22:45] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:22:45] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:22:45] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:22:45] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:22:45] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:22:45] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:46] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:22:46] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:46] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:22:46] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:22:46] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:22:46] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:22:46] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:47] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:22:47] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:47] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:47] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:22:47] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:48] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:22:48] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:22:48] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:22:48] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:48] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 14 (OVERLAPS) 108/218 variables, 110/187 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:49] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:22:49] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:50] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:22:50] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:22:50] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/218 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:50] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/218 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:51] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/218 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:51] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:22:52] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/218 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:52] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:22:52] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/218 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:52] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-05-28 06:22:52] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:22:52] [INFO ] Deduced a trap composed of 18 places in 16 ms of which 1 ms to minimize.
[2024-05-28 06:22:53] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/218 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:53] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:22:53] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:22:53] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/218 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/218 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:54] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:22:54] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/218 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:55] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:22:55] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:22:55] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:22:55] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/218 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:56] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:22:56] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/218 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/218 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 28 (OVERLAPS) 0/218 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 213 constraints, problems are : Problem set: 0 solved, 107 unsolved in 14215 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 84/84 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, 84/103 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:57] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/218 variables, 110/214 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 107/321 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:22:59] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:22:59] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:22:59] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:22:59] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:23:03] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:23:03] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:23:03] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/218 variables, 3/328 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/218 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 328 constraints, problems are : Problem set: 0 solved, 107 unsolved in 14468 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 92/92 constraints]
After SMT, in 28697ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 28698ms
Starting structural reductions in LTL mode, iteration 1 : 110/122 places, 108/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28803 ms. Remains : 110/122 places, 108/120 transitions.
[2024-05-28 06:23:11] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:23:11] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:23:11] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-28 06:23:11] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:23:11] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:23:11] [INFO ] Time to serialize gal into /tmp/CTLFireability15498135522341829871.gal : 1 ms
[2024-05-28 06:23:11] [INFO ] Time to serialize properties into /tmp/CTLFireability2436844796625401319.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/CTLFireability15498135522341829871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2436844796625401319.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.27785e+11,5.34954,143580,2,21232,5,460171,6,0,550,878497,0


Converting to forward existential form...Done !
original formula: ((EF((EX((p117==1)) * E((p113!=1) U ((p13==1)&&(p55==1))))) * EG(((AG((p76==0)) + (p25==0)) + ((p33==0)||(p60==0))))) * EF(((EG(EX((p54==...204
=> equivalent forward existential formula: ([FwdG((FwdU((Init * (E(TRUE U (EX((p117==1)) * E((p113!=1) U ((p13==1)&&(p55==1))))) * EG(((!(E(TRUE U !((p76==...454
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, t24, t27, t2...352
Detected timeout of ITS tools.
[2024-05-28 06:23:42] [INFO ] Flatten gal took : 9 ms
[2024-05-28 06:23:42] [INFO ] Applying decomposition
[2024-05-28 06:23:42] [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/graph5528149150089833699.txt' '-o' '/tmp/graph5528149150089833699.bin' '-w' '/tmp/graph5528149150089833699.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5528149150089833699.bin' '-l' '-1' '-v' '-w' '/tmp/graph5528149150089833699.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:23:42] [INFO ] Decomposing Gal with order
[2024-05-28 06:23:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:23:42] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-28 06:23:42] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:23:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 06:23:42] [INFO ] Time to serialize gal into /tmp/CTLFireability7490636738128552129.gal : 1 ms
[2024-05-28 06:23:42] [INFO ] Time to serialize properties into /tmp/CTLFireability4472990145239724684.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7490636738128552129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4472990145239724684.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.27785e+11,1.06931,36984,1059,40,59322,245,325,108220,44,806,0


Converting to forward existential form...Done !
original formula: ((EF((EX((i9.u39.p117==1)) * E((i9.u38.p113!=1) U ((i1.i1.u6.p13==1)&&(i4.u21.p55==1))))) * EG(((AG((i6.i2.u26.p76==0)) + (i3.u10.p25==0)...297
=> equivalent forward existential formula: ([FwdG((FwdU((Init * (E(TRUE U (EX((i9.u39.p117==1)) * E((i9.u38.p113!=1) U ((i1.i1.u6.p13==1)&&(i4.u21.p55==1))...608
Reverse transition relation is NOT exact ! Due to transitions t38, t40, t64, t66, i0.u1.t72, i1.t68, i1.i1.u6.t71, i1.i2.u7.t70, i2.u16.t55, i2.u17.t4, i2....597
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 109 transition count 107
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 109 transition count 107
Applied a total of 26 rules in 3 ms. Remains 109 /122 variables (removed 13) and now considering 107/120 (removed 13) transitions.
// Phase 1: matrix 107 rows 109 cols
[2024-05-28 06:24:12] [INFO ] Computed 19 invariants in 0 ms
[2024-05-28 06:24:12] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-28 06:24:12] [INFO ] Invariant cache hit.
[2024-05-28 06:24:12] [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 106 sub problems to find dead transitions.
[2024-05-28 06:24:12] [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:24:12] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:24:12] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:24:12] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:24:12] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:24:12] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:24:12] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:24:12] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:24:12] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:24:12] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:24:13] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:24:13] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:24:13] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:24:13] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:24:13] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:24:13] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:24:13] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:24:13] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:24:13] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:24:13] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:24:13] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 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:24:13] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:24:13] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:24:13] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:24:13] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:24:13] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:24:13] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 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:24:14] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:24:14] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 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:24:14] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:24:14] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:24:14] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:24:14] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 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:24:15] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:24:15] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 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:24:15] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:24:15] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:24:15] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:24:15] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:24:16] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 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:24:16] [INFO ] Deduced a trap composed of 16 places in 22 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:24:16] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:24:17] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:24:17] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:24:17] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-05-28 06:24:17] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:24:17] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 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:24:17] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:24:17] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:24:17] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:24:17] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 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:24:18] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:24:18] [INFO ] Deduced a trap composed of 18 places in 26 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:24:18] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 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 7839 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:24:20] [INFO ] Deduced a trap composed of 15 places in 39 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:24:21] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:24:21] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:24:21] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:24:21] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 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:24:22] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 4 ms to minimize.
[2024-05-28 06:24:22] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 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:24:23] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-28 06:24:24] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:24:24] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:24:24] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 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:24:25] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:24:25] [INFO ] Deduced a trap composed of 14 places in 28 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:24:27] [INFO ] Deduced a trap composed of 25 places in 28 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:24:28] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:24:28] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:24:29] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:24:29] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:24:29] [INFO ] Deduced a trap composed of 35 places in 28 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:24:31] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 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:24:33] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:24:33] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:24:33] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:24:33] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:24:33] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-28 06:24:33] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:24:33] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 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:24:35] [INFO ] Deduced a trap composed of 31 places in 37 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:24:36] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 06:24:37] [INFO ] Deduced a trap composed of 18 places in 26 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 22342 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 30190ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 30192ms
Starting structural reductions in LTL mode, iteration 1 : 109/122 places, 107/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30320 ms. Remains : 109/122 places, 107/120 transitions.
[2024-05-28 06:24:42] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:24:42] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:24:42] [INFO ] Input system was already deterministic with 107 transitions.
[2024-05-28 06:24:42] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:24:42] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:24:42] [INFO ] Time to serialize gal into /tmp/CTLFireability13581116370709273710.gal : 1 ms
[2024-05-28 06:24:42] [INFO ] Time to serialize properties into /tmp/CTLFireability2035775905132746175.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/CTLFireability13581116370709273710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2035775905132746175.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.68945,158428,2,31644,5,512093,6,0,545,993132,0


Converting to forward existential form...Done !
original formula: EX(EG((((!(A((p76==1) U (((p84==1)&&(p92==1))&&(p119==1)))) + !(A((p110==1) U (p90==1)))) + EG((p96==0))) * (AX((p90==0)) + (p68==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),(((!(!((E(!((((p84==1)&&(p92==1))&&(p119==1))) U (!((p76==1)) * !((((p84==1)&&(p92==1))&&(p119==1...343
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:25:12] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:25:12] [INFO ] Applying decomposition
[2024-05-28 06:25:12] [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/graph2027358153303962311.txt' '-o' '/tmp/graph2027358153303962311.bin' '-w' '/tmp/graph2027358153303962311.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2027358153303962311.bin' '-l' '-1' '-v' '-w' '/tmp/graph2027358153303962311.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:25:12] [INFO ] Decomposing Gal with order
[2024-05-28 06:25:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:25:12] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-28 06:25:12] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:25:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 06:25:12] [INFO ] Time to serialize gal into /tmp/CTLFireability4983165135880135432.gal : 1 ms
[2024-05-28 06:25:12] [INFO ] Time to serialize properties into /tmp/CTLFireability17173011994430116804.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/CTLFireability4983165135880135432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17173011994430116804.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.28701e+11,1.39494,48920,1697,44,87561,166,352,135695,42,611,0


Converting to forward existential form...Done !
original formula: EX(EG((((!(A((i5.u27.p76==1) U (((i7.i0.u30.p84==1)&&(i6.u33.p92==1))&&(i9.u40.p119==1)))) + !(A((i8.i1.u38.p110==1) U (i6.u33.p90==1))))...226
=> equivalent forward existential formula: [FwdG(EY(Init),(((!(!((E(!((((i7.i0.u30.p84==1)&&(i6.u33.p92==1))&&(i9.u40.p119==1))) U (!((i5.u27.p76==1)) * !(...477
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t64, t66, i0.t62, i0.i1.u11.t63, i0.i2.u6.t69, i1.i0.u7.t68, i1.i1.u16.t53, i1.i1.u...640
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 109 transition count 107
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 109 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 108 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 108 transition count 106
Applied a total of 28 rules in 6 ms. Remains 108 /122 variables (removed 14) and now considering 106/120 (removed 14) transitions.
// Phase 1: matrix 106 rows 108 cols
[2024-05-28 06:25:42] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 06:25:42] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-28 06:25:42] [INFO ] Invariant cache hit.
[2024-05-28 06:25:42] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-28 06:25:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:43] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:25:43] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:25:43] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:25:43] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:25:43] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:25:43] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:25:43] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:25:43] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:25:43] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:25:43] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:25:43] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:25:43] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:25:43] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:25:43] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:25:43] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:25:43] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:25:43] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:25:43] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:25:43] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:44] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:25:44] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:44] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:44] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:25:44] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:25:44] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:45] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 106/214 variables, 108/153 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:45] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:25:45] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:25:45] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:25:45] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:25:45] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:25:46] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:25:46] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:46] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:25:46] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:47] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:48] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:25:48] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:25:48] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:25:48] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:25:48] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:25:48] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:25:48] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:25:48] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:25:48] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:25:48] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/214 variables, 10/173 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:49] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:25:49] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-28 06:25:49] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:25:49] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:25:49] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/214 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:50] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:25:50] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/214 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:50] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:25:50] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:25:50] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/214 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:51] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:25:51] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/214 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:51] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/214 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:52] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:25:52] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:25:52] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:25:52] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/214 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:52] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:25:52] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/214 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:53] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:25:53] [INFO ] Deduced a trap composed of 31 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:25:53] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:25:53] [INFO ] Deduced a trap composed of 30 places in 22 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/214 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:53] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:25:54] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/214 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/214 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 25 (OVERLAPS) 0/214 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 198 constraints, problems are : Problem set: 0 solved, 105 unsolved in 12653 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 71/90 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:55] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/214 variables, 108/199 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 105/304 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:56] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:25:56] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:25:57] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:25:57] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:25:58] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:25:58] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:25:58] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:26:00] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 06:26:00] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 06:26:00] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:26:02] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 06:26:04] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:26:04] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (OVERLAPS) 0/214 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 317 constraints, problems are : Problem set: 0 solved, 105 unsolved in 14102 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 85/85 constraints]
After SMT, in 26765ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 26766ms
Starting structural reductions in LTL mode, iteration 1 : 108/122 places, 106/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26890 ms. Remains : 108/122 places, 106/120 transitions.
[2024-05-28 06:26:09] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:26:09] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:26:09] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-28 06:26:09] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:26:09] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:26:09] [INFO ] Time to serialize gal into /tmp/CTLFireability14184524912488201945.gal : 0 ms
[2024-05-28 06:26:09] [INFO ] Time to serialize properties into /tmp/CTLFireability10775712219449882834.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/CTLFireability14184524912488201945.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10775712219449882834.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.27785e+11,5.17855,143604,2,21275,5,460145,6,0,540,882909,0


Converting to forward existential form...Done !
original formula: EF(EX(AF((((p28==1)&&(p50==1))&&(p61==1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EG(!((((p28==1)&&(p50==1))&&(p61==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, t23, t28, t3...342
Detected timeout of ITS tools.
[2024-05-28 06:26:39] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:26:39] [INFO ] Applying decomposition
[2024-05-28 06:26:39] [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/graph50740948169019093.txt' '-o' '/tmp/graph50740948169019093.bin' '-w' '/tmp/graph50740948169019093.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph50740948169019093.bin' '-l' '-1' '-v' '-w' '/tmp/graph50740948169019093.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:26:39] [INFO ] Decomposing Gal with order
[2024-05-28 06:26:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:26:39] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-28 06:26:39] [INFO ] Flatten gal took : 13 ms
[2024-05-28 06:26:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 06:26:39] [INFO ] Time to serialize gal into /tmp/CTLFireability9585897624781115513.gal : 16 ms
[2024-05-28 06:26:39] [INFO ] Time to serialize properties into /tmp/CTLFireability6265174613916602295.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/CTLFireability9585897624781115513.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6265174613916602295.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.27785e+11,1.22694,42036,1082,44,69536,157,347,121074,44,610,0


Converting to forward existential form...Done !
original formula: EF(EX(AF((((i3.i0.u11.p28==1)&&(i3.i1.u18.p50==1))&&(i4.u21.p61==1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EG(!((((i3.i0.u11.p28==1)&&(i3.i1.u18.p50==1))&&(i4.u21.p61==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t37, t39, t41, t62, t64, i0.u1.t70, i1.t66, i1.i1.u6.t69, i1.i2.u7.t68, i2.i0.u10.t65, i2.i0....605
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 120/120 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 111 transition count 109
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 111 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 110 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 110 transition count 108
Applied a total of 24 rules in 2 ms. Remains 110 /122 variables (removed 12) and now considering 108/120 (removed 12) transitions.
// Phase 1: matrix 108 rows 110 cols
[2024-05-28 06:27:09] [INFO ] Computed 19 invariants in 2 ms
[2024-05-28 06:27:09] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-28 06:27:09] [INFO ] Invariant cache hit.
[2024-05-28 06:27:09] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-28 06:27:09] [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:27:10] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:27:10] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:27:10] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:27:10] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:27:10] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:27:10] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:27:10] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:27:10] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:27:10] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 06:27:10] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:27:10] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:27:10] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:27:10] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:27:10] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:27:10] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:27:10] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:27:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:27:10] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:27:10] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:27:11] [INFO ] Deduced a trap composed of 23 places in 26 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:27:11] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:27:11] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:27:11] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:27:11] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:27:11] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:11] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:27:11] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:27:11] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 108/218 variables, 110/157 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:12] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:27:12] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:27:12] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:27:12] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:27:12] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:27:12] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:27:12] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:27:12] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:27:13] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 9/166 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:13] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:27:13] [INFO ] Deduced a trap composed of 24 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:27:13] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:27:13] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:27:13] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:27:13] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:27:13] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:27:13] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:27:13] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:27:13] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 10/176 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:13] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:27:14] [INFO ] Deduced a trap composed of 24 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:27:14] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:27:14] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:27:14] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 5/181 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:15] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:27:15] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:27:15] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/218 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:15] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:27:15] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-28 06:27:15] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:27:15] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:27:15] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:27:15] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:27:15] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:27:15] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:27:16] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 9/193 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:16] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/218 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:17] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:27:17] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:18] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:27:18] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:27:18] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:27:18] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:27:18] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:27:18] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:27:18] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/218 variables, 7/203 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:18] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:27:19] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/218 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:19] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/218 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:20] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/218 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/218 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:21] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:27:21] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:27:21] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:27:21] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:27:21] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:27:21] [INFO ] Deduced a trap composed of 31 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:27:21] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:27:21] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 0 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/218 variables, 8/215 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:22] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:27:22] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/218 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:22] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 06:27:22] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:27:22] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-28 06:27:22] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:27:22] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:27:22] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:27:22] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:27:22] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:27:22] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:27:22] [INFO ] Deduced a trap composed of 34 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:27:22] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 0 ms to minimize.
[2024-05-28 06:27:22] [INFO ] Deduced a trap composed of 33 places in 23 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/218 variables, 12/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:23] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/218 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/218 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 26 (OVERLAPS) 0/218 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 230 constraints, problems are : Problem set: 0 solved, 107 unsolved in 14923 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 101/101 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, 101/120 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:25] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:25] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 108/218 variables, 110/232 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 107/339 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:26] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:27:26] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 06:27:26] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-28 06:27:26] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:27:26] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:27:27] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:28] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-28 06:27:28] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:27:28] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:31] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:27:31] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:35] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:27:35] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/218 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 06:27:38] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-28 06:27:38] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/218 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/218 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 16 (OVERLAPS) 0/218 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 354 constraints, problems are : Problem set: 0 solved, 107 unsolved in 20284 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 118/118 constraints]
After SMT, in 35220ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 35221ms
Starting structural reductions in LTL mode, iteration 1 : 110/122 places, 108/120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35348 ms. Remains : 110/122 places, 108/120 transitions.
[2024-05-28 06:27:45] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:27:45] [INFO ] Flatten gal took : 4 ms
[2024-05-28 06:27:45] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-28 06:27:45] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:27:45] [INFO ] Flatten gal took : 2 ms
[2024-05-28 06:27:45] [INFO ] Time to serialize gal into /tmp/CTLFireability14906263718337014299.gal : 2 ms
[2024-05-28 06:27:45] [INFO ] Time to serialize properties into /tmp/CTLFireability8392693500478083385.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14906263718337014299.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8392693500478083385.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.27785e+11,4.99815,145464,2,10098,5,420593,6,0,550,982768,0


Converting to forward existential form...Done !
original formula: AG((((EX(((p21==1)&&(p49==1))) + AF(AG((p63==1)))) + (EF(((p52==0)&&(p70==0))) + (p62==1))) + ((p51==1)&&(p69==1))))
=> equivalent forward existential formula: [FwdG((((FwdU(Init,TRUE) * !(((p51==1)&&(p69==1)))) * !((E(TRUE U ((p52==0)&&(p70==0))) + (p62==1)))) * !(EX(((p...213
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
(forward)formula 0,1,17.0998,428272,1,0,470,1.80185e+06,244,122,3488,2.97281e+06,447
FORMULA ShieldIIPs-PT-002B-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-28 06:28:02] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:28:02] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:28:02] [INFO ] Applying decomposition
[2024-05-28 06:28: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/graph11440626749765458540.txt' '-o' '/tmp/graph11440626749765458540.bin' '-w' '/tmp/graph11440626749765458540.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11440626749765458540.bin' '-l' '-1' '-v' '-w' '/tmp/graph11440626749765458540.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:28:02] [INFO ] Decomposing Gal with order
[2024-05-28 06:28:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:28:02] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-28 06:28:02] [INFO ] Flatten gal took : 15 ms
[2024-05-28 06:28:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 06:28:02] [INFO ] Time to serialize gal into /tmp/CTLFireability3307610914843868933.gal : 2 ms
[2024-05-28 06:28:02] [INFO ] Time to serialize properties into /tmp/CTLFireability18250656359610692507.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/CTLFireability3307610914843868933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18250656359610692507.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 11 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.30668e+11,2.18844,69840,2432,62,120870,246,367,199836,54,1289,0


Converting to forward existential form...Done !
original formula: EG(EF(AX((i5.u18.p60==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(EX(!((i5.u18.p60==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t46, t48, t50, t75, t77, t79, i0.u6.t81, i1.u1.t83, i1.u9.t78, i2.t72, i2.u12.t1, i2.u12.t2, ...793
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-28 06:30:02] [INFO ] Applying decomposition
[2024-05-28 06:30:02] [INFO ] Flatten gal took : 3 ms
[2024-05-28 06:30:02] [INFO ] Decomposing Gal with order
[2024-05-28 06:30:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:30:02] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-28 06:30:02] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:30:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 2 ms.
[2024-05-28 06:30:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1479753610705124321.gal : 2 ms
[2024-05-28 06:30:02] [INFO ] Time to serialize properties into /tmp/CTLFireability5050154059011479912.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/CTLFireability1479753610705124321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5050154059011479912.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 11 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.30668e+11,21.6587,712124,15599,283,1.28844e+06,1240,200,5.23951e+06,94,19491,0


Converting to forward existential form...Done !
original formula: EG(EF(AX((i0.i1.u19.p60==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(EX(!((i0.i1.u19.p60==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.u2.t83, i0.i1.u19.t9, i0.i1.u19.t10, i0.i1.u19.t11, i0.i1.u19.t12, i0.i1.u19.t58, i0.i1.u1...1246
Detected timeout of ITS tools.
[2024-05-28 06:56:29] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:56:29] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-28 06:56:29] [INFO ] Transformed 122 places.
[2024-05-28 06:56:29] [INFO ] Transformed 120 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 06:56:29] [INFO ] Time to serialize gal into /tmp/CTLFireability15432879850470619454.gal : 3 ms
[2024-05-28 06:56:29] [INFO ] Time to serialize properties into /tmp/CTLFireability12140320535627698363.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/CTLFireability15432879850470619454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12140320535627698363.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 11 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.30668e+11,8.74129,249932,2,45156,5,812857,6,0,610,1.67473e+06,0


Converting to forward existential form...Done !
original formula: EG(EF(AX((p60==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(EX(!((p60==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t15, t16, t17, t18, t19, t20, t21, t2...422

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-002B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-002B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683760200026"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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